./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0236.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/test-0236.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 9284cc089e563ce2bdd0201592786c36b8d718b3efb8766c887a82d2ff3babc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:37:57,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:37:57,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:37:57,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:37:57,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:37:57,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:37:57,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:37:57,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:37:57,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:37:57,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:37:57,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:37:57,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:37:57,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:37:57,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:37:57,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:37:57,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:37:57,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:37:57,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:37:57,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:37:57,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:37:57,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:37:57,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:57,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:37:57,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:37:57,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:37:57,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:37:57,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9284cc089e563ce2bdd0201592786c36b8d718b3efb8766c887a82d2ff3babc3 [2025-03-04 07:37:57,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:37:57,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:37:57,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:37:57,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:37:57,722 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:37:57,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0236.i [2025-03-04 07:37:58,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1904fe94/dcc284ec72b94b469a673dd39546f20e/FLAGd1803d289 [2025-03-04 07:37:59,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:37:59,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0236.i [2025-03-04 07:37:59,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1904fe94/dcc284ec72b94b469a673dd39546f20e/FLAGd1803d289 [2025-03-04 07:37:59,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1904fe94/dcc284ec72b94b469a673dd39546f20e [2025-03-04 07:37:59,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:37:59,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:37:59,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:37:59,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:37:59,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:37:59,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59, skipping insertion in model container [2025-03-04 07:37:59,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:37:59,441 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:37:59,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:37:59,467 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:37:59,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:37:59,536 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:37:59,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59 WrapperNode [2025-03-04 07:37:59,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:37:59,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:37:59,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:37:59,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:37:59,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,573 INFO L138 Inliner]: procedures = 188, calls = 67, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 211 [2025-03-04 07:37:59,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:37:59,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:37:59,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:37:59,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:37:59,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,608 INFO L175 MemorySlicer]: Split 39 memory accesses to 2 slices as follows [2, 37]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 19 writes are split as follows [0, 19]. [2025-03-04 07:37:59,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:37:59,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:37:59,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:37:59,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:37:59,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (1/1) ... [2025-03-04 07:37:59,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:59,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:59,651 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) [2025-03-04 07:37:59,653 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 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-03-04 07:37:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:37:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:37:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:37:59,761 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:37:59,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:37:59,853 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-03-04 07:38:00,191 INFO L? ?]: Removed 220 outVars from TransFormulas that were not future-live. [2025-03-04 07:38:00,191 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:38:00,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:38:00,205 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:38:00,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:38:00 BoogieIcfgContainer [2025-03-04 07:38:00,206 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:38:00,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:38:00,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:38:00,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:38:00,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:37:59" (1/3) ... [2025-03-04 07:38:00,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0411ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:38:00, skipping insertion in model container [2025-03-04 07:38:00,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:59" (2/3) ... [2025-03-04 07:38:00,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0411ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:38:00, skipping insertion in model container [2025-03-04 07:38:00,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:38:00" (3/3) ... [2025-03-04 07:38:00,213 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0236.i [2025-03-04 07:38:00,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:38:00,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0236.i that has 2 procedures, 208 locations, 1 initial locations, 11 loop locations, and 89 error locations. [2025-03-04 07:38:00,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:38:00,271 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;@5b64791b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:38:00,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-03-04 07:38:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 111 states have (on average 2.0) internal successors, (222), 200 states have internal predecessors, (222), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:38:00,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:00,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:38:00,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:00,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash 8002703, now seen corresponding path program 1 times [2025-03-04 07:38:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171715896] [2025-03-04 07:38:00,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:00,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:38:00,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:38:00,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:00,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171715896] [2025-03-04 07:38:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171715896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138703699] [2025-03-04 07:38:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:38:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:00,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:38:00,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:38:00,399 INFO L87 Difference]: Start difference. First operand has 208 states, 111 states have (on average 2.0) internal successors, (222), 200 states have internal predecessors, (222), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:00,420 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2025-03-04 07:38:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:38:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:38:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:00,425 INFO L225 Difference]: With dead ends: 208 [2025-03-04 07:38:00,426 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 07:38:00,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:38:00,428 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:00,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:38:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 07:38:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 07:38:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 110 states have (on average 1.9) internal successors, (209), 198 states have internal predecessors, (209), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2025-03-04 07:38:00,462 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 4 [2025-03-04 07:38:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:00,462 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2025-03-04 07:38:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2025-03-04 07:38:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:38:00,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:00,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:38:00,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:38:00,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:00,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash -899244306, now seen corresponding path program 1 times [2025-03-04 07:38:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893535972] [2025-03-04 07:38:00,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:00,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:38:00,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:38:00,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:00,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893535972] [2025-03-04 07:38:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893535972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290406419] [2025-03-04 07:38:00,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:00,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:00,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:00,607 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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) [2025-03-04 07:38:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:00,722 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2025-03-04 07:38:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:00,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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 [2025-03-04 07:38:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:00,724 INFO L225 Difference]: With dead ends: 205 [2025-03-04 07:38:00,724 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 07:38:00,724 INFO L434 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 [2025-03-04 07:38:00,725 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:00,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 345 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 07:38:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-04 07:38:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 110 states have (on average 1.8909090909090909) internal successors, (208), 197 states have internal predecessors, (208), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2025-03-04 07:38:00,735 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 6 [2025-03-04 07:38:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:00,735 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2025-03-04 07:38:00,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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) [2025-03-04 07:38:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2025-03-04 07:38:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:38:00,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:00,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:00,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:38:00,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2106769730, now seen corresponding path program 1 times [2025-03-04 07:38:00,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:00,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421282792] [2025-03-04 07:38:00,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:00,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:00,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:38:00,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:38:00,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:00,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:00,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377133662] [2025-03-04 07:38:00,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:00,771 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) [2025-03-04 07:38:00,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:38:00,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:38:00,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:38:00,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:00,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:00,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:38:00,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:00,892 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 [2025-03-04 07:38:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:00,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:38:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421282792] [2025-03-04 07:38:00,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377133662] [2025-03-04 07:38:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377133662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:38:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508231118] [2025-03-04 07:38:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:38:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:38:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:38:00,916 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2025-03-04 07:38:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:01,051 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2025-03-04 07:38:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:38:01,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2025-03-04 07:38:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:01,053 INFO L225 Difference]: With dead ends: 214 [2025-03-04 07:38:01,053 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 07:38:01,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:01,054 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 11 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:01,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 557 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 07:38:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 07:38:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 118 states have (on average 1.8389830508474576) internal successors, (217), 205 states have internal predecessors, (217), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2025-03-04 07:38:01,066 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 7 [2025-03-04 07:38:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:01,066 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2025-03-04 07:38:01,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2025-03-04 07:38:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2025-03-04 07:38:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:38:01,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:01,067 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:01,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:38:01,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:01,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:01,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1196821630, now seen corresponding path program 1 times [2025-03-04 07:38:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734252406] [2025-03-04 07:38:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:01,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:38:01,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:38:01,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:01,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539449806] [2025-03-04 07:38:01,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:01,355 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) [2025-03-04 07:38:01,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:38:01,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:38:01,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:38:01,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:01,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 07:38:01,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:01,569 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 8 treesize of output 7 [2025-03-04 07:38:01,601 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 13 treesize of output 9 [2025-03-04 07:38:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 07:38:01,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 07:38:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:01,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734252406] [2025-03-04 07:38:01,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539449806] [2025-03-04 07:38:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539449806] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:38:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-04 07:38:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343292466] [2025-03-04 07:38:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:38:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:01,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:38:01,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:38:01,819 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:38:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:01,935 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2025-03-04 07:38:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:38:01,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 66 [2025-03-04 07:38:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:01,936 INFO L225 Difference]: With dead ends: 220 [2025-03-04 07:38:01,936 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 07:38:01,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:38:01,937 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:01,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 562 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:01,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 07:38:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 07:38:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 119 states have (on average 1.8319327731092436) internal successors, (218), 206 states have internal predecessors, (218), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 230 transitions. [2025-03-04 07:38:01,949 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 230 transitions. Word has length 66 [2025-03-04 07:38:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:01,950 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 230 transitions. [2025-03-04 07:38:01,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:38:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 230 transitions. [2025-03-04 07:38:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 07:38:01,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:01,951 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:01,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:02,154 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,SelfDestructingSolverStorable3 [2025-03-04 07:38:02,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:02,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -285962700, now seen corresponding path program 1 times [2025-03-04 07:38:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-03-04 07:38:02,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:02,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:38:02,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:38:02,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453292730] [2025-03-04 07:38:02,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:02,322 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) [2025-03-04 07:38:02,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:38:02,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:38:02,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:38:02,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:38:02,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:02,553 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 8 treesize of output 1 [2025-03-04 07:38:02,579 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 13 treesize of output 9 [2025-03-04 07:38:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 14 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 07:38:02,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 07:38:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:02,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-03-04 07:38:02,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:02,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453292730] [2025-03-04 07:38:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453292730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:02,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:02,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-04 07:38:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597485217] [2025-03-04 07:38:02,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:38:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:38:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:38:02,807 INFO L87 Difference]: Start difference. First operand 215 states and 230 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:38:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,142 INFO L93 Difference]: Finished difference Result 235 states and 252 transitions. [2025-03-04 07:38:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:38:03,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2025-03-04 07:38:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,143 INFO L225 Difference]: With dead ends: 235 [2025-03-04 07:38:03,143 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 07:38:03,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:38:03,144 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 16 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1120 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 07:38:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-04 07:38:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 124 states have (on average 1.8064516129032258) internal successors, (224), 211 states have internal predecessors, (224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 236 transitions. [2025-03-04 07:38:03,149 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 236 transitions. Word has length 71 [2025-03-04 07:38:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,149 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 236 transitions. [2025-03-04 07:38:03,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:38:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 236 transitions. [2025-03-04 07:38:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 07:38:03,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,151 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:03,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:03,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:03,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash 222756862, now seen corresponding path program 2 times [2025-03-04 07:38:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909490038] [2025-03-04 07:38:03,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:38:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 07:38:03,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 07:38:03,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:38:03,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962126338] [2025-03-04 07:38:03,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:38:03,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:03,495 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) [2025-03-04 07:38:03,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:38:03,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 07:38:03,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 07:38:03,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:38:03,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:38:03,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:03,888 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 8 treesize of output 7 [2025-03-04 07:38:03,917 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 13 treesize of output 9 [2025-03-04 07:38:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 127 proven. 96 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 07:38:04,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 07:38:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909490038] [2025-03-04 07:38:04,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962126338] [2025-03-04 07:38:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962126338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:04,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-04 07:38:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219362459] [2025-03-04 07:38:04,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:38:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:38:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:38:04,280 INFO L87 Difference]: Start difference. First operand 220 states and 236 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:38:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:05,049 INFO L93 Difference]: Finished difference Result 244 states and 266 transitions. [2025-03-04 07:38:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:38:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2025-03-04 07:38:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:05,050 INFO L225 Difference]: With dead ends: 244 [2025-03-04 07:38:05,050 INFO L226 Difference]: Without dead ends: 229 [2025-03-04 07:38:05,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:38:05,051 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 33 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:05,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2795 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:38:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-04 07:38:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-03-04 07:38:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 133 states have (on average 1.744360902255639) internal successors, (232), 220 states have internal predecessors, (232), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2025-03-04 07:38:05,056 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 86 [2025-03-04 07:38:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:05,056 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2025-03-04 07:38:05,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:38:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2025-03-04 07:38:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 07:38:05,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:05,058 INFO L218 NwaCegarLoop]: trace histogram [50, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:05,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:05,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:05,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -697375426, now seen corresponding path program 3 times [2025-03-04 07:38:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:05,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086128798] [2025-03-04 07:38:05,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:38:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:05,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 21 equivalence classes. [2025-03-04 07:38:05,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 07:38:05,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-03-04 07:38:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:05,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339110569] [2025-03-04 07:38:05,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:38:05,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:05,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:05,963 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) [2025-03-04 07:38:05,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:38:06,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 21 equivalence classes. [2025-03-04 07:38:06,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 116 statements. [2025-03-04 07:38:06,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:38:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:06,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:38:06,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:06,144 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 [2025-03-04 07:38:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2025-03-04 07:38:06,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:38:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086128798] [2025-03-04 07:38:06,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339110569] [2025-03-04 07:38:06,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339110569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:06,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:06,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:38:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99523484] [2025-03-04 07:38:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:06,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:38:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:06,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:38:06,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:38:06,157 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:38:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:06,254 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2025-03-04 07:38:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:38:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 116 [2025-03-04 07:38:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:06,256 INFO L225 Difference]: With dead ends: 228 [2025-03-04 07:38:06,256 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 07:38:06,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:06,257 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 11 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:06,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 579 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 07:38:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-04 07:38:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.736842105263158) internal successors, (231), 219 states have internal predecessors, (231), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2025-03-04 07:38:06,261 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 116 [2025-03-04 07:38:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:06,261 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2025-03-04 07:38:06,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:38:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2025-03-04 07:38:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 07:38:06,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:06,263 INFO L218 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 07:38:06,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:06,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:06,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:06,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -68795378, now seen corresponding path program 1 times [2025-03-04 07:38:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350359953] [2025-03-04 07:38:06,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:06,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:06,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 07:38:06,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 07:38:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 878 proven. 4 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2025-03-04 07:38:07,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:07,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350359953] [2025-03-04 07:38:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350359953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673928419] [2025-03-04 07:38:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:07,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:07,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:07,454 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) [2025-03-04 07:38:07,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:38:07,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 07:38:07,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 07:38:07,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:07,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:07,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:38:07,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:07,832 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-04 07:38:07,878 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:38:07,878 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 [2025-03-04 07:38:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 1 refuted. 0 times theorem prover too weak. 1068 trivial. 72 not checked. [2025-03-04 07:38:07,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:08,057 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:38:08,057 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 12 treesize of output 11 [2025-03-04 07:38:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 73 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2025-03-04 07:38:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673928419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:08,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:08,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 17 [2025-03-04 07:38:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760483115] [2025-03-04 07:38:08,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:08,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:38:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:08,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:38:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2025-03-04 07:38:08,079 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 07:38:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:08,577 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2025-03-04 07:38:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:38:08,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 128 [2025-03-04 07:38:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:08,579 INFO L225 Difference]: With dead ends: 224 [2025-03-04 07:38:08,579 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 07:38:08,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:38:08,580 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:08,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1521 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 998 Invalid, 0 Unknown, 207 Unchecked, 0.4s Time] [2025-03-04 07:38:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 07:38:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-03-04 07:38:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 215 states have internal predecessors, (227), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2025-03-04 07:38:08,584 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 128 [2025-03-04 07:38:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:08,584 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2025-03-04 07:38:08,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 07:38:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2025-03-04 07:38:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 07:38:08,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:08,585 INFO L218 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 07:38:08,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:08,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:08,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:08,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash -68795377, now seen corresponding path program 1 times [2025-03-04 07:38:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687138046] [2025-03-04 07:38:08,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:08,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:08,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 07:38:08,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 07:38:08,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:08,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736162683] [2025-03-04 07:38:09,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:09,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:09,006 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) [2025-03-04 07:38:09,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:38:09,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 07:38:11,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 07:38:11,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:11,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:11,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 07:38:11,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:11,798 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 8 treesize of output 7 [2025-03-04 07:38:12,079 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-04 07:38:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:12,136 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 [2025-03-04 07:38:12,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:38:12,141 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 [2025-03-04 07:38:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 1068 trivial. 73 not checked. [2025-03-04 07:38:12,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687138046] [2025-03-04 07:38:12,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736162683] [2025-03-04 07:38:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736162683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:12,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:38:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 07:38:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622609330] [2025-03-04 07:38:12,241 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:12,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:38:12,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:12,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:38:12,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=153, Unknown=1, NotChecked=24, Total=210 [2025-03-04 07:38:12,241 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:38:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:12,970 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2025-03-04 07:38:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:38:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 128 [2025-03-04 07:38:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:12,974 INFO L225 Difference]: With dead ends: 220 [2025-03-04 07:38:12,974 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 07:38:12,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:38:12,975 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 16 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:12,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1077 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1189 Invalid, 0 Unknown, 202 Unchecked, 0.6s Time] [2025-03-04 07:38:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 07:38:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-04 07:38:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 133 states have (on average 1.6766917293233083) internal successors, (223), 211 states have internal predecessors, (223), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2025-03-04 07:38:12,980 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 128 [2025-03-04 07:38:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:12,980 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2025-03-04 07:38:12,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:38:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2025-03-04 07:38:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 07:38:12,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:12,981 INFO L218 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 07:38:13,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:38:13,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:13,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -783533123, now seen corresponding path program 1 times [2025-03-04 07:38:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663031318] [2025-03-04 07:38:13,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:13,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 07:38:13,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 07:38:13,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:13,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2025-03-04 07:38:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663031318] [2025-03-04 07:38:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663031318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:13,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:13,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:38:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648841816] [2025-03-04 07:38:13,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:13,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:38:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:13,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:38:13,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:38:13,816 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:38:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:14,087 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2025-03-04 07:38:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:38:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 131 [2025-03-04 07:38:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:14,089 INFO L225 Difference]: With dead ends: 219 [2025-03-04 07:38:14,089 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 07:38:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:38:14,089 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 9 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:14,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1079 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:38:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 07:38:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-04 07:38:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 133 states have (on average 1.669172932330827) internal successors, (222), 210 states have internal predecessors, (222), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:38:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2025-03-04 07:38:14,096 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 131 [2025-03-04 07:38:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:14,097 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2025-03-04 07:38:14,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:38:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2025-03-04 07:38:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 07:38:14,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:14,099 INFO L218 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 07:38:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:38:14,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:38:14,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash -783533122, now seen corresponding path program 1 times [2025-03-04 07:38:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:14,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547315209] [2025-03-04 07:38:14,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:14,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 07:38:14,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 07:38:14,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 128 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2025-03-04 07:38:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:16,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547315209] [2025-03-04 07:38:16,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547315209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:16,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646682316] [2025-03-04 07:38:16,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:16,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:16,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:16,572 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) [2025-03-04 07:38:16,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:38:16,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 07:38:21,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 07:38:21,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:21,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:21,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 07:38:21,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:21,417 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 10 treesize of output 9 [2025-03-04 07:38:27,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2025-03-04 07:38:27,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2025-03-04 07:38:28,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2025-03-04 07:38:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 386 proven. 648 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-04 07:38:28,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 365 proven. 15 refuted. 0 times theorem prover too weak. 1570 trivial. 0 not checked. [2025-03-04 07:38:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646682316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:29,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:29,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 15] total 58 [2025-03-04 07:38:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041135926] [2025-03-04 07:38:29,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:29,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 07:38:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:29,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 07:38:29,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3106, Unknown=1, NotChecked=0, Total=3306 [2025-03-04 07:38:29,702 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand has 58 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 53 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 07:38:34,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:40,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:45,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:49,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:54,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:58,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:39:04,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:39:08,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:39:13,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:39:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:18,994 INFO L93 Difference]: Finished difference Result 248 states and 275 transitions. [2025-03-04 07:39:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:39:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 53 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 131 [2025-03-04 07:39:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:19,000 INFO L225 Difference]: With dead ends: 248 [2025-03-04 07:39:19,000 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 07:39:19,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=539, Invalid=6942, Unknown=1, NotChecked=0, Total=7482 [2025-03-04 07:39:19,002 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 27 mSDsluCounter, 4698 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 3621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:19,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4895 Invalid, 3621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3605 Invalid, 9 Unknown, 0 Unchecked, 40.4s Time] [2025-03-04 07:39:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 07:39:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 224. [2025-03-04 07:39:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.644927536231884) internal successors, (227), 215 states have internal predecessors, (227), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:39:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 243 transitions. [2025-03-04 07:39:19,010 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 243 transitions. Word has length 131 [2025-03-04 07:39:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:19,010 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 243 transitions. [2025-03-04 07:39:19,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 53 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 07:39:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 243 transitions. [2025-03-04 07:39:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 07:39:19,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:19,011 INFO L218 NwaCegarLoop]: trace histogram [56, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 07:39:19,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:39:19,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 07:39:19,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:39:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2066822625, now seen corresponding path program 1 times [2025-03-04 07:39:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442002747] [2025-03-04 07:39:19,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:19,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 07:39:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 07:39:19,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1172 proven. 147 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2025-03-04 07:39:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442002747] [2025-03-04 07:39:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442002747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643624987] [2025-03-04 07:39:20,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:20,343 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) [2025-03-04 07:39:20,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:39:20,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 07:39:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 07:39:20,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:20,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:20,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:39:20,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:20,876 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from false [2025-03-04 07:39:20,879 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from true [2025-03-04 07:39:20,893 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-03-04 07:39:20,896 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-03-04 07:39:20,932 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-04 07:39:20,971 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:39:20,971 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 [2025-03-04 07:39:20,986 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0))))))) is different from false [2025-03-04 07:39:20,989 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0))))))) is different from true [2025-03-04 07:39:21,015 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))))) is different from false [2025-03-04 07:39:21,017 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))))) is different from true [2025-03-04 07:39:21,076 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) is different from false [2025-03-04 07:39:21,077 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) is different from true [2025-03-04 07:39:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1028 proven. 141 refuted. 0 times theorem prover too weak. 692 trivial. 150 not checked. [2025-03-04 07:39:21,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:21,779 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:39:21,779 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 12 treesize of output 11 [2025-03-04 07:39:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1028 proven. 291 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2025-03-04 07:39:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643624987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:39:21,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:39:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 19] total 33 [2025-03-04 07:39:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536651879] [2025-03-04 07:39:21,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:21,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:39:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:21,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:39:21,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=658, Unknown=11, NotChecked=342, Total=1122 [2025-03-04 07:39:21,797 INFO L87 Difference]: Start difference. First operand 224 states and 243 transitions. Second operand has 34 states, 32 states have (on average 2.90625) internal successors, (93), 27 states have internal predecessors, (93), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 07:39:22,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2025-03-04 07:39:22,069 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2025-03-04 07:39:22,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2025-03-04 07:39:22,073 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2025-03-04 07:39:22,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2025-03-04 07:39:22,078 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2025-03-04 07:39:22,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) .cse0)) is different from false [2025-03-04 07:39:22,082 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) .cse0)) is different from true [2025-03-04 07:39:22,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) .cse0)) is different from false [2025-03-04 07:39:22,086 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) .cse0)) is different from true [2025-03-04 07:39:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:22,996 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2025-03-04 07:39:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:39:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.90625) internal successors, (93), 27 states have internal predecessors, (93), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 135 [2025-03-04 07:39:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:23,000 INFO L225 Difference]: With dead ends: 237 [2025-03-04 07:39:23,000 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 07:39:23,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 253 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=900, Unknown=21, NotChecked=792, Total=1892 [2025-03-04 07:39:23,001 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 18 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1625 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:23,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2593 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1916 Invalid, 0 Unknown, 1625 Unchecked, 1.1s Time] [2025-03-04 07:39:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 07:39:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-04 07:39:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 150 states have (on average 1.6) internal successors, (240), 226 states have internal predecessors, (240), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 07:39:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2025-03-04 07:39:23,010 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 135 [2025-03-04 07:39:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:23,010 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2025-03-04 07:39:23,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.90625) internal successors, (93), 27 states have internal predecessors, (93), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 07:39:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2025-03-04 07:39:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 07:39:23,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:23,011 INFO L218 NwaCegarLoop]: trace histogram [56, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-04 07:39:23,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:39:23,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:23,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 86 more)] === [2025-03-04 07:39:23,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2066822626, now seen corresponding path program 1 times [2025-03-04 07:39:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-04 07:39:23,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:23,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 07:39:23,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 07:39:23,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:23,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 853 proven. 145 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2025-03-04 07:39:25,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-04 07:39:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365310156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814329848] [2025-03-04 07:39:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:25,297 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) [2025-03-04 07:39:25,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:39:25,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 07:39:27,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 07:39:27,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:27,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:27,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-03-04 07:39:27,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:28,133 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 10 treesize of output 9