./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:48:02,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:48:02,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:48:02,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:48:02,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:48:02,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:48:02,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:48:02,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:48:02,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:48:02,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:48:02,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:48:02,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:48:02,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:48:02,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:48:02,948 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:48:02,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:48:02,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:48:02,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:48:02,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:48:02,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:48:02,951 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:48:02,951 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:48:02,952 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:48:02,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:48:02,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:48:02,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:48:02,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:48:02,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:48:02,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:48:02,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:48:02,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:48:02,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:48:02,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:48:02,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:02,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:48:02,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:48:02,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:48:02,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:48:02,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:48:02,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:48:02,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:48:02,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:48:02,959 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2024-11-09 07:48:03,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:48:03,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:48:03,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:48:03,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:48:03,233 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:48:03,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-09 07:48:04,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:48:04,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:48:04,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-09 07:48:04,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3023115/ac95a9cff7284696a5bf964ad168a978/FLAG2fea57a5a [2024-11-09 07:48:04,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3023115/ac95a9cff7284696a5bf964ad168a978 [2024-11-09 07:48:04,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:48:05,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:48:05,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:05,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:48:05,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:48:05,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:04" (1/1) ... [2024-11-09 07:48:05,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf9b768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05, skipping insertion in model container [2024-11-09 07:48:05,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:04" (1/1) ... [2024-11-09 07:48:05,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:05,452 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:05,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:05,474 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:48:05,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:05,579 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:48:05,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05 WrapperNode [2024-11-09 07:48:05,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:05,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:05,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:48:05,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:48:05,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,645 INFO L138 Inliner]: procedures = 168, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 99 [2024-11-09 07:48:05,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:05,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:48:05,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:48:05,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:48:05,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,706 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-11-09 07:48:05,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:48:05,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:48:05,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:48:05,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:48:05,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (1/1) ... [2024-11-09 07:48:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:05,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:48:05,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:48:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:48:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:48:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:48:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-09 07:48:05,864 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-09 07:48:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:48:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:48:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:48:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:48:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:48:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:48:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:48:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:48:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:48:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:48:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:48:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:48:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:48:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:48:05,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:48:05,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:48:06,250 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 07:48:06,250 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:48:06,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:48:06,264 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:48:06,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:06 BoogieIcfgContainer [2024-11-09 07:48:06,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:48:06,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:48:06,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:48:06,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:48:06,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:48:04" (1/3) ... [2024-11-09 07:48:06,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:06, skipping insertion in model container [2024-11-09 07:48:06,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:05" (2/3) ... [2024-11-09 07:48:06,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:06, skipping insertion in model container [2024-11-09 07:48:06,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:06" (3/3) ... [2024-11-09 07:48:06,277 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2024-11-09 07:48:06,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:48:06,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-09 07:48:06,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:48:06,341 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59a630a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:48:06,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-09 07:48:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:48:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:06,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:06,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:06,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:06,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash -565372166, now seen corresponding path program 1 times [2024-11-09 07:48:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299936456] [2024-11-09 07:48:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:06,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299936456] [2024-11-09 07:48:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299936456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:06,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:48:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561157777] [2024-11-09 07:48:06,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:06,797 INFO L87 Difference]: Start difference. First operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:06,953 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-11-09 07:48:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:48:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:06,970 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:48:06,970 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:48:06,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:06,975 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 163 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:06,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 117 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:48:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2024-11-09 07:48:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 88 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:48:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2024-11-09 07:48:07,019 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 6 [2024-11-09 07:48:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:07,020 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2024-11-09 07:48:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2024-11-09 07:48:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:07,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:07,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:07,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:48:07,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash -565372165, now seen corresponding path program 1 times [2024-11-09 07:48:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465728506] [2024-11-09 07:48:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:07,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:07,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465728506] [2024-11-09 07:48:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465728506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:07,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283400099] [2024-11-09 07:48:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:07,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:07,205 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:07,350 INFO L93 Difference]: Finished difference Result 200 states and 272 transitions. [2024-11-09 07:48:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:48:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:07,353 INFO L225 Difference]: With dead ends: 200 [2024-11-09 07:48:07,353 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 07:48:07,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:07,355 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:07,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 226 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 07:48:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 174. [2024-11-09 07:48:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 136 states have (on average 1.6397058823529411) internal successors, (223), 156 states have internal predecessors, (223), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 268 transitions. [2024-11-09 07:48:07,395 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 268 transitions. Word has length 6 [2024-11-09 07:48:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:07,396 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 268 transitions. [2024-11-09 07:48:07,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 268 transitions. [2024-11-09 07:48:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:48:07,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:07,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:07,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:48:07,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -346667981, now seen corresponding path program 1 times [2024-11-09 07:48:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136255151] [2024-11-09 07:48:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:07,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136255151] [2024-11-09 07:48:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136255151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:07,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853199581] [2024-11-09 07:48:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:07,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:07,646 INFO L87 Difference]: Start difference. First operand 174 states and 268 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:07,813 INFO L93 Difference]: Finished difference Result 225 states and 323 transitions. [2024-11-09 07:48:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:48:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:07,818 INFO L225 Difference]: With dead ends: 225 [2024-11-09 07:48:07,821 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 07:48:07,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:07,822 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:07,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 184 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 07:48:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 177. [2024-11-09 07:48:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.6258992805755397) internal successors, (226), 159 states have internal predecessors, (226), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2024-11-09 07:48:07,845 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 7 [2024-11-09 07:48:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2024-11-09 07:48:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2024-11-09 07:48:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:48:07,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:07,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:48:07,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:07,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2138194522, now seen corresponding path program 1 times [2024-11-09 07:48:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622019985] [2024-11-09 07:48:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622019985] [2024-11-09 07:48:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622019985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648188640] [2024-11-09 07:48:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:08,151 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:08,276 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2024-11-09 07:48:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:48:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:08,278 INFO L225 Difference]: With dead ends: 202 [2024-11-09 07:48:08,278 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 07:48:08,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:08,281 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:08,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 07:48:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2024-11-09 07:48:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.6115107913669064) internal successors, (224), 159 states have internal predecessors, (224), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2024-11-09 07:48:08,305 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 8 [2024-11-09 07:48:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2024-11-09 07:48:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2024-11-09 07:48:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:48:08,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:08,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:48:08,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1859520789, now seen corresponding path program 1 times [2024-11-09 07:48:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633922558] [2024-11-09 07:48:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633922558] [2024-11-09 07:48:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633922558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:08,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395485027] [2024-11-09 07:48:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:08,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:08,378 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:08,486 INFO L93 Difference]: Finished difference Result 272 states and 372 transitions. [2024-11-09 07:48:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:48:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:08,488 INFO L225 Difference]: With dead ends: 272 [2024-11-09 07:48:08,489 INFO L226 Difference]: Without dead ends: 272 [2024-11-09 07:48:08,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:08,490 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 149 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:08,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 197 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-09 07:48:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 211. [2024-11-09 07:48:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 171 states have (on average 1.5847953216374269) internal successors, (271), 192 states have internal predecessors, (271), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2024-11-09 07:48:08,503 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 316 transitions. Word has length 9 [2024-11-09 07:48:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:08,503 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 316 transitions. [2024-11-09 07:48:08,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 316 transitions. [2024-11-09 07:48:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:48:08,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:08,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:08,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:48:08,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:08,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1810569660, now seen corresponding path program 1 times [2024-11-09 07:48:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336226684] [2024-11-09 07:48:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336226684] [2024-11-09 07:48:08,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336226684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659147960] [2024-11-09 07:48:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:08,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:08,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:08,587 INFO L87 Difference]: Start difference. First operand 211 states and 316 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:08,680 INFO L93 Difference]: Finished difference Result 259 states and 339 transitions. [2024-11-09 07:48:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:48:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:08,683 INFO L225 Difference]: With dead ends: 259 [2024-11-09 07:48:08,683 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 07:48:08,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:08,685 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 187 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:08,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 219 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 07:48:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2024-11-09 07:48:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 184 states have (on average 1.5869565217391304) internal successors, (292), 206 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 337 transitions. [2024-11-09 07:48:08,703 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 337 transitions. Word has length 10 [2024-11-09 07:48:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:08,704 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 337 transitions. [2024-11-09 07:48:08,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 337 transitions. [2024-11-09 07:48:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:48:08,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:08,705 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:08,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:48:08,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash -381204798, now seen corresponding path program 1 times [2024-11-09 07:48:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513942371] [2024-11-09 07:48:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513942371] [2024-11-09 07:48:08,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513942371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7606775] [2024-11-09 07:48:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:08,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:08,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:08,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:48:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:08,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:09,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7606775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:09,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:09,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-11-09 07:48:09,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687717911] [2024-11-09 07:48:09,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:09,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:48:09,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:48:09,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:09,307 INFO L87 Difference]: Start difference. First operand 225 states and 337 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:09,525 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2024-11-09 07:48:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:48:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:09,528 INFO L225 Difference]: With dead ends: 251 [2024-11-09 07:48:09,528 INFO L226 Difference]: Without dead ends: 251 [2024-11-09 07:48:09,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:48:09,529 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:09,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 444 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-09 07:48:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 228. [2024-11-09 07:48:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 187 states have (on average 1.5294117647058822) internal successors, (286), 209 states have internal predecessors, (286), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 331 transitions. [2024-11-09 07:48:09,543 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 331 transitions. Word has length 14 [2024-11-09 07:48:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:09,544 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 331 transitions. [2024-11-09 07:48:09,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 331 transitions. [2024-11-09 07:48:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:48:09,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:09,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:09,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:48:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:09,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1067553100, now seen corresponding path program 1 times [2024-11-09 07:48:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218700422] [2024-11-09 07:48:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218700422] [2024-11-09 07:48:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218700422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627948517] [2024-11-09 07:48:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:09,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:09,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:09,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:09,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:48:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:10,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:48:10,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:10,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627948517] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:10,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:10,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-11-09 07:48:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824773988] [2024-11-09 07:48:10,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:10,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:48:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:10,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:48:10,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:48:10,269 INFO L87 Difference]: Start difference. First operand 228 states and 331 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:10,583 INFO L93 Difference]: Finished difference Result 277 states and 382 transitions. [2024-11-09 07:48:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:48:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:48:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:10,586 INFO L225 Difference]: With dead ends: 277 [2024-11-09 07:48:10,586 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 07:48:10,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:48:10,587 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 106 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:10,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 455 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 07:48:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2024-11-09 07:48:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 195 states have (on average 1.523076923076923) internal successors, (297), 217 states have internal predecessors, (297), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-09 07:48:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2024-11-09 07:48:10,602 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 15 [2024-11-09 07:48:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2024-11-09 07:48:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2024-11-09 07:48:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:48:10,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:10,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:10,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:48:10,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 07:48:10,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:10,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1265592223, now seen corresponding path program 1 times [2024-11-09 07:48:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967774706] [2024-11-09 07:48:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:10,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967774706] [2024-11-09 07:48:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967774706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283582224] [2024-11-09 07:48:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:11,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:48:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:11,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:48:11,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:11,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283582224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:11,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-09 07:48:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040624636] [2024-11-09 07:48:11,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:11,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:48:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:48:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:48:11,450 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:11,920 INFO L93 Difference]: Finished difference Result 402 states and 548 transitions. [2024-11-09 07:48:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:48:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:48:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:11,923 INFO L225 Difference]: With dead ends: 402 [2024-11-09 07:48:11,923 INFO L226 Difference]: Without dead ends: 402 [2024-11-09 07:48:11,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:48:11,924 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 295 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:11,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 551 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-09 07:48:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 334. [2024-11-09 07:48:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 287 states have (on average 1.5574912891986064) internal successors, (447), 309 states have internal predecessors, (447), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2024-11-09 07:48:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 511 transitions. [2024-11-09 07:48:11,940 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 511 transitions. Word has length 16 [2024-11-09 07:48:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:11,940 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 511 transitions. [2024-11-09 07:48:11,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 511 transitions. [2024-11-09 07:48:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:11,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:11,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:11,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:48:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:12,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689731, now seen corresponding path program 1 times [2024-11-09 07:48:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129389906] [2024-11-09 07:48:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129389906] [2024-11-09 07:48:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129389906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:12,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:12,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387899545] [2024-11-09 07:48:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:12,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,178 INFO L87 Difference]: Start difference. First operand 334 states and 511 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:12,204 INFO L93 Difference]: Finished difference Result 484 states and 745 transitions. [2024-11-09 07:48:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:48:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:12,207 INFO L225 Difference]: With dead ends: 484 [2024-11-09 07:48:12,207 INFO L226 Difference]: Without dead ends: 484 [2024-11-09 07:48:12,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,208 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 53 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:12,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-09 07:48:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 470. [2024-11-09 07:48:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 411 states have (on average 1.5547445255474452) internal successors, (639), 436 states have internal predecessors, (639), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2024-11-09 07:48:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 743 transitions. [2024-11-09 07:48:12,225 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 743 transitions. Word has length 18 [2024-11-09 07:48:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 743 transitions. [2024-11-09 07:48:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 743 transitions. [2024-11-09 07:48:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:12,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:12,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:12,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:48:12,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689987, now seen corresponding path program 1 times [2024-11-09 07:48:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290841599] [2024-11-09 07:48:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290841599] [2024-11-09 07:48:12,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290841599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:12,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:12,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343222401] [2024-11-09 07:48:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:12,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:12,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,253 INFO L87 Difference]: Start difference. First operand 470 states and 743 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:12,259 INFO L93 Difference]: Finished difference Result 432 states and 677 transitions. [2024-11-09 07:48:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:12,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:48:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:12,262 INFO L225 Difference]: With dead ends: 432 [2024-11-09 07:48:12,262 INFO L226 Difference]: Without dead ends: 432 [2024-11-09 07:48:12,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,263 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:12,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-09 07:48:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-11-09 07:48:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 379 states have (on average 1.5118733509234827) internal successors, (573), 398 states have internal predecessors, (573), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2024-11-09 07:48:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 677 transitions. [2024-11-09 07:48:12,278 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 677 transitions. Word has length 18 [2024-11-09 07:48:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:12,278 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 677 transitions. [2024-11-09 07:48:12,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 677 transitions. [2024-11-09 07:48:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:48:12,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:12,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:48:12,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:12,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1649708773, now seen corresponding path program 1 times [2024-11-09 07:48:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75588918] [2024-11-09 07:48:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75588918] [2024-11-09 07:48:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75588918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935352310] [2024-11-09 07:48:12,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:12,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,337 INFO L87 Difference]: Start difference. First operand 432 states and 677 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:12,369 INFO L93 Difference]: Finished difference Result 448 states and 681 transitions. [2024-11-09 07:48:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:48:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:12,373 INFO L225 Difference]: With dead ends: 448 [2024-11-09 07:48:12,373 INFO L226 Difference]: Without dead ends: 448 [2024-11-09 07:48:12,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,374 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:12,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 90 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-09 07:48:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 435. [2024-11-09 07:48:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 382 states have (on average 1.5) internal successors, (573), 401 states have internal predecessors, (573), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2024-11-09 07:48:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 677 transitions. [2024-11-09 07:48:12,396 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 677 transitions. Word has length 19 [2024-11-09 07:48:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:12,396 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 677 transitions. [2024-11-09 07:48:12,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 677 transitions. [2024-11-09 07:48:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:48:12,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:12,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:12,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:48:12,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:12,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -398635515, now seen corresponding path program 1 times [2024-11-09 07:48:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182829343] [2024-11-09 07:48:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:12,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182829343] [2024-11-09 07:48:12,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182829343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:12,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461622880] [2024-11-09 07:48:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,439 INFO L87 Difference]: Start difference. First operand 435 states and 677 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:12,462 INFO L93 Difference]: Finished difference Result 502 states and 759 transitions. [2024-11-09 07:48:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:48:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:12,465 INFO L225 Difference]: With dead ends: 502 [2024-11-09 07:48:12,466 INFO L226 Difference]: Without dead ends: 502 [2024-11-09 07:48:12,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:12,466 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:12,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-09 07:48:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2024-11-09 07:48:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 431 states have (on average 1.4965197215777262) internal successors, (645), 452 states have internal predecessors, (645), 20 states have call successors, (20), 15 states have call predecessors, (20), 22 states have return successors, (89), 20 states have call predecessors, (89), 20 states have call successors, (89) [2024-11-09 07:48:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 754 transitions. [2024-11-09 07:48:12,481 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 754 transitions. Word has length 20 [2024-11-09 07:48:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:12,482 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 754 transitions. [2024-11-09 07:48:12,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 754 transitions. [2024-11-09 07:48:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:48:12,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:12,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:12,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:48:12,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:12,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1948313302, now seen corresponding path program 1 times [2024-11-09 07:48:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:12,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159377916] [2024-11-09 07:48:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159377916] [2024-11-09 07:48:12,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159377916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:12,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:12,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:48:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632037660] [2024-11-09 07:48:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:12,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:12,551 INFO L87 Difference]: Start difference. First operand 488 states and 754 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:12,617 INFO L93 Difference]: Finished difference Result 364 states and 534 transitions. [2024-11-09 07:48:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 07:48:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:12,620 INFO L225 Difference]: With dead ends: 364 [2024-11-09 07:48:12,620 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 07:48:12,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:12,621 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:12,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 63 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 07:48:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2024-11-09 07:48:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 310 states have (on average 1.461290322580645) internal successors, (453), 334 states have internal predecessors, (453), 15 states have call successors, (15), 11 states have call predecessors, (15), 21 states have return successors, (63), 15 states have call predecessors, (63), 15 states have call successors, (63) [2024-11-09 07:48:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 531 transitions. [2024-11-09 07:48:12,633 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 531 transitions. Word has length 25 [2024-11-09 07:48:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:12,633 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 531 transitions. [2024-11-09 07:48:12,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 531 transitions. [2024-11-09 07:48:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:48:12,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:12,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:48:12,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1793598830, now seen corresponding path program 1 times [2024-11-09 07:48:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574677561] [2024-11-09 07:48:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574677561] [2024-11-09 07:48:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574677561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432482422] [2024-11-09 07:48:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:12,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:12,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:48:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:48:12,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:13,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:13,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:13,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432482422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:13,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:13,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-11-09 07:48:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284623279] [2024-11-09 07:48:13,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:13,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:48:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:48:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:48:13,468 INFO L87 Difference]: Start difference. First operand 361 states and 531 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,984 INFO L93 Difference]: Finished difference Result 380 states and 536 transitions. [2024-11-09 07:48:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:48:13,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-09 07:48:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,987 INFO L225 Difference]: With dead ends: 380 [2024-11-09 07:48:13,987 INFO L226 Difference]: Without dead ends: 380 [2024-11-09 07:48:13,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:48:13,988 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 337 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:13,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 109 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-09 07:48:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 369. [2024-11-09 07:48:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 320 states have (on average 1.421875) internal successors, (455), 342 states have internal predecessors, (455), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-11-09 07:48:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 530 transitions. [2024-11-09 07:48:14,000 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 530 transitions. Word has length 27 [2024-11-09 07:48:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:14,000 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 530 transitions. [2024-11-09 07:48:14,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 530 transitions. [2024-11-09 07:48:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:48:14,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:14,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:14,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:48:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:48:14,204 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:14,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1075966913, now seen corresponding path program 1 times [2024-11-09 07:48:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283700806] [2024-11-09 07:48:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283700806] [2024-11-09 07:48:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283700806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210470601] [2024-11-09 07:48:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:14,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:14,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:14,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:14,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:48:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:14,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:14,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:14,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210470601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:14,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-11-09 07:48:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154078209] [2024-11-09 07:48:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:14,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:48:14,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:48:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:48:14,624 INFO L87 Difference]: Start difference. First operand 369 states and 530 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:14,684 INFO L93 Difference]: Finished difference Result 393 states and 550 transitions. [2024-11-09 07:48:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:48:14,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 07:48:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:14,687 INFO L225 Difference]: With dead ends: 393 [2024-11-09 07:48:14,687 INFO L226 Difference]: Without dead ends: 393 [2024-11-09 07:48:14,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:48:14,688 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 69 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:14,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 161 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-09 07:48:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 382. [2024-11-09 07:48:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 333 states have (on average 1.4054054054054055) internal successors, (468), 355 states have internal predecessors, (468), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-11-09 07:48:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 543 transitions. [2024-11-09 07:48:14,699 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 543 transitions. Word has length 28 [2024-11-09 07:48:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:14,699 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 543 transitions. [2024-11-09 07:48:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 543 transitions. [2024-11-09 07:48:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:48:14,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:14,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:14,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:48:14,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 07:48:14,901 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1366588429, now seen corresponding path program 1 times [2024-11-09 07:48:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653375391] [2024-11-09 07:48:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:15,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653375391] [2024-11-09 07:48:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653375391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840565587] [2024-11-09 07:48:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:15,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:15,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:48:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:15,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:48:15,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:15,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:15,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:15,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840565587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:16,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-11-09 07:48:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938651375] [2024-11-09 07:48:16,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:16,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:48:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:48:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:48:16,121 INFO L87 Difference]: Start difference. First operand 382 states and 543 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:16,724 INFO L93 Difference]: Finished difference Result 392 states and 544 transitions. [2024-11-09 07:48:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:48:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-09 07:48:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:16,726 INFO L225 Difference]: With dead ends: 392 [2024-11-09 07:48:16,727 INFO L226 Difference]: Without dead ends: 392 [2024-11-09 07:48:16,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:48:16,729 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 300 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:16,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 160 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-09 07:48:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 385. [2024-11-09 07:48:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 336 states have (on average 1.3869047619047619) internal successors, (466), 358 states have internal predecessors, (466), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-11-09 07:48:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 541 transitions. [2024-11-09 07:48:16,742 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 541 transitions. Word has length 29 [2024-11-09 07:48:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:16,743 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 541 transitions. [2024-11-09 07:48:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 541 transitions. [2024-11-09 07:48:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:48:16,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:16,744 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:16,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:48:16,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 07:48:16,946 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:16,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1661947307, now seen corresponding path program 1 times [2024-11-09 07:48:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107673952] [2024-11-09 07:48:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:16,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107673952] [2024-11-09 07:48:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107673952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916633161] [2024-11-09 07:48:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:17,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:17,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:17,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:48:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:17,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:48:17,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:17,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916633161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:17,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:17,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2024-11-09 07:48:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944682427] [2024-11-09 07:48:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:17,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:48:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:48:17,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:48:17,417 INFO L87 Difference]: Start difference. First operand 385 states and 541 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:17,518 INFO L93 Difference]: Finished difference Result 374 states and 505 transitions. [2024-11-09 07:48:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:48:17,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 07:48:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:17,520 INFO L225 Difference]: With dead ends: 374 [2024-11-09 07:48:17,520 INFO L226 Difference]: Without dead ends: 373 [2024-11-09 07:48:17,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:48:17,521 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 90 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:17,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 230 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-09 07:48:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2024-11-09 07:48:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 321 states have (on average 1.3894080996884735) internal successors, (446), 344 states have internal predecessors, (446), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2024-11-09 07:48:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2024-11-09 07:48:17,531 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 30 [2024-11-09 07:48:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:17,532 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2024-11-09 07:48:17,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2024-11-09 07:48:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:48:17,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:17,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:17,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:48:17,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:17,738 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:17,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash -585431614, now seen corresponding path program 1 times [2024-11-09 07:48:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:17,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364911715] [2024-11-09 07:48:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364911715] [2024-11-09 07:48:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364911715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707455570] [2024-11-09 07:48:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:17,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:17,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:17,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:48:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:18,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:48:18,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:18,095 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:18,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:48:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:18,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707455570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:18,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-11-09 07:48:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236758765] [2024-11-09 07:48:18,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:18,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:48:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:18,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:48:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:18,199 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:48:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:18,715 INFO L93 Difference]: Finished difference Result 498 states and 633 transitions. [2024-11-09 07:48:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:48:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 07:48:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:18,718 INFO L225 Difference]: With dead ends: 498 [2024-11-09 07:48:18,718 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 07:48:18,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:48:18,719 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 371 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:18,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 203 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 07:48:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 443. [2024-11-09 07:48:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 395 states have (on average 1.3544303797468353) internal successors, (535), 419 states have internal predecessors, (535), 12 states have call successors, (12), 11 states have call predecessors, (12), 21 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2024-11-09 07:48:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 588 transitions. [2024-11-09 07:48:18,734 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 588 transitions. Word has length 30 [2024-11-09 07:48:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 588 transitions. [2024-11-09 07:48:18,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:48:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 588 transitions. [2024-11-09 07:48:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:48:18,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:18,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:18,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:48:18,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:18,936 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:18,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash -968510801, now seen corresponding path program 1 times [2024-11-09 07:48:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:18,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435046617] [2024-11-09 07:48:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:18,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:19,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435046617] [2024-11-09 07:48:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435046617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461935137] [2024-11-09 07:48:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:19,156 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:19,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:48:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:19,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:48:19,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:19,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:19,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:19,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461935137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:19,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:19,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-11-09 07:48:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337711091] [2024-11-09 07:48:19,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:48:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:48:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:48:19,546 INFO L87 Difference]: Start difference. First operand 443 states and 588 transitions. Second operand has 16 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:20,304 INFO L93 Difference]: Finished difference Result 601 states and 738 transitions. [2024-11-09 07:48:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:48:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-09 07:48:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:20,306 INFO L225 Difference]: With dead ends: 601 [2024-11-09 07:48:20,307 INFO L226 Difference]: Without dead ends: 601 [2024-11-09 07:48:20,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 07:48:20,308 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 517 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:20,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 267 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:48:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-09 07:48:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 546. [2024-11-09 07:48:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 493 states have (on average 1.3367139959432048) internal successors, (659), 521 states have internal predecessors, (659), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-09 07:48:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 707 transitions. [2024-11-09 07:48:20,324 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 707 transitions. Word has length 31 [2024-11-09 07:48:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:20,324 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 707 transitions. [2024-11-09 07:48:20,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 707 transitions. [2024-11-09 07:48:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:48:20,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:20,325 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:20,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:48:20,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:20,527 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:20,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash -235524555, now seen corresponding path program 1 times [2024-11-09 07:48:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962270482] [2024-11-09 07:48:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:20,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962270482] [2024-11-09 07:48:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962270482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314722897] [2024-11-09 07:48:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:20,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:20,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:20,846 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:20,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:48:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:20,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:48:20,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:21,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:21,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:21,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314722897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:21,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-11-09 07:48:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070642643] [2024-11-09 07:48:21,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:21,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:48:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:48:21,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:48:21,488 INFO L87 Difference]: Start difference. First operand 546 states and 707 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:22,134 INFO L93 Difference]: Finished difference Result 563 states and 701 transitions. [2024-11-09 07:48:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:48:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-09 07:48:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:22,136 INFO L225 Difference]: With dead ends: 563 [2024-11-09 07:48:22,137 INFO L226 Difference]: Without dead ends: 563 [2024-11-09 07:48:22,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:48:22,138 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 335 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:22,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 160 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-09 07:48:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 545. [2024-11-09 07:48:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 495 states have (on average 1.286868686868687) internal successors, (637), 520 states have internal predecessors, (637), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-09 07:48:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 685 transitions. [2024-11-09 07:48:22,153 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 685 transitions. Word has length 35 [2024-11-09 07:48:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 685 transitions. [2024-11-09 07:48:22,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 685 transitions. [2024-11-09 07:48:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:48:22,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:22,155 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:22,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 07:48:22,356 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1961361480, now seen corresponding path program 1 times [2024-11-09 07:48:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945600772] [2024-11-09 07:48:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:22,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945600772] [2024-11-09 07:48:22,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945600772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142572348] [2024-11-09 07:48:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:22,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:22,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:22,577 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:22,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:48:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:22,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:48:22,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:22,827 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:22,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:48:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:48:22,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:22,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 07:48:23,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 07:48:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:48:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142572348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:23,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-11-09 07:48:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386929593] [2024-11-09 07:48:23,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:48:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:23,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:48:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:48:23,150 INFO L87 Difference]: Start difference. First operand 545 states and 685 transitions. Second operand has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:48:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:23,595 INFO L93 Difference]: Finished difference Result 593 states and 718 transitions. [2024-11-09 07:48:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:48:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-11-09 07:48:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:23,600 INFO L225 Difference]: With dead ends: 593 [2024-11-09 07:48:23,600 INFO L226 Difference]: Without dead ends: 593 [2024-11-09 07:48:23,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:48:23,602 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 376 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:23,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 178 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-09 07:48:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 552. [2024-11-09 07:48:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 503 states have (on average 1.286282306163022) internal successors, (647), 527 states have internal predecessors, (647), 12 states have call successors, (12), 12 states have call predecessors, (12), 25 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-09 07:48:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 692 transitions. [2024-11-09 07:48:23,615 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 692 transitions. Word has length 36 [2024-11-09 07:48:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:23,616 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 692 transitions. [2024-11-09 07:48:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:48:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 692 transitions. [2024-11-09 07:48:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:48:23,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:23,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:23,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 07:48:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 07:48:23,821 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash 672663717, now seen corresponding path program 1 times [2024-11-09 07:48:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310214799] [2024-11-09 07:48:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:24,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:24,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310214799] [2024-11-09 07:48:24,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310214799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:24,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606728773] [2024-11-09 07:48:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:24,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:24,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:24,404 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:24,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:48:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:24,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:24,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:24,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606728773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:25,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2024-11-09 07:48:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295622899] [2024-11-09 07:48:25,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:25,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:48:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:48:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:48:25,077 INFO L87 Difference]: Start difference. First operand 552 states and 692 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:48:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:26,509 INFO L93 Difference]: Finished difference Result 827 states and 997 transitions. [2024-11-09 07:48:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 07:48:26,510 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-11-09 07:48:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:26,513 INFO L225 Difference]: With dead ends: 827 [2024-11-09 07:48:26,513 INFO L226 Difference]: Without dead ends: 827 [2024-11-09 07:48:26,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=553, Invalid=2527, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 07:48:26,515 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 876 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:26,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 476 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:48:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-09 07:48:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 555. [2024-11-09 07:48:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 508 states have (on average 1.2775590551181102) internal successors, (649), 532 states have internal predecessors, (649), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:48:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 691 transitions. [2024-11-09 07:48:26,530 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 691 transitions. Word has length 37 [2024-11-09 07:48:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:26,531 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 691 transitions. [2024-11-09 07:48:26,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:48:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 691 transitions. [2024-11-09 07:48:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:48:26,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:26,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:26,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:48:26,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 07:48:26,733 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1977086476, now seen corresponding path program 1 times [2024-11-09 07:48:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859682351] [2024-11-09 07:48:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859682351] [2024-11-09 07:48:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859682351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011114170] [2024-11-09 07:48:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:26,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:26,826 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:26,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:48:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:48:26,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:26,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011114170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:26,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-09 07:48:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607185502] [2024-11-09 07:48:26,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:26,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:26,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:26,981 INFO L87 Difference]: Start difference. First operand 555 states and 691 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:27,063 INFO L93 Difference]: Finished difference Result 565 states and 696 transitions. [2024-11-09 07:48:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:27,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-09 07:48:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:27,065 INFO L225 Difference]: With dead ends: 565 [2024-11-09 07:48:27,065 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 07:48:27,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:27,066 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 66 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:27,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 56 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 07:48:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 553. [2024-11-09 07:48:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 508 states have (on average 1.263779527559055) internal successors, (642), 530 states have internal predecessors, (642), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:48:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 684 transitions. [2024-11-09 07:48:27,091 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 684 transitions. Word has length 40 [2024-11-09 07:48:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:27,091 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 684 transitions. [2024-11-09 07:48:27,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 684 transitions. [2024-11-09 07:48:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:48:27,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:27,092 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:27,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 07:48:27,297 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr20ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1160138508, now seen corresponding path program 1 times [2024-11-09 07:48:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992839573] [2024-11-09 07:48:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992839573] [2024-11-09 07:48:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992839573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017121996] [2024-11-09 07:48:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:27,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:27,402 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:27,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:48:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:48:27,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:27,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017121996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:27,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-09 07:48:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430096877] [2024-11-09 07:48:27,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:27,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:27,589 INFO L87 Difference]: Start difference. First operand 553 states and 684 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:27,677 INFO L93 Difference]: Finished difference Result 563 states and 689 transitions. [2024-11-09 07:48:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:27,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-11-09 07:48:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:27,679 INFO L225 Difference]: With dead ends: 563 [2024-11-09 07:48:27,679 INFO L226 Difference]: Without dead ends: 563 [2024-11-09 07:48:27,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:27,680 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:27,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 46 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-09 07:48:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 544. [2024-11-09 07:48:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 501 states have (on average 1.251497005988024) internal successors, (627), 521 states have internal predecessors, (627), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:48:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 669 transitions. [2024-11-09 07:48:27,696 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 669 transitions. Word has length 41 [2024-11-09 07:48:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:27,696 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 669 transitions. [2024-11-09 07:48:27,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 669 transitions. [2024-11-09 07:48:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:48:27,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:27,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:27,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 07:48:27,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:27,899 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:27,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1604555274, now seen corresponding path program 1 times [2024-11-09 07:48:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316728081] [2024-11-09 07:48:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:28,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:28,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316728081] [2024-11-09 07:48:28,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316728081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:28,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553633590] [2024-11-09 07:48:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:28,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:28,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:28,039 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:28,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:48:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:48:28,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:28,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:48:28,172 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:48:28,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:48:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:28,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553633590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:28,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-09 07:48:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019925798] [2024-11-09 07:48:28,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:28,238 INFO L87 Difference]: Start difference. First operand 544 states and 669 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:28,373 INFO L93 Difference]: Finished difference Result 568 states and 684 transitions. [2024-11-09 07:48:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-11-09 07:48:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:28,376 INFO L225 Difference]: With dead ends: 568 [2024-11-09 07:48:28,376 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 07:48:28,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:28,376 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:28,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 86 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 07:48:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 544. [2024-11-09 07:48:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 501 states have (on average 1.2415169660678642) internal successors, (622), 521 states have internal predecessors, (622), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:48:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 664 transitions. [2024-11-09 07:48:28,390 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 664 transitions. Word has length 42 [2024-11-09 07:48:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:28,390 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 664 transitions. [2024-11-09 07:48:28,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 664 transitions. [2024-11-09 07:48:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:48:28,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:28,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:28,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 07:48:28,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:48:28,595 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1106351333, now seen corresponding path program 1 times [2024-11-09 07:48:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322003236] [2024-11-09 07:48:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:28,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322003236] [2024-11-09 07:48:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322003236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416716841] [2024-11-09 07:48:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:28,660 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:28,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 07:48:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:48:28,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:28,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:28,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416716841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:28,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:28,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-09 07:48:28,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87450308] [2024-11-09 07:48:28,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:28,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:28,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:28,795 INFO L87 Difference]: Start difference. First operand 544 states and 664 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:28,819 INFO L93 Difference]: Finished difference Result 348 states and 404 transitions. [2024-11-09 07:48:28,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:28,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-11-09 07:48:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:28,821 INFO L225 Difference]: With dead ends: 348 [2024-11-09 07:48:28,822 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 07:48:28,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:28,823 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:28,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 07:48:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2024-11-09 07:48:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 308 states have (on average 1.2045454545454546) internal successors, (371), 322 states have internal predecessors, (371), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-09 07:48:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 396 transitions. [2024-11-09 07:48:28,831 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 396 transitions. Word has length 45 [2024-11-09 07:48:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 396 transitions. [2024-11-09 07:48:28,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 396 transitions. [2024-11-09 07:48:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:48:28,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:28,832 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:28,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 07:48:29,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:48:29,034 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:29,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash -746846498, now seen corresponding path program 1 times [2024-11-09 07:48:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:29,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516739665] [2024-11-09 07:48:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516739665] [2024-11-09 07:48:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516739665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417013278] [2024-11-09 07:48:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:29,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:29,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:29,292 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:29,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 07:48:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:48:29,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:29,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:48:29,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:48:29,605 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:29,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:48:29,633 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:29,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:48:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:29,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:29,728 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:48:29,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2024-11-09 07:48:29,902 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:48:29,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2024-11-09 07:48:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417013278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:30,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 25 [2024-11-09 07:48:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523025116] [2024-11-09 07:48:30,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:48:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:48:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:48:30,081 INFO L87 Difference]: Start difference. First operand 339 states and 396 transitions. Second operand has 26 states, 24 states have (on average 5.5) internal successors, (132), 24 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:48:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:30,261 INFO L93 Difference]: Finished difference Result 348 states and 404 transitions. [2024-11-09 07:48:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.5) internal successors, (132), 24 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 51 [2024-11-09 07:48:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:30,263 INFO L225 Difference]: With dead ends: 348 [2024-11-09 07:48:30,263 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 07:48:30,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:48:30,264 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 201 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:30,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 77 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 07:48:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2024-11-09 07:48:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 308 states have (on average 1.198051948051948) internal successors, (369), 321 states have internal predecessors, (369), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-09 07:48:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 394 transitions. [2024-11-09 07:48:30,271 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 394 transitions. Word has length 51 [2024-11-09 07:48:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:30,271 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 394 transitions. [2024-11-09 07:48:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.5) internal successors, (132), 24 states have internal predecessors, (132), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:48:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 394 transitions. [2024-11-09 07:48:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:48:30,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:30,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:30,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 07:48:30,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 07:48:30,474 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:30,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2030471307, now seen corresponding path program 1 times [2024-11-09 07:48:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:30,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450045450] [2024-11-09 07:48:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450045450] [2024-11-09 07:48:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450045450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062442300] [2024-11-09 07:48:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:30,659 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:30,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 07:48:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:30,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:48:30,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:30,799 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_77| Int)) (and (<= |v_parse_input_c1_~x~0#1.base_77| c_~global~0.base) (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_77| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_77|))))) is different from true [2024-11-09 07:48:30,829 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:30,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:48:30,993 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:48:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:48:31,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062442300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:31,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:31,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2024-11-09 07:48:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171586041] [2024-11-09 07:48:31,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:31,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:48:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:31,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:48:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:48:31,144 INFO L87 Difference]: Start difference. First operand 338 states and 394 transitions. Second operand has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 15 states have internal predecessors, (92), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:32,217 INFO L93 Difference]: Finished difference Result 331 states and 363 transitions. [2024-11-09 07:48:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 07:48:32,218 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 15 states have internal predecessors, (92), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2024-11-09 07:48:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:32,219 INFO L225 Difference]: With dead ends: 331 [2024-11-09 07:48:32,219 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 07:48:32,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=484, Invalid=1969, Unknown=1, NotChecked=96, Total=2550 [2024-11-09 07:48:32,221 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 431 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:32,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 348 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 680 Invalid, 0 Unknown, 217 Unchecked, 0.5s Time] [2024-11-09 07:48:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 07:48:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 295. [2024-11-09 07:48:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.174721189591078) internal successors, (316), 280 states have internal predecessors, (316), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 336 transitions. [2024-11-09 07:48:32,234 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 336 transitions. Word has length 51 [2024-11-09 07:48:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:32,235 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 336 transitions. [2024-11-09 07:48:32,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.411764705882353) internal successors, (92), 15 states have internal predecessors, (92), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 336 transitions. [2024-11-09 07:48:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:48:32,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:32,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:32,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 07:48:32,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:48:32,439 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:32,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1677404977, now seen corresponding path program 1 times [2024-11-09 07:48:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:32,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592125325] [2024-11-09 07:48:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592125325] [2024-11-09 07:48:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592125325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367624287] [2024-11-09 07:48:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:32,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:32,909 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 07:48:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:33,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 07:48:33,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:33,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:48:33,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:48:33,388 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:33,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:48:33,437 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:33,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:48:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:33,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:33,619 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-09 07:48:33,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 165 [2024-11-09 07:48:33,841 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-09 07:48:33,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2024-11-09 07:48:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:34,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367624287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:34,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:34,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 35 [2024-11-09 07:48:34,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69763073] [2024-11-09 07:48:34,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:34,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:48:34,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:34,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:48:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 07:48:34,142 INFO L87 Difference]: Start difference. First operand 295 states and 336 transitions. Second operand has 37 states, 33 states have (on average 4.121212121212121) internal successors, (136), 29 states have internal predecessors, (136), 6 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:48:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:34,603 INFO L93 Difference]: Finished difference Result 307 states and 345 transitions. [2024-11-09 07:48:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:48:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 4.121212121212121) internal successors, (136), 29 states have internal predecessors, (136), 6 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2024-11-09 07:48:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:34,605 INFO L225 Difference]: With dead ends: 307 [2024-11-09 07:48:34,605 INFO L226 Difference]: Without dead ends: 307 [2024-11-09 07:48:34,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 07:48:34,606 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 421 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:34,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 165 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-09 07:48:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2024-11-09 07:48:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.1672862453531598) internal successors, (314), 280 states have internal predecessors, (314), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 334 transitions. [2024-11-09 07:48:34,613 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 334 transitions. Word has length 52 [2024-11-09 07:48:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:34,613 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 334 transitions. [2024-11-09 07:48:34,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 4.121212121212121) internal successors, (136), 29 states have internal predecessors, (136), 6 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:48:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 334 transitions. [2024-11-09 07:48:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:48:34,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:34,614 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:34,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 07:48:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:34,815 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1614101557, now seen corresponding path program 1 times [2024-11-09 07:48:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808696310] [2024-11-09 07:48:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 07:48:35,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:35,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808696310] [2024-11-09 07:48:35,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808696310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:35,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381773021] [2024-11-09 07:48:35,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:35,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:35,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:35,068 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:35,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 07:48:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:48:35,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:35,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:35,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:48:35,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:35,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381773021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:35,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2024-11-09 07:48:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017736233] [2024-11-09 07:48:35,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:48:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:48:35,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:48:35,522 INFO L87 Difference]: Start difference. First operand 295 states and 334 transitions. Second operand has 17 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:36,075 INFO L93 Difference]: Finished difference Result 308 states and 339 transitions. [2024-11-09 07:48:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:48:36,075 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2024-11-09 07:48:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:36,076 INFO L225 Difference]: With dead ends: 308 [2024-11-09 07:48:36,077 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 07:48:36,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 07:48:36,078 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 307 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:36,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 242 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 07:48:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2024-11-09 07:48:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 269 states have (on average 1.137546468401487) internal successors, (306), 279 states have internal predecessors, (306), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 326 transitions. [2024-11-09 07:48:36,085 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 326 transitions. Word has length 53 [2024-11-09 07:48:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:36,085 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 326 transitions. [2024-11-09 07:48:36,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 326 transitions. [2024-11-09 07:48:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:48:36,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:36,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:36,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:36,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-09 07:48:36,287 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:36,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1373445455, now seen corresponding path program 1 times [2024-11-09 07:48:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808426171] [2024-11-09 07:48:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:36,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808426171] [2024-11-09 07:48:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808426171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201956960] [2024-11-09 07:48:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:36,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:36,667 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:36,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 07:48:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:36,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:48:36,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:36,851 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:48:37,063 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2024-11-09 07:48:37,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2024-11-09 07:48:37,153 INFO L349 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2024-11-09 07:48:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2024-11-09 07:48:37,175 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-09 07:48:37,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 1 [2024-11-09 07:48:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:37,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201956960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:37,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-09 07:48:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499422552] [2024-11-09 07:48:37,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:37,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:48:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:48:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:48:37,293 INFO L87 Difference]: Start difference. First operand 294 states and 326 transitions. Second operand has 21 states, 19 states have (on average 4.473684210526316) internal successors, (85), 16 states have internal predecessors, (85), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:48:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:37,969 INFO L93 Difference]: Finished difference Result 304 states and 335 transitions. [2024-11-09 07:48:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:48:37,970 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.473684210526316) internal successors, (85), 16 states have internal predecessors, (85), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-09 07:48:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:37,971 INFO L225 Difference]: With dead ends: 304 [2024-11-09 07:48:37,971 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 07:48:37,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:48:37,972 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 299 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:37,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 227 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 07:48:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 293. [2024-11-09 07:48:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 269 states have (on average 1.1301115241635689) internal successors, (304), 278 states have internal predecessors, (304), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 324 transitions. [2024-11-09 07:48:37,977 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 324 transitions. Word has length 54 [2024-11-09 07:48:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:37,977 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 324 transitions. [2024-11-09 07:48:37,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.473684210526316) internal successors, (85), 16 states have internal predecessors, (85), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:48:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 324 transitions. [2024-11-09 07:48:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 07:48:37,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:37,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:37,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:38,179 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:38,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash 980665832, now seen corresponding path program 1 times [2024-11-09 07:48:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306384146] [2024-11-09 07:48:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306384146] [2024-11-09 07:48:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306384146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375669756] [2024-11-09 07:48:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:38,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:38,704 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:38,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 07:48:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:38,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:48:38,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:39,074 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:39,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:48:39,628 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2024-11-09 07:48:39,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 67 [2024-11-09 07:48:39,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:48:39,711 INFO L349 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2024-11-09 07:48:39,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 07:48:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:40,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375669756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:40,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:40,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2024-11-09 07:48:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152222562] [2024-11-09 07:48:40,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:40,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:48:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:48:40,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:48:40,381 INFO L87 Difference]: Start difference. First operand 293 states and 324 transitions. Second operand has 33 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:41,879 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2024-11-09 07:48:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:48:41,879 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2024-11-09 07:48:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:41,880 INFO L225 Difference]: With dead ends: 310 [2024-11-09 07:48:41,881 INFO L226 Difference]: Without dead ends: 310 [2024-11-09 07:48:41,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=699, Invalid=3207, Unknown=0, NotChecked=0, Total=3906 [2024-11-09 07:48:41,882 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 397 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:41,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 367 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:48:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-09 07:48:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 292. [2024-11-09 07:48:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 269 states have (on average 1.1226765799256506) internal successors, (302), 277 states have internal predecessors, (302), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 322 transitions. [2024-11-09 07:48:41,887 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 322 transitions. Word has length 60 [2024-11-09 07:48:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:41,888 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 322 transitions. [2024-11-09 07:48:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 322 transitions. [2024-11-09 07:48:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 07:48:41,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:41,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:41,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-09 07:48:42,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:42,094 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash 335869765, now seen corresponding path program 1 times [2024-11-09 07:48:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162702354] [2024-11-09 07:48:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:42,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162702354] [2024-11-09 07:48:42,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162702354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:42,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704632500] [2024-11-09 07:48:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:42,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:42,796 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:42,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 07:48:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:42,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:48:42,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:43,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:43,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:43,513 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:43,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:48:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:43,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704632500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:43,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 27 [2024-11-09 07:48:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272074997] [2024-11-09 07:48:43,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:48:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:48:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:48:43,922 INFO L87 Difference]: Start difference. First operand 292 states and 322 transitions. Second operand has 29 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 23 states have internal predecessors, (112), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:45,068 INFO L93 Difference]: Finished difference Result 319 states and 348 transitions. [2024-11-09 07:48:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:48:45,068 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 23 states have internal predecessors, (112), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 61 [2024-11-09 07:48:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:45,069 INFO L225 Difference]: With dead ends: 319 [2024-11-09 07:48:45,070 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 07:48:45,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=583, Invalid=2497, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 07:48:45,071 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 619 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:45,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 204 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:48:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 07:48:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 250. [2024-11-09 07:48:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 232 states have (on average 1.1120689655172413) internal successors, (258), 237 states have internal predecessors, (258), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 07:48:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 273 transitions. [2024-11-09 07:48:45,076 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 273 transitions. Word has length 61 [2024-11-09 07:48:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:45,076 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 273 transitions. [2024-11-09 07:48:45,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 23 states have internal predecessors, (112), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 273 transitions. [2024-11-09 07:48:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 07:48:45,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:45,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:45,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-09 07:48:45,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:45,282 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1691180133, now seen corresponding path program 1 times [2024-11-09 07:48:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:45,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748113901] [2024-11-09 07:48:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:45,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748113901] [2024-11-09 07:48:45,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748113901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699970177] [2024-11-09 07:48:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:45,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:45,560 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:48:45,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 07:48:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:45,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:48:45,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:45,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:48:45,789 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:45,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2024-11-09 07:48:45,814 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:48:45,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:48:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:45,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699970177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:45,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-09 07:48:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208690853] [2024-11-09 07:48:45,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:45,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:48:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:48:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:45,881 INFO L87 Difference]: Start difference. First operand 250 states and 273 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:48:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:46,092 INFO L93 Difference]: Finished difference Result 309 states and 338 transitions. [2024-11-09 07:48:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:48:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-11-09 07:48:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:46,096 INFO L225 Difference]: With dead ends: 309 [2024-11-09 07:48:46,096 INFO L226 Difference]: Without dead ends: 309 [2024-11-09 07:48:46,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:48:46,097 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:46,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-09 07:48:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2024-11-09 07:48:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 274 states have (on average 1.1131386861313868) internal successors, (305), 281 states have internal predecessors, (305), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 325 transitions. [2024-11-09 07:48:46,103 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 325 transitions. Word has length 66 [2024-11-09 07:48:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:46,103 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 325 transitions. [2024-11-09 07:48:46,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:48:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 325 transitions. [2024-11-09 07:48:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 07:48:46,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:46,104 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:46,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:46,305 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:46,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1915923850, now seen corresponding path program 1 times [2024-11-09 07:48:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863118448] [2024-11-09 07:48:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:48:46,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:48:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:48:46,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:48:46,390 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:48:46,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2024-11-09 07:48:46,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-09 07:48:46,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-09 07:48:46,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-09 07:48:46,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-09 07:48:46,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-09 07:48:46,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-09 07:48:46,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-09 07:48:46,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-09 07:48:46,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-09 07:48:46,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-09 07:48:46,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2024-11-09 07:48:46,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2024-11-09 07:48:46,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (9 of 23 remaining) [2024-11-09 07:48:46,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (8 of 23 remaining) [2024-11-09 07:48:46,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (7 of 23 remaining) [2024-11-09 07:48:46,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2024-11-09 07:48:46,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2024-11-09 07:48:46,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-09 07:48:46,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-09 07:48:46,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr19ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-09 07:48:46,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr20ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2024-11-09 07:48:46,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE (0 of 23 remaining) [2024-11-09 07:48:46,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 07:48:46,402 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:46,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:48:46,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:48:46 BoogieIcfgContainer [2024-11-09 07:48:46,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:48:46,484 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:48:46,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:48:46,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:48:46,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:06" (3/4) ... [2024-11-09 07:48:46,488 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:48:46,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:48:46,490 INFO L158 Benchmark]: Toolchain (without parser) took 41489.79ms. Allocated memory was 144.7MB in the beginning and 362.8MB in the end (delta: 218.1MB). Free memory was 88.3MB in the beginning and 138.7MB in the end (delta: -50.5MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,490 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 104.4MB in the beginning and 104.2MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:48:46,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.85ms. Allocated memory is still 144.7MB. Free memory was 87.9MB in the beginning and 64.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.74ms. Allocated memory is still 144.7MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,491 INFO L158 Benchmark]: Boogie Preprocessor took 123.63ms. Allocated memory is still 144.7MB. Free memory was 62.7MB in the beginning and 114.6MB in the end (delta: -51.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,491 INFO L158 Benchmark]: RCFGBuilder took 494.30ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 114.5MB in the beginning and 164.7MB in the end (delta: -50.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,491 INFO L158 Benchmark]: TraceAbstraction took 40215.18ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 163.7MB in the beginning and 139.8MB in the end (delta: 23.9MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,492 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 362.8MB. Free memory was 139.8MB in the beginning and 138.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:48:46,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 104.4MB in the beginning and 104.2MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.85ms. Allocated memory is still 144.7MB. Free memory was 87.9MB in the beginning and 64.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.74ms. Allocated memory is still 144.7MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.63ms. Allocated memory is still 144.7MB. Free memory was 62.7MB in the beginning and 114.6MB in the end (delta: -51.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * RCFGBuilder took 494.30ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 114.5MB in the beginning and 164.7MB in the end (delta: -50.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40215.18ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 163.7MB in the beginning and 139.8MB in the end (delta: 23.9MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 362.8MB. Free memory was 139.8MB in the beginning and 138.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 722]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 722. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, input={4:0}, state=1] [L724] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L725] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, input={5:0}, state=1] [L725] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L726] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7690 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7690 mSDsluCounter, 7175 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 5612 mSDsCounter, 842 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9397 IncrementalHoareTripleChecker+Invalid, 10456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 842 mSolverCounterUnsat, 1563 mSDtfsCounter, 9397 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1929 GetRequests, 1256 SyntacticMatches, 9 SemanticMatches, 664 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=555occurred in iteration=23, InterpolantAutomatonStates: 388, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 1127 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 2103 NumberOfCodeBlocks, 2103 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2309 ConstructedInterpolants, 154 QuantifiedInterpolants, 27137 SizeOfPredicates, 92 NumberOfNonLiveVariables, 6036 ConjunctsInSsa, 450 ConjunctsInUnsatCore, 69 InterpolantComputations, 14 PerfectInterpolantSequences, 431/1071 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:48:46,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:48:48,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:48:48,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:48:48,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:48:48,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:48:48,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:48:48,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:48:48,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:48:48,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:48:48,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:48:48,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:48:48,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:48:48,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:48:48,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:48:48,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:48:48,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:48:48,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:48:48,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:48:48,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:48:48,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:48:48,825 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:48:48,829 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:48:48,829 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:48:48,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:48:48,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:48:48,829 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:48:48,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:48:48,830 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:48:48,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:48:48,830 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:48:48,830 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:48:48,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:48:48,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:48:48,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:48:48,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:48:48,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:48,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:48:48,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:48:48,834 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:48:48,834 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:48:48,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:48:48,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:48:48,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:48:48,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:48:48,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2024-11-09 07:48:49,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:48:49,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:48:49,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:48:49,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:48:49,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:48:49,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-09 07:48:50,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:48:51,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:48:51,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-09 07:48:51,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d383cdb17/3b37c78f818847b1a90440625632a86e/FLAG19c27fd41 [2024-11-09 07:48:51,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d383cdb17/3b37c78f818847b1a90440625632a86e [2024-11-09 07:48:51,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:48:51,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:48:51,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:51,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:48:51,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:48:51,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d980a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51, skipping insertion in model container [2024-11-09 07:48:51,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:51,561 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:51,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:48:51,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:51,678 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:48:51,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51 WrapperNode [2024-11-09 07:48:51,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:51,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:51,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:48:51,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:48:51,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,747 INFO L138 Inliner]: procedures = 169, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2024-11-09 07:48:51,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:51,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:48:51,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:48:51,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:48:51,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,797 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-11-09 07:48:51,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:48:51,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:48:51,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:48:51,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:48:51,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:51,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:48:51,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:48:51,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:48:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:48:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:48:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-09 07:48:51,930 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-09 07:48:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:48:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:48:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:48:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:48:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:48:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:48:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:48:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:48:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:48:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:48:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:48:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:48:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:48:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:48:52,084 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:48:52,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:48:52,453 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 07:48:52,453 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:48:52,466 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:48:52,467 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:48:52,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:52 BoogieIcfgContainer [2024-11-09 07:48:52,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:48:52,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:48:52,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:48:52,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:48:52,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:48:51" (1/3) ... [2024-11-09 07:48:52,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1ad336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:52, skipping insertion in model container [2024-11-09 07:48:52,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (2/3) ... [2024-11-09 07:48:52,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1ad336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:52, skipping insertion in model container [2024-11-09 07:48:52,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:52" (3/3) ... [2024-11-09 07:48:52,478 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2024-11-09 07:48:52,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:48:52,496 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-09 07:48:52,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:48:52,555 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60ae52d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:48:52,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-09 07:48:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:48:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:52,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:52,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:52,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:52,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -565372166, now seen corresponding path program 1 times [2024-11-09 07:48:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964033876] [2024-11-09 07:48:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:52,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:52,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:52,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:52,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:48:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:52,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:48:52,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:52,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:52,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964033876] [2024-11-09 07:48:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964033876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:52,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:52,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059282769] [2024-11-09 07:48:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:52,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:52,862 INFO L87 Difference]: Start difference. First operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:53,053 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2024-11-09 07:48:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:48:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:53,067 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:48:53,068 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:48:53,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:53,072 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:53,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 111 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:48:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2024-11-09 07:48:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.7) internal successors, (102), 82 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 07:48:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2024-11-09 07:48:53,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 6 [2024-11-09 07:48:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:53,111 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2024-11-09 07:48:53,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2024-11-09 07:48:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:53,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:53,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:53,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 07:48:53,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:53,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -565372165, now seen corresponding path program 1 times [2024-11-09 07:48:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071439549] [2024-11-09 07:48:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:53,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:53,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:53,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:48:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:53,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:48:53,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:53,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:53,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071439549] [2024-11-09 07:48:53,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071439549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:53,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:53,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:48:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780839376] [2024-11-09 07:48:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:53,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:53,540 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:53,740 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2024-11-09 07:48:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:48:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:53,743 INFO L225 Difference]: With dead ends: 191 [2024-11-09 07:48:53,743 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 07:48:53,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:53,744 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 76 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:53,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 174 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 07:48:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2024-11-09 07:48:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 146 states have internal predecessors, (216), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2024-11-09 07:48:53,775 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 6 [2024-11-09 07:48:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:53,778 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2024-11-09 07:48:53,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2024-11-09 07:48:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:48:53,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:53,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:53,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:53,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:53,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash -346667981, now seen corresponding path program 1 times [2024-11-09 07:48:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:53,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422709143] [2024-11-09 07:48:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:53,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:53,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:48:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:54,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:48:54,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:54,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:54,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422709143] [2024-11-09 07:48:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422709143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583219503] [2024-11-09 07:48:54,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:54,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:54,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:54,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:54,300 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:54,572 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2024-11-09 07:48:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:48:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:54,576 INFO L225 Difference]: With dead ends: 211 [2024-11-09 07:48:54,576 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 07:48:54,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:54,578 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 85 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:54,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 177 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 07:48:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 163. [2024-11-09 07:48:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.7244094488188977) internal successors, (219), 149 states have internal predecessors, (219), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 250 transitions. [2024-11-09 07:48:54,605 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 250 transitions. Word has length 7 [2024-11-09 07:48:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:54,606 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 250 transitions. [2024-11-09 07:48:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-09 07:48:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:48:54,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:54,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:54,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:48:54,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:54,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:54,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2138194522, now seen corresponding path program 1 times [2024-11-09 07:48:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356095693] [2024-11-09 07:48:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:54,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:54,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:48:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:54,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:48:54,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:55,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:55,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356095693] [2024-11-09 07:48:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356095693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420320917] [2024-11-09 07:48:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:55,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:55,050 INFO L87 Difference]: Start difference. First operand 163 states and 250 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:55,239 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2024-11-09 07:48:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:55,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:48:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:55,241 INFO L225 Difference]: With dead ends: 193 [2024-11-09 07:48:55,241 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:48:55,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:55,242 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 90 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:55,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 208 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:48:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2024-11-09 07:48:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 149 states have internal predecessors, (217), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-11-09 07:48:55,264 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 8 [2024-11-09 07:48:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:55,264 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-11-09 07:48:55,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-11-09 07:48:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:48:55,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:55,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:55,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:48:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:55,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1859520789, now seen corresponding path program 1 times [2024-11-09 07:48:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645759549] [2024-11-09 07:48:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:55,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:55,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:48:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:55,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:48:55,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:55,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:55,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645759549] [2024-11-09 07:48:55,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645759549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:55,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:55,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037095375] [2024-11-09 07:48:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:55,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:55,596 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:55,748 INFO L93 Difference]: Finished difference Result 258 states and 351 transitions. [2024-11-09 07:48:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:55,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:48:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:55,750 INFO L225 Difference]: With dead ends: 258 [2024-11-09 07:48:55,750 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 07:48:55,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:55,751 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:55,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 210 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 07:48:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2024-11-09 07:48:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.6603773584905661) internal successors, (264), 182 states have internal predecessors, (264), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2024-11-09 07:48:55,769 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 9 [2024-11-09 07:48:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:55,769 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2024-11-09 07:48:55,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2024-11-09 07:48:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:48:55,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:55,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:55,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:48:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:55,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1810569660, now seen corresponding path program 1 times [2024-11-09 07:48:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984978711] [2024-11-09 07:48:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:55,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:55,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:48:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:56,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:48:56,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:56,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:56,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:56,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984978711] [2024-11-09 07:48:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984978711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:56,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122294760] [2024-11-09 07:48:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:56,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:56,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:56,118 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:56,251 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2024-11-09 07:48:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:48:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:56,253 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:48:56,253 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:48:56,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:56,254 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 183 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:56,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:48:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 211. [2024-11-09 07:48:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.6569767441860466) internal successors, (285), 196 states have internal predecessors, (285), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2024-11-09 07:48:56,273 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 316 transitions. Word has length 10 [2024-11-09 07:48:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:56,274 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 316 transitions. [2024-11-09 07:48:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 316 transitions. [2024-11-09 07:48:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:48:56,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:56,275 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:56,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:56,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:56,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:56,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash -381204798, now seen corresponding path program 1 times [2024-11-09 07:48:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205157325] [2024-11-09 07:48:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:56,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:56,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:56,480 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:56,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:48:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:56,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:48:56,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:56,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:56,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205157325] [2024-11-09 07:48:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205157325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:56,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-11-09 07:48:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001385708] [2024-11-09 07:48:56,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:56,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:48:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:48:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:48:56,941 INFO L87 Difference]: Start difference. First operand 211 states and 316 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:57,276 INFO L93 Difference]: Finished difference Result 282 states and 373 transitions. [2024-11-09 07:48:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:48:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:57,279 INFO L225 Difference]: With dead ends: 282 [2024-11-09 07:48:57,279 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 07:48:57,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:48:57,283 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 224 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:57,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 246 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 07:48:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 241. [2024-11-09 07:48:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 202 states have (on average 1.6485148514851484) internal successors, (333), 226 states have internal predecessors, (333), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 364 transitions. [2024-11-09 07:48:57,297 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 364 transitions. Word has length 14 [2024-11-09 07:48:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:57,298 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 364 transitions. [2024-11-09 07:48:57,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 364 transitions. [2024-11-09 07:48:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:48:57,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:57,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:57,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 07:48:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:57,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:57,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1067553100, now seen corresponding path program 1 times [2024-11-09 07:48:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203617186] [2024-11-09 07:48:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:57,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:57,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:57,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:48:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:57,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:48:57,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:57,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:57,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203617186] [2024-11-09 07:48:57,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203617186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:57,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:57,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 07:48:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410111051] [2024-11-09 07:48:57,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:57,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:48:57,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:57,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:48:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:57,906 INFO L87 Difference]: Start difference. First operand 241 states and 364 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:58,344 INFO L93 Difference]: Finished difference Result 306 states and 436 transitions. [2024-11-09 07:48:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:48:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:48:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:58,347 INFO L225 Difference]: With dead ends: 306 [2024-11-09 07:48:58,347 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 07:48:58,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:58,348 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 179 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:58,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 299 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:48:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 07:48:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2024-11-09 07:48:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 212 states have (on average 1.6415094339622642) internal successors, (348), 236 states have internal predecessors, (348), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 07:48:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2024-11-09 07:48:58,356 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 15 [2024-11-09 07:48:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:58,357 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2024-11-09 07:48:58,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2024-11-09 07:48:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:48:58,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:58,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:58,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:58,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:58,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:48:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1265592223, now seen corresponding path program 1 times [2024-11-09 07:48:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628998915] [2024-11-09 07:48:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:58,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:58,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:58,561 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:58,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:48:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:58,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:48:58,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:58,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:59,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628998915] [2024-11-09 07:48:59,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628998915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:59,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:59,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 07:48:59,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939986707] [2024-11-09 07:48:59,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:48:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:59,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:48:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:59,047 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:59,806 INFO L93 Difference]: Finished difference Result 433 states and 580 transitions. [2024-11-09 07:48:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:48:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:48:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:59,809 INFO L225 Difference]: With dead ends: 433 [2024-11-09 07:48:59,809 INFO L226 Difference]: Without dead ends: 433 [2024-11-09 07:48:59,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:48:59,810 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 337 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:59,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 462 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:48:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-09 07:48:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 339. [2024-11-09 07:48:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 296 states have (on average 1.6689189189189189) internal successors, (494), 320 states have internal predecessors, (494), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:48:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 536 transitions. [2024-11-09 07:48:59,825 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 536 transitions. Word has length 16 [2024-11-09 07:48:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:59,825 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 536 transitions. [2024-11-09 07:48:59,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:48:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 536 transitions. [2024-11-09 07:48:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:59,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:59,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:59,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:00,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:00,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:49:00,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689731, now seen corresponding path program 1 times [2024-11-09 07:49:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996201468] [2024-11-09 07:49:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:00,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:00,034 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:00,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 07:49:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:00,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:00,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:00,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:00,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996201468] [2024-11-09 07:49:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996201468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:00,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:00,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:49:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627464050] [2024-11-09 07:49:00,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:49:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:00,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:49:00,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:00,129 INFO L87 Difference]: Start difference. First operand 339 states and 536 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:00,160 INFO L93 Difference]: Finished difference Result 482 states and 760 transitions. [2024-11-09 07:49:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:49:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:49:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:00,163 INFO L225 Difference]: With dead ends: 482 [2024-11-09 07:49:00,163 INFO L226 Difference]: Without dead ends: 482 [2024-11-09 07:49:00,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:00,164 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:00,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 115 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-09 07:49:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2024-11-09 07:49:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 414 states have (on average 1.6570048309178744) internal successors, (686), 440 states have internal predecessors, (686), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2024-11-09 07:49:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 758 transitions. [2024-11-09 07:49:00,186 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 758 transitions. Word has length 18 [2024-11-09 07:49:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:00,187 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 758 transitions. [2024-11-09 07:49:00,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 758 transitions. [2024-11-09 07:49:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:49:00,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:00,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:00,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 07:49:00,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:00,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:49:00,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689987, now seen corresponding path program 1 times [2024-11-09 07:49:00,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:00,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686395318] [2024-11-09 07:49:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:00,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:00,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:00,394 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:00,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:49:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:00,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:00,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:00,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:00,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686395318] [2024-11-09 07:49:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686395318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:00,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:49:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111010615] [2024-11-09 07:49:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:49:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:49:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:00,531 INFO L87 Difference]: Start difference. First operand 466 states and 758 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:00,574 INFO L93 Difference]: Finished difference Result 508 states and 788 transitions. [2024-11-09 07:49:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:49:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:49:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:00,581 INFO L225 Difference]: With dead ends: 508 [2024-11-09 07:49:00,581 INFO L226 Difference]: Without dead ends: 508 [2024-11-09 07:49:00,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:00,582 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:00,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 117 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-09 07:49:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 493. [2024-11-09 07:49:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 439 states have (on average 1.6378132118451025) internal successors, (719), 466 states have internal predecessors, (719), 15 states have call successors, (15), 11 states have call predecessors, (15), 16 states have return successors, (51), 15 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-09 07:49:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 785 transitions. [2024-11-09 07:49:00,598 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 785 transitions. Word has length 18 [2024-11-09 07:49:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:00,598 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 785 transitions. [2024-11-09 07:49:00,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 785 transitions. [2024-11-09 07:49:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:49:00,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:00,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:00,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:49:00,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:00,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:49:00,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1649708773, now seen corresponding path program 1 times [2024-11-09 07:49:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700389021] [2024-11-09 07:49:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:00,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:00,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:00,807 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:00,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:49:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:00,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:49:00,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:00,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:00,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:00,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700389021] [2024-11-09 07:49:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700389021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:00,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:49:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322860298] [2024-11-09 07:49:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:49:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:00,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:49:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:00,938 INFO L87 Difference]: Start difference. First operand 493 states and 785 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:00,983 INFO L93 Difference]: Finished difference Result 508 states and 785 transitions. [2024-11-09 07:49:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:49:00,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:49:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:00,986 INFO L225 Difference]: With dead ends: 508 [2024-11-09 07:49:00,986 INFO L226 Difference]: Without dead ends: 508 [2024-11-09 07:49:00,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:00,987 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:00,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 118 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-09 07:49:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 493. [2024-11-09 07:49:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 439 states have (on average 1.6287015945330297) internal successors, (715), 466 states have internal predecessors, (715), 15 states have call successors, (15), 11 states have call predecessors, (15), 16 states have return successors, (51), 15 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-09 07:49:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 781 transitions. [2024-11-09 07:49:00,999 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 781 transitions. Word has length 19 [2024-11-09 07:49:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:00,999 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 781 transitions. [2024-11-09 07:49:01,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 781 transitions. [2024-11-09 07:49:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:49:01,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:01,001 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 07:49:01,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:49:01,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:01,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:49:01,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash 437828489, now seen corresponding path program 2 times [2024-11-09 07:49:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112255336] [2024-11-09 07:49:01,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:49:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:01,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:01,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:49:01,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:49:01,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:49:01,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:49:01,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:01,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:01,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112255336] [2024-11-09 07:49:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112255336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:01,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-09 07:49:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236011652] [2024-11-09 07:49:01,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:49:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:49:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:49:01,914 INFO L87 Difference]: Start difference. First operand 493 states and 781 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:02,657 INFO L93 Difference]: Finished difference Result 595 states and 923 transitions. [2024-11-09 07:49:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:49:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:49:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:02,661 INFO L225 Difference]: With dead ends: 595 [2024-11-09 07:49:02,661 INFO L226 Difference]: Without dead ends: 595 [2024-11-09 07:49:02,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:49:02,662 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 192 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:02,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 334 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:49:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-09 07:49:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 546. [2024-11-09 07:49:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 492 states have (on average 1.6483739837398375) internal successors, (811), 519 states have internal predecessors, (811), 15 states have call successors, (15), 11 states have call predecessors, (15), 16 states have return successors, (51), 15 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-09 07:49:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 877 transitions. [2024-11-09 07:49:02,695 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 877 transitions. Word has length 22 [2024-11-09 07:49:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:02,695 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 877 transitions. [2024-11-09 07:49:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:49:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 877 transitions. [2024-11-09 07:49:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:49:02,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:02,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:02,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 07:49:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:02,901 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:49:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1948313302, now seen corresponding path program 1 times [2024-11-09 07:49:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301165646] [2024-11-09 07:49:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:02,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:02,903 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:02,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:49:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:02,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:49:02,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:02,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:02,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301165646] [2024-11-09 07:49:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301165646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:49:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073386360] [2024-11-09 07:49:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:49:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:49:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:02,967 INFO L87 Difference]: Start difference. First operand 546 states and 877 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:02,979 INFO L93 Difference]: Finished difference Result 396 states and 616 transitions. [2024-11-09 07:49:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:49:02,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 07:49:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:02,983 INFO L225 Difference]: With dead ends: 396 [2024-11-09 07:49:02,984 INFO L226 Difference]: Without dead ends: 396 [2024-11-09 07:49:02,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:49:02,985 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:02,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-09 07:49:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-09 07:49:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 351 states have (on average 1.6353276353276354) internal successors, (574), 376 states have internal predecessors, (574), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:49:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2024-11-09 07:49:02,997 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 616 transitions. Word has length 25 [2024-11-09 07:49:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:02,998 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 616 transitions. [2024-11-09 07:49:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 616 transitions. [2024-11-09 07:49:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:49:03,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:03,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:03,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:49:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:03,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-09 07:49:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1793598830, now seen corresponding path program 1 times [2024-11-09 07:49:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601177685] [2024-11-09 07:49:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:03,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:03,203 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:03,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 07:49:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:03,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:49:03,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:03,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:03,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:03,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:07,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601177685] [2024-11-09 07:49:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601177685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:07,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [54654927] [2024-11-09 07:49:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:07,933 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:07,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:07,936 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:49:07,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 07:49:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:08,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:49:08,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:08,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:08,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:08,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [54654927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:12,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-09 07:49:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124941467] [2024-11-09 07:49:12,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:12,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:49:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:49:12,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2024-11-09 07:49:12,613 INFO L87 Difference]: Start difference. First operand 396 states and 616 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)