./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.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 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:38:11,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:38:11,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:38:11,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:38:11,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:38:11,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:38:11,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:38:11,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:38:11,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:38:11,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:38:11,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:38:11,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:38:11,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:38:11,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:38:11,444 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:38:11,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:38:11,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:38:11,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:11,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:11,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:11,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:38:11,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:38:11,447 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 -> 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 [2025-04-30 10:38:11,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:38:11,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:38:11,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:38:11,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:38:11,755 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:38:11,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.i [2025-04-30 10:38:13,060 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b1d2937/fbeff9958020433eb2112923c514840d/FLAG77128d7ff [2025-04-30 10:38:13,278 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:38:13,278 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.i [2025-04-30 10:38:13,286 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b1d2937/fbeff9958020433eb2112923c514840d/FLAG77128d7ff [2025-04-30 10:38:14,062 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b1d2937/fbeff9958020433eb2112923c514840d [2025-04-30 10:38:14,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:38:14,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:38:14,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:14,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:38:14,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:38:14,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571c0a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14, skipping insertion in model container [2025-04-30 10:38:14,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:38:14,318 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:14,326 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:38:14,374 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:14,394 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:38:14,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14 WrapperNode [2025-04-30 10:38:14,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:14,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:14,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:38:14,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:38:14,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,435 INFO L138 Inliner]: procedures = 125, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-30 10:38:14,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:14,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:38:14,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:38:14,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:38:14,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,462 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-30 10:38:14,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:38:14,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:38:14,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:38:14,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:38:14,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (1/1) ... [2025-04-30 10:38:14,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:14,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:14,512 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-04-30 10:38:14,517 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-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:38:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:38:14,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:38:14,624 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:38:14,625 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:38:14,785 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-04-30 10:38:14,785 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:38:14,794 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:38:14,794 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:38:14,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:14 BoogieIcfgContainer [2025-04-30 10:38:14,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:38:14,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:38:14,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:38:14,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:38:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:38:14" (1/3) ... [2025-04-30 10:38:14,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1638d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:14, skipping insertion in model container [2025-04-30 10:38:14,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:14" (2/3) ... [2025-04-30 10:38:14,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1638d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:14, skipping insertion in model container [2025-04-30 10:38:14,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:14" (3/3) ... [2025-04-30 10:38:14,801 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_length_check-2.i [2025-04-30 10:38:14,810 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:38:14,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_length_check-2.i that has 1 procedures, 43 locations, 51 edges, 1 initial locations, 4 loop locations, and 11 error locations. [2025-04-30 10:38:14,835 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:38:14,843 INFO L340 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;@5881674f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:38:14,843 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:38:14,845 INFO L278 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 42 states have internal predecessors, (51), 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-04-30 10:38:14,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:38:14,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:14,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:14,849 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:14,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1820174777, now seen corresponding path program 1 times [2025-04-30 10:38:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:14,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755677146] [2025-04-30 10:38:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:14,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:38:14,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:38:14,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:14,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:14,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:14,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755677146] [2025-04-30 10:38:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755677146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:14,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:14,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122538517] [2025-04-30 10:38:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:14,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:38:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:14,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:38:14,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:38:14,985 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 42 states have internal predecessors, (51), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-30 10:38:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:14,999 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-04-30 10:38:15,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:38:15,001 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-04-30 10:38:15,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:15,005 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:38:15,006 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:38:15,007 INFO L436 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-04-30 10:38:15,011 INFO L437 NwaCegarLoop]: 47 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, 47 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-04-30 10:38:15,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:38:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-30 10:38:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 38 states have internal predecessors, (43), 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-04-30 10:38:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-04-30 10:38:15,040 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 7 [2025-04-30 10:38:15,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:15,041 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-04-30 10:38:15,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-30 10:38:15,041 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-04-30 10:38:15,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:38:15,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:15,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:15,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:38:15,042 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:15,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash 298269074, now seen corresponding path program 1 times [2025-04-30 10:38:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:15,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879938110] [2025-04-30 10:38:15,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:15,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:38:15,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:38:15,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:15,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:15,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879938110] [2025-04-30 10:38:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879938110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:15,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:15,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529187652] [2025-04-30 10:38:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:15,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:15,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:15,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:15,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:15,157 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-30 10:38:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:15,189 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-04-30 10:38:15,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:15,189 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-04-30 10:38:15,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:15,190 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:38:15,190 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:38:15,190 INFO L436 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-04-30 10:38:15,190 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:15,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:38:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:38:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.5) internal successors, (42), 37 states have internal predecessors, (42), 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-04-30 10:38:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-04-30 10:38:15,194 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2025-04-30 10:38:15,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:15,194 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-04-30 10:38:15,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-30 10:38:15,194 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-04-30 10:38:15,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:38:15,194 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:15,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:15,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:38:15,194 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:15,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 298269075, now seen corresponding path program 1 times [2025-04-30 10:38:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:15,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916595410] [2025-04-30 10:38:15,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:15,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:38:15,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:38:15,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:15,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:15,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916595410] [2025-04-30 10:38:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916595410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209801169] [2025-04-30 10:38:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:15,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:15,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:15,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:15,289 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-30 10:38:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:15,330 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-04-30 10:38:15,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:15,330 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-04-30 10:38:15,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:15,331 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:38:15,331 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:38:15,331 INFO L436 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-04-30 10:38:15,332 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:15,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:38:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:38:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 36 states have internal predecessors, (41), 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-04-30 10:38:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-04-30 10:38:15,334 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 9 [2025-04-30 10:38:15,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:15,335 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-04-30 10:38:15,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-30 10:38:15,335 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-04-30 10:38:15,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:38:15,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:15,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:15,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:38:15,336 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:15,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 656802992, now seen corresponding path program 1 times [2025-04-30 10:38:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:15,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792721815] [2025-04-30 10:38:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:15,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:38:15,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:38:15,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:15,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792721815] [2025-04-30 10:38:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792721815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:38:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689231145] [2025-04-30 10:38:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:15,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:38:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:15,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:38:15,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:38:15,383 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04-30 10:38:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:15,417 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2025-04-30 10:38:15,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:38:15,417 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-04-30 10:38:15,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:15,418 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:38:15,418 INFO L226 Difference]: Without dead ends: 58 [2025-04-30 10:38:15,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04-30 10:38:15,418 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:15,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-30 10:38:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2025-04-30 10:38:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 41 states have internal predecessors, (48), 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-04-30 10:38:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-04-30 10:38:15,421 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 10 [2025-04-30 10:38:15,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:15,422 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-04-30 10:38:15,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04-30 10:38:15,422 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-04-30 10:38:15,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:38:15,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:15,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:15,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:38:15,422 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:15,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 812476537, now seen corresponding path program 1 times [2025-04-30 10:38:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:15,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714032318] [2025-04-30 10:38:15,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:15,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:38:15,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:38:15,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:15,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:15,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714032318] [2025-04-30 10:38:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714032318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:15,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447389647] [2025-04-30 10:38:15,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:15,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:15,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:15,509 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-04-30 10:38:15,511 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-04-30 10:38:15,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:38:15,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:38:15,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:15,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:15,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:38:15,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:15,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447389647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:15,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-30 10:38:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734241668] [2025-04-30 10:38:15,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:15,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:15,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:15,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:15,655 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-04-30 10:38:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:15,718 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-04-30 10:38:15,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:15,719 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 14 [2025-04-30 10:38:15,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:15,719 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:38:15,719 INFO L226 Difference]: Without dead ends: 64 [2025-04-30 10:38:15,719 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:15,720 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:15,720 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 121 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-30 10:38:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2025-04-30 10:38:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.393939393939394) internal successors, (46), 41 states have internal predecessors, (46), 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-04-30 10:38:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-04-30 10:38:15,722 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2025-04-30 10:38:15,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:15,722 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-04-30 10:38:15,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-04-30 10:38:15,726 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-04-30 10:38:15,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:38:15,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:15,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:15,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:15,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:15,928 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:15,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1134837822, now seen corresponding path program 2 times [2025-04-30 10:38:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:15,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607933807] [2025-04-30 10:38:15,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:15,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-30 10:38:15,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:38:15,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:15,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:16,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607933807] [2025-04-30 10:38:16,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607933807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:16,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:16,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:38:16,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996853061] [2025-04-30 10:38:16,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:16,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:16,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:16,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:16,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:16,030 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-04-30 10:38:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:16,107 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-04-30 10:38:16,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:16,107 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2025-04-30 10:38:16,107 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:16,108 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:38:16,108 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:38:16,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:16,108 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:16,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:38:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:38:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 43 states have internal predecessors, (50), 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-04-30 10:38:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-04-30 10:38:16,111 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 18 [2025-04-30 10:38:16,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:16,111 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-04-30 10:38:16,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-04-30 10:38:16,111 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-04-30 10:38:16,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:38:16,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:16,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:16,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:38:16,111 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:16,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1134837821, now seen corresponding path program 1 times [2025-04-30 10:38:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:16,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272318523] [2025-04-30 10:38:16,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:16,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:38:16,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:38:16,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:16,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:16,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272318523] [2025-04-30 10:38:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272318523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:38:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799859232] [2025-04-30 10:38:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:16,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:16,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:16,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:16,281 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-04-30 10:38:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:16,339 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-30 10:38:16,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:16,340 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-04-30 10:38:16,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:16,340 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:38:16,341 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:38:16,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:16,341 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:16,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:38:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:38:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.4) internal successors, (49), 43 states have internal predecessors, (49), 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-04-30 10:38:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-04-30 10:38:16,348 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2025-04-30 10:38:16,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:16,348 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-04-30 10:38:16,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-04-30 10:38:16,348 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-04-30 10:38:16,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:38:16,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:16,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:16,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:38:16,350 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:16,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2034777499, now seen corresponding path program 1 times [2025-04-30 10:38:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:16,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851407664] [2025-04-30 10:38:16,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:16,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:16,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:38:16,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:38:16,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:16,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:16,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851407664] [2025-04-30 10:38:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851407664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722539036] [2025-04-30 10:38:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:16,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:16,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:16,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:16,425 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-04-30 10:38:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:16,459 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-04-30 10:38:16,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:16,463 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-04-30 10:38:16,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:16,463 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:38:16,463 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:38:16,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:16,464 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:16,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 164 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:38:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:38:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 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-04-30 10:38:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-04-30 10:38:16,466 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2025-04-30 10:38:16,466 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:16,466 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-04-30 10:38:16,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-04-30 10:38:16,466 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-04-30 10:38:16,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:38:16,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:16,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:16,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:38:16,470 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:16,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2029018643, now seen corresponding path program 1 times [2025-04-30 10:38:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:16,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650787229] [2025-04-30 10:38:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:38:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:38:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:16,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650787229] [2025-04-30 10:38:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650787229] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:16,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286686157] [2025-04-30 10:38:16,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:16,729 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-04-30 10:38:16,730 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-04-30 10:38:16,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:38:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:38:16,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:16,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:38:16,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:16,809 INFO L354 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-04-30 10:38:16,840 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:38:16,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:38:16,885 INFO L354 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 15 treesize of output 1 [2025-04-30 10:38:17,007 INFO L354 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-04-30 10:38:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:17,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:17,264 INFO L354 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 12 treesize of output 10 [2025-04-30 10:38:17,269 INFO L354 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 22 treesize of output 20 [2025-04-30 10:38:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286686157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:17,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-04-30 10:38:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404443073] [2025-04-30 10:38:17,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:17,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:38:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:17,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:38:17,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:38:17,354 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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-04-30 10:38:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:17,672 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-04-30 10:38:17,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:38:17,673 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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 21 [2025-04-30 10:38:17,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:17,673 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:38:17,673 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:38:17,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:38:17,674 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:17,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 325 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:38:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-04-30 10:38:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 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-04-30 10:38:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-04-30 10:38:17,677 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 21 [2025-04-30 10:38:17,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:17,677 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-04-30 10:38:17,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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-04-30 10:38:17,677 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-04-30 10:38:17,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:38:17,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:17,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:17,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:38:17,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-30 10:38:17,882 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:17,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2029018644, now seen corresponding path program 1 times [2025-04-30 10:38:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:17,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359051474] [2025-04-30 10:38:17,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:38:17,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:38:17,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:17,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:18,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359051474] [2025-04-30 10:38:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359051474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:18,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451368406] [2025-04-30 10:38:18,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:18,189 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-04-30 10:38:18,191 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-04-30 10:38:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:38:18,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:38:18,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:18,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:18,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-30 10:38:18,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:18,259 INFO L354 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-04-30 10:38:18,265 INFO L354 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-04-30 10:38:18,299 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:18,299 INFO L354 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-04-30 10:38:18,304 INFO L354 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-04-30 10:38:18,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:18,341 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:18,456 INFO L354 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-04-30 10:38:18,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-30 10:38:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:18,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:18,770 INFO L354 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 12 treesize of output 10 [2025-04-30 10:38:18,774 INFO L354 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 22 treesize of output 20 [2025-04-30 10:38:18,783 INFO L354 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 21 treesize of output 19 [2025-04-30 10:38:18,788 INFO L354 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 19 treesize of output 17 [2025-04-30 10:38:18,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:18,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:18,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451368406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:18,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:18,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-04-30 10:38:18,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772929327] [2025-04-30 10:38:18,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:18,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:38:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:18,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:38:18,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:38:18,990 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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-04-30 10:38:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:19,324 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-04-30 10:38:19,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:38:19,325 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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 21 [2025-04-30 10:38:19,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:19,325 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:38:19,325 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:38:19,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:38:19,326 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:19,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 457 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:38:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-04-30 10:38:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.368421052631579) internal successors, (52), 46 states have internal predecessors, (52), 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-04-30 10:38:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-04-30 10:38:19,332 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2025-04-30 10:38:19,332 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:19,332 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-04-30 10:38:19,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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-04-30 10:38:19,333 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-04-30 10:38:19,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:38:19,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:19,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:19,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:38:19,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:19,535 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:19,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -869551702, now seen corresponding path program 1 times [2025-04-30 10:38:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:19,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060201287] [2025-04-30 10:38:19,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:19,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:38:19,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:38:19,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:38:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:19,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060201287] [2025-04-30 10:38:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060201287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968976430] [2025-04-30 10:38:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:19,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:19,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:19,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:19,598 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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-04-30 10:38:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:19,658 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-04-30 10:38:19,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:19,658 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 24 [2025-04-30 10:38:19,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:19,658 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:38:19,658 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:38:19,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:19,659 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:19,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:38:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-30 10:38:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.375) internal successors, (55), 47 states have internal predecessors, (55), 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-04-30 10:38:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-04-30 10:38:19,661 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 24 [2025-04-30 10:38:19,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:19,661 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-04-30 10:38:19,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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-04-30 10:38:19,661 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-04-30 10:38:19,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:38:19,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:19,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:19,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:38:19,662 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:19,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -869551701, now seen corresponding path program 1 times [2025-04-30 10:38:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:19,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491839440] [2025-04-30 10:38:19,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:19,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:38:19,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:38:19,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:19,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491839440] [2025-04-30 10:38:19,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491839440] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:19,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778133563] [2025-04-30 10:38:19,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:19,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:19,726 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-04-30 10:38:19,728 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-04-30 10:38:19,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:38:19,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:38:19,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:38:19,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:19,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:19,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778133563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:19,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:19,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-30 10:38:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019362557] [2025-04-30 10:38:19,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:19,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:38:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:19,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:38:19,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:38:19,880 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-04-30 10:38:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:19,919 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-04-30 10:38:19,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:38:19,920 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 24 [2025-04-30 10:38:19,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:19,921 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:38:19,921 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:38:19,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:38:19,921 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:19,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 270 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:38:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2025-04-30 10:38:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 49 states have internal predecessors, (57), 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-04-30 10:38:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-04-30 10:38:19,926 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 24 [2025-04-30 10:38:19,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:19,926 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-04-30 10:38:19,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-04-30 10:38:19,927 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-04-30 10:38:19,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:38:19,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:19,927 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:19,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:38:20,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:20,128 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:20,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -875310558, now seen corresponding path program 2 times [2025-04-30 10:38:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:20,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808033971] [2025-04-30 10:38:20,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:20,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-30 10:38:20,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:38:20,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:20,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808033971] [2025-04-30 10:38:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808033971] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:20,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622319142] [2025-04-30 10:38:20,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:20,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:20,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:20,446 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-04-30 10:38:20,447 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-04-30 10:38:20,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-30 10:38:20,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:38:20,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:20,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-30 10:38:20,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:20,521 INFO L354 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-04-30 10:38:20,549 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:20,555 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:20,608 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:20,608 INFO L354 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-04-30 10:38:20,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:38:20,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:38:20,903 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:20,910 INFO L325 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-04-30 10:38:20,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2025-04-30 10:38:20,918 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:38:20,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-04-30 10:38:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:20,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:21,811 INFO L354 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 62 treesize of output 58 [2025-04-30 10:38:21,880 INFO L354 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 126 treesize of output 118 [2025-04-30 10:38:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:22,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622319142] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:22,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2025-04-30 10:38:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037592622] [2025-04-30 10:38:22,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:22,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:38:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:22,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:38:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:38:22,056 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 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-04-30 10:38:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:22,655 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-04-30 10:38:22,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:38:22,655 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 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 24 [2025-04-30 10:38:22,655 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:22,655 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:38:22,656 INFO L226 Difference]: Without dead ends: 64 [2025-04-30 10:38:22,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:38:22,657 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:22,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 810 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:38:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-30 10:38:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-04-30 10:38:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 61 states have internal predecessors, (71), 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-04-30 10:38:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-04-30 10:38:22,662 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 24 [2025-04-30 10:38:22,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:22,662 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-04-30 10:38:22,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 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-04-30 10:38:22,662 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-04-30 10:38:22,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:38:22,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:22,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:22,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:38:22,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:38:22,863 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:22,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1186342518, now seen corresponding path program 1 times [2025-04-30 10:38:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:22,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764576889] [2025-04-30 10:38:22,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:22,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:38:22,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:38:22,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:22,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:22,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764576889] [2025-04-30 10:38:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764576889] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:22,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056782332] [2025-04-30 10:38:22,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:22,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:22,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:22,992 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-04-30 10:38:22,993 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-04-30 10:38:23,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:38:23,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:38:23,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:23,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:38:23,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:23,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:23,122 INFO L354 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 16 treesize of output 8 [2025-04-30 10:38:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:23,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:23,218 INFO L354 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 11 treesize of output 9 [2025-04-30 10:38:23,222 INFO L354 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 20 treesize of output 18 [2025-04-30 10:38:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:23,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056782332] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:23,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2025-04-30 10:38:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206828965] [2025-04-30 10:38:23,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:23,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:38:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:23,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:38:23,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:38:23,254 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-04-30 10:38:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:23,400 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-04-30 10:38:23,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:38:23,401 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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 25 [2025-04-30 10:38:23,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:23,401 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:38:23,401 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:38:23,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:38:23,402 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:23,402 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 432 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:38:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-30 10:38:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 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-04-30 10:38:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-04-30 10:38:23,404 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 25 [2025-04-30 10:38:23,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:23,404 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-04-30 10:38:23,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-04-30 10:38:23,404 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-04-30 10:38:23,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:38:23,404 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:23,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:23,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:38:23,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:23,605 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:23,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1624600772, now seen corresponding path program 2 times [2025-04-30 10:38:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:23,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919799664] [2025-04-30 10:38:23,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:23,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:38:23,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:38:23,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:23,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:23,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919799664] [2025-04-30 10:38:23,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919799664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:23,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608141137] [2025-04-30 10:38:23,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:23,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:23,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:23,735 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-04-30 10:38:23,737 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-04-30 10:38:23,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:38:23,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:38:23,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:23,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:23,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:38:23,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:38:23,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:23,860 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:23,860 INFO L354 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 19 treesize of output 23 [2025-04-30 10:38:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:38:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608141137] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:23,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:23,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 9 [2025-04-30 10:38:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684731341] [2025-04-30 10:38:23,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:23,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:38:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:23,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:38:23,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:38:23,890 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 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-04-30 10:38:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:23,959 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-04-30 10:38:23,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:23,960 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 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 27 [2025-04-30 10:38:23,960 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:23,960 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:38:23,960 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:38:23,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:23,960 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:23,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 177 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:38:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-30 10:38:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 59 states have internal predecessors, (66), 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-04-30 10:38:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-04-30 10:38:23,962 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 27 [2025-04-30 10:38:23,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:23,962 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-04-30 10:38:23,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 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-04-30 10:38:23,962 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-04-30 10:38:23,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:38:23,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:23,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:23,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:24,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:24,163 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:24,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1176940057, now seen corresponding path program 2 times [2025-04-30 10:38:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:24,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381412003] [2025-04-30 10:38:24,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:24,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:38:24,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:38:24,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:24,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381412003] [2025-04-30 10:38:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381412003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:24,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790761018] [2025-04-30 10:38:24,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:24,253 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-04-30 10:38:24,254 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-04-30 10:38:24,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:38:24,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:38:24,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:24,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:24,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:38:24,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:24,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790761018] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:24,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-30 10:38:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979797061] [2025-04-30 10:38:24,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:24,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:38:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:24,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:38:24,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:38:24,393 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-04-30 10:38:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:24,434 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-04-30 10:38:24,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:24,434 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 28 [2025-04-30 10:38:24,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:24,435 INFO L225 Difference]: With dead ends: 103 [2025-04-30 10:38:24,435 INFO L226 Difference]: Without dead ends: 103 [2025-04-30 10:38:24,435 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:38:24,435 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:24,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 254 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-30 10:38:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-04-30 10:38:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 94 states have internal predecessors, (106), 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-04-30 10:38:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2025-04-30 10:38:24,438 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 28 [2025-04-30 10:38:24,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:24,438 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2025-04-30 10:38:24,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-04-30 10:38:24,438 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2025-04-30 10:38:24,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:38:24,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:24,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:24,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:38:24,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:38:24,640 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:24,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1176995583, now seen corresponding path program 1 times [2025-04-30 10:38:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:24,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935532366] [2025-04-30 10:38:24,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:24,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:38:24,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:38:24,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:24,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:38:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:24,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935532366] [2025-04-30 10:38:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935532366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:24,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273415754] [2025-04-30 10:38:24,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:24,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:24,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:24,734 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-04-30 10:38:24,736 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-04-30 10:38:24,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:38:24,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:38:24,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:24,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:24,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:38:24,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:24,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273415754] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:38:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 9] total 15 [2025-04-30 10:38:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959868580] [2025-04-30 10:38:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:24,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:38:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:24,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:38:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:38:24,926 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-04-30 10:38:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:24,967 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2025-04-30 10:38:24,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:38:24,967 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 28 [2025-04-30 10:38:24,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:24,968 INFO L225 Difference]: With dead ends: 100 [2025-04-30 10:38:24,968 INFO L226 Difference]: Without dead ends: 100 [2025-04-30 10:38:24,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:38:24,968 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:24,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 153 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-30 10:38:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2025-04-30 10:38:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 94 states have internal predecessors, (105), 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-04-30 10:38:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2025-04-30 10:38:24,971 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 28 [2025-04-30 10:38:24,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:24,971 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2025-04-30 10:38:24,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-04-30 10:38:24,972 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2025-04-30 10:38:24,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:38:24,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:24,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:24,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:38:25,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:38:25,173 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:25,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -197631445, now seen corresponding path program 3 times [2025-04-30 10:38:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:25,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290856046] [2025-04-30 10:38:25,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:25,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-30 10:38:25,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:38:25,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:38:25,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:25,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290856046] [2025-04-30 10:38:25,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290856046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:25,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26963321] [2025-04-30 10:38:25,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:25,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:25,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:25,222 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-04-30 10:38:25,224 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-04-30 10:38:25,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-30 10:38:25,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:38:25,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:38:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:25,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:38:25,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:25,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:38:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26963321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:38:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-30 10:38:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188625381] [2025-04-30 10:38:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:25,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:25,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:25,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:25,322 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-04-30 10:38:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:25,349 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2025-04-30 10:38:25,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:38:25,349 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2025-04-30 10:38:25,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:25,350 INFO L225 Difference]: With dead ends: 84 [2025-04-30 10:38:25,350 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:38:25,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:25,350 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:25,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 135 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:38:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-04-30 10:38:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.2) internal successors, (90), 82 states have internal predecessors, (90), 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-04-30 10:38:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2025-04-30 10:38:25,352 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2025-04-30 10:38:25,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:25,352 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2025-04-30 10:38:25,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-04-30 10:38:25,352 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2025-04-30 10:38:25,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:38:25,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:25,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:25,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:25,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:38:25,554 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:25,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:25,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2126754075, now seen corresponding path program 1 times [2025-04-30 10:38:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:25,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69374292] [2025-04-30 10:38:25,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:25,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:38:25,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:38:25,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:25,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:25,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69374292] [2025-04-30 10:38:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69374292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39939155] [2025-04-30 10:38:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:25,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:25,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:25,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:25,600 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-04-30 10:38:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:25,628 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-04-30 10:38:25,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:25,628 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 29 [2025-04-30 10:38:25,628 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:25,629 INFO L225 Difference]: With dead ends: 85 [2025-04-30 10:38:25,629 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:38:25,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:25,629 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:25,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:38:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-30 10:38:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 84 states have internal predecessors, (92), 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-04-30 10:38:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-04-30 10:38:25,631 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 29 [2025-04-30 10:38:25,631 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:25,631 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-04-30 10:38:25,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-04-30 10:38:25,631 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-04-30 10:38:25,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:38:25,632 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:25,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:25,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:38:25,632 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:25,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1504866986, now seen corresponding path program 1 times [2025-04-30 10:38:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:25,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314766407] [2025-04-30 10:38:25,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:25,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:38:25,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:38:25,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:25,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:25,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314766407] [2025-04-30 10:38:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314766407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:25,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:25,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516088021] [2025-04-30 10:38:25,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:25,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:25,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:25,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:25,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:25,692 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-04-30 10:38:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:25,737 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-04-30 10:38:25,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:25,738 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 30 [2025-04-30 10:38:25,738 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:25,738 INFO L225 Difference]: With dead ends: 86 [2025-04-30 10:38:25,738 INFO L226 Difference]: Without dead ends: 86 [2025-04-30 10:38:25,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:25,739 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:25,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-30 10:38:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-30 10:38:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 85 states have internal predecessors, (93), 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-04-30 10:38:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-04-30 10:38:25,741 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 30 [2025-04-30 10:38:25,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:25,741 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-04-30 10:38:25,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-04-30 10:38:25,741 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-04-30 10:38:25,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:38:25,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:25,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:25,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:38:25,742 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:25,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 654094272, now seen corresponding path program 1 times [2025-04-30 10:38:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:25,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325370944] [2025-04-30 10:38:25,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:25,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:25,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:25,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:25,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:25,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325370944] [2025-04-30 10:38:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325370944] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:25,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218422626] [2025-04-30 10:38:25,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:25,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:25,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:25,789 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:25,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:38:25,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:25,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:25,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:38:25,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:25,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218422626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:25,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-04-30 10:38:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140962095] [2025-04-30 10:38:25,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:25,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:25,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:25,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:25,915 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-04-30 10:38:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:25,971 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2025-04-30 10:38:25,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:25,971 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 32 [2025-04-30 10:38:25,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:25,972 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:38:25,972 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:38:25,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:38:25,972 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 91 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:25,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 175 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:38:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-04-30 10:38:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.2) internal successors, (84), 77 states have internal predecessors, (84), 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-04-30 10:38:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-04-30 10:38:25,974 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 32 [2025-04-30 10:38:25,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:25,974 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-04-30 10:38:25,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-04-30 10:38:25,974 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-04-30 10:38:25,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:38:25,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:25,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:25,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:26,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:38:26,180 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:26,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -720477230, now seen corresponding path program 1 times [2025-04-30 10:38:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:26,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994217788] [2025-04-30 10:38:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:26,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:26,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:26,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:26,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994217788] [2025-04-30 10:38:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994217788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:26,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555303054] [2025-04-30 10:38:26,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:26,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:26,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:26,467 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:26,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:38:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:26,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:26,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:26,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:26,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-30 10:38:26,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:26,546 INFO L354 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-04-30 10:38:26,563 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:38:26,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:38:26,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:26,658 INFO L325 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-04-30 10:38:26,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-04-30 10:38:26,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 57 treesize of output 29 [2025-04-30 10:38:26,713 INFO L354 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 15 treesize of output 1 [2025-04-30 10:38:26,847 INFO L354 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 15 treesize of output 7 [2025-04-30 10:38:26,934 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:26,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2025-04-30 10:38:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:26,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:27,281 INFO L354 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 10 treesize of output 8 [2025-04-30 10:38:27,284 INFO L354 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 18 treesize of output 16 [2025-04-30 10:38:27,521 INFO L354 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 166 treesize of output 158 [2025-04-30 10:38:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555303054] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:28,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:28,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 38 [2025-04-30 10:38:28,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994580353] [2025-04-30 10:38:28,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:28,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-30 10:38:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:28,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-30 10:38:28,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:38:28,091 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 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-04-30 10:38:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:28,789 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2025-04-30 10:38:28,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:38:28,790 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 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 32 [2025-04-30 10:38:28,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:28,790 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:38:28,790 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:38:28,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=2056, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:38:28,791 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:28,791 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 689 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:38:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:38:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-04-30 10:38:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 80 states have internal predecessors, (89), 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-04-30 10:38:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-04-30 10:38:28,793 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 32 [2025-04-30 10:38:28,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:28,793 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-04-30 10:38:28,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 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-04-30 10:38:28,793 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-04-30 10:38:28,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:38:28,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:28,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:28,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:28,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:38:28,996 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:28,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash -720477229, now seen corresponding path program 1 times [2025-04-30 10:38:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:28,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509576797] [2025-04-30 10:38:28,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:29,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:29,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:29,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:29,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509576797] [2025-04-30 10:38:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509576797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:29,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773547968] [2025-04-30 10:38:29,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:29,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:29,403 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:29,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:38:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:29,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:29,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:29,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-30 10:38:29,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:29,487 INFO L354 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-04-30 10:38:29,491 INFO L354 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-04-30 10:38:29,512 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:38:29,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:38:29,528 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:38:29,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:38:29,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:29,577 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:29,647 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-30 10:38:29,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-30 10:38:29,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:38:29,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:38:29,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 57 treesize of output 29 [2025-04-30 10:38:29,994 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:30,004 INFO L325 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2025-04-30 10:38:30,004 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2025-04-30 10:38:30,013 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:38:30,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-04-30 10:38:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:30,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:31,054 INFO L354 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 202 treesize of output 198 [2025-04-30 10:38:31,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:31,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 542 treesize of output 526 [2025-04-30 10:38:31,372 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:31,375 INFO L354 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 24 treesize of output 20 [2025-04-30 10:38:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773547968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:31,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2025-04-30 10:38:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935577297] [2025-04-30 10:38:31,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:31,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:38:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:31,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:38:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:38:31,953 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 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-04-30 10:38:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:32,837 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2025-04-30 10:38:32,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:38:32,837 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 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 32 [2025-04-30 10:38:32,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:32,838 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:38:32,838 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:38:32,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=211, Invalid=2441, Unknown=0, NotChecked=0, Total=2652 [2025-04-30 10:38:32,839 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:32,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 832 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:38:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:38:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-04-30 10:38:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 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-04-30 10:38:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2025-04-30 10:38:32,840 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 32 [2025-04-30 10:38:32,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:32,841 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2025-04-30 10:38:32,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 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-04-30 10:38:32,841 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2025-04-30 10:38:32,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:38:32,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:32,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:32,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:33,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-30 10:38:33,045 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:33,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 623846240, now seen corresponding path program 1 times [2025-04-30 10:38:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:33,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855537339] [2025-04-30 10:38:33,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:33,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:38:33,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:38:33,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:33,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855537339] [2025-04-30 10:38:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855537339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:33,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226821400] [2025-04-30 10:38:33,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:33,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:33,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:33,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:38:33,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:38:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:38:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:33,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:38:33,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:33,339 INFO L354 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-04-30 10:38:33,354 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:38:33,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:38:33,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:33,471 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:33,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 21 [2025-04-30 10:38:33,542 INFO L354 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-04-30 10:38:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:33,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:33,628 INFO L354 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 12 treesize of output 10 [2025-04-30 10:38:33,629 INFO L354 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 22 treesize of output 20 [2025-04-30 10:38:33,633 INFO L354 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 11 treesize of output 9 [2025-04-30 10:38:33,635 INFO L354 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 20 treesize of output 18 [2025-04-30 10:38:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226821400] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:33,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 27 [2025-04-30 10:38:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209295031] [2025-04-30 10:38:33,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:33,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:38:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:33,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:38:33,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:38:33,709 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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-04-30 10:38:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:34,144 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-04-30 10:38:34,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:38:34,145 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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 33 [2025-04-30 10:38:34,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:34,145 INFO L225 Difference]: With dead ends: 84 [2025-04-30 10:38:34,145 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:38:34,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:38:34,146 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:34,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 399 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:38:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-04-30 10:38:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 83 states have internal predecessors, (93), 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-04-30 10:38:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-04-30 10:38:34,147 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 33 [2025-04-30 10:38:34,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:34,147 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-04-30 10:38:34,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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-04-30 10:38:34,147 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-04-30 10:38:34,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:38:34,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:34,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:34,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:38:34,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:34,352 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:34,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 623846241, now seen corresponding path program 1 times [2025-04-30 10:38:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:34,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755034740] [2025-04-30 10:38:34,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:34,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:38:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:38:34,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:34,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:34,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:34,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755034740] [2025-04-30 10:38:34,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755034740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:34,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499277337] [2025-04-30 10:38:34,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:34,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:34,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:34,581 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:34,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:38:34,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:38:34,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:38:34,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:34,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:34,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-30 10:38:34,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:34,684 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:34,687 INFO L354 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 15 treesize of output 1 [2025-04-30 10:38:34,826 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:34,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 17 [2025-04-30 10:38:34,833 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:34,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 15 [2025-04-30 10:38:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:34,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:35,077 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:35,077 INFO L354 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 31 treesize of output 35 [2025-04-30 10:38:35,277 INFO L354 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 10 treesize of output 8 [2025-04-30 10:38:35,278 INFO L354 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 14 treesize of output 12 [2025-04-30 10:38:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499277337] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:35,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:35,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 40 [2025-04-30 10:38:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695081334] [2025-04-30 10:38:35,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:35,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:38:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:35,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:38:35,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:38:35,354 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 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-04-30 10:38:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:35,827 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2025-04-30 10:38:35,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:38:35,828 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 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 33 [2025-04-30 10:38:35,828 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:35,828 INFO L225 Difference]: With dead ends: 86 [2025-04-30 10:38:35,828 INFO L226 Difference]: Without dead ends: 86 [2025-04-30 10:38:35,829 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=2274, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:38:35,829 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:35,829 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 668 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:38:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-30 10:38:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-30 10:38:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.205128205128205) internal successors, (94), 85 states have internal predecessors, (94), 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-04-30 10:38:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-04-30 10:38:35,831 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 33 [2025-04-30 10:38:35,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:35,831 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-04-30 10:38:35,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 states have internal predecessors, (79), 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-04-30 10:38:35,831 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-04-30 10:38:35,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:38:35,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:35,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:35,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:38:36,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:36,032 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:36,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2135591046, now seen corresponding path program 1 times [2025-04-30 10:38:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:36,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468387891] [2025-04-30 10:38:36,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:36,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:38:36,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:38:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:36,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468387891] [2025-04-30 10:38:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468387891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:36,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740507562] [2025-04-30 10:38:36,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:36,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:36,205 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:36,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:38:36,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:38:36,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:38:36,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:36,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:36,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:38:36,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:36,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:36,416 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:36,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 16 [2025-04-30 10:38:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:36,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:36,525 INFO L354 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 11 treesize of output 9 [2025-04-30 10:38:36,527 INFO L354 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 20 treesize of output 18 [2025-04-30 10:38:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740507562] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:36,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 27 [2025-04-30 10:38:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967301688] [2025-04-30 10:38:36,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:36,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:38:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:36,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:38:36,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:38:36,537 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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-04-30 10:38:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:36,964 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2025-04-30 10:38:36,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:38:36,965 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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 34 [2025-04-30 10:38:36,965 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:36,965 INFO L225 Difference]: With dead ends: 88 [2025-04-30 10:38:36,965 INFO L226 Difference]: Without dead ends: 88 [2025-04-30 10:38:36,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:38:36,966 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:36,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 611 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-30 10:38:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-04-30 10:38:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 85 states have internal predecessors, (93), 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-04-30 10:38:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-04-30 10:38:36,968 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 34 [2025-04-30 10:38:36,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:36,968 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-04-30 10:38:36,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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-04-30 10:38:36,968 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-04-30 10:38:36,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:38:36,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:36,968 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:36,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:37,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:38:37,173 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:37,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1785561085, now seen corresponding path program 2 times [2025-04-30 10:38:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:37,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182841655] [2025-04-30 10:38:37,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:37,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-30 10:38:37,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:38:37,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:37,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:37,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:37,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182841655] [2025-04-30 10:38:37,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182841655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:37,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797817083] [2025-04-30 10:38:37,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:37,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:37,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:37,682 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:37,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:38:37,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-30 10:38:37,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:38:37,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:37,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:37,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-30 10:38:37,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:37,766 INFO L354 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-04-30 10:38:37,792 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:37,796 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:37,831 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:38:37,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:38:37,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:38:37,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:38:37,960 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-30 10:38:37,960 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-30 10:38:38,019 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-30 10:38:38,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2025-04-30 10:38:38,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-30 10:38:38,546 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:38,566 INFO L325 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2025-04-30 10:38:38,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 62 [2025-04-30 10:38:38,577 INFO L325 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-04-30 10:38:38,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2025-04-30 10:38:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:38,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:45,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:45,357 INFO L354 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 2261 treesize of output 2133 [2025-04-30 10:38:45,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:45,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:45,561 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,571 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,573 INFO L354 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 638 treesize of output 622 [2025-04-30 10:38:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797817083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:46,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 52 [2025-04-30 10:38:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084836279] [2025-04-30 10:38:46,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:46,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-30 10:38:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:46,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-30 10:38:46,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2525, Unknown=1, NotChecked=0, Total=2652 [2025-04-30 10:38:46,113 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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-04-30 10:38:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:48,074 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-04-30 10:38:48,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:38:48,075 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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 35 [2025-04-30 10:38:48,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:48,075 INFO L225 Difference]: With dead ends: 103 [2025-04-30 10:38:48,075 INFO L226 Difference]: Without dead ends: 103 [2025-04-30 10:38:48,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=193, Invalid=3838, Unknown=1, NotChecked=0, Total=4032 [2025-04-30 10:38:48,076 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:48,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1138 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-30 10:38:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-30 10:38:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-04-30 10:38:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 100 states have internal predecessors, (110), 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-04-30 10:38:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-04-30 10:38:48,078 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 35 [2025-04-30 10:38:48,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:48,078 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-04-30 10:38:48,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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-04-30 10:38:48,078 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-04-30 10:38:48,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:38:48,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:48,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:48,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:38:48,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:38:48,281 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:48,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 679882853, now seen corresponding path program 1 times [2025-04-30 10:38:48,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:48,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501345904] [2025-04-30 10:38:48,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:48,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:48,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:38:48,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:38:48,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:48,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:48,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501345904] [2025-04-30 10:38:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501345904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:48,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931728132] [2025-04-30 10:38:48,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:48,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:48,435 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:48,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:38:48,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:38:48,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:38:48,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:48,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:48,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:38:48,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:48,535 INFO L354 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 15 treesize of output 1 [2025-04-30 10:38:48,609 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:48,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 17 [2025-04-30 10:38:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:48,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:48,786 INFO L354 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 10 treesize of output 8 [2025-04-30 10:38:48,787 INFO L354 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 18 treesize of output 16 [2025-04-30 10:38:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931728132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:48,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 21 [2025-04-30 10:38:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506363448] [2025-04-30 10:38:48,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:48,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:38:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:48,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:38:48,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:38:48,799 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-04-30 10:38:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:49,126 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2025-04-30 10:38:49,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:38:49,126 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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 36 [2025-04-30 10:38:49,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:49,127 INFO L225 Difference]: With dead ends: 102 [2025-04-30 10:38:49,127 INFO L226 Difference]: Without dead ends: 102 [2025-04-30 10:38:49,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:38:49,127 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:49,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 454 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-30 10:38:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-04-30 10:38:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 101 states have internal predecessors, (111), 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-04-30 10:38:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2025-04-30 10:38:49,129 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 36 [2025-04-30 10:38:49,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:49,129 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2025-04-30 10:38:49,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-04-30 10:38:49,129 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2025-04-30 10:38:49,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:38:49,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:49,130 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:49,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-30 10:38:49,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:38:49,330 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:49,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash 660662217, now seen corresponding path program 2 times [2025-04-30 10:38:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:49,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359672199] [2025-04-30 10:38:49,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:49,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:38:49,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:38:49,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:49,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:49,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359672199] [2025-04-30 10:38:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359672199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:49,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968696984] [2025-04-30 10:38:49,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:49,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:49,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:49,566 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:49,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:38:49,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:38:49,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:38:49,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:49,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:38:49,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:49,657 INFO L354 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-04-30 10:38:49,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:49,734 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:49,734 INFO L354 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-04-30 10:38:49,767 INFO L354 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 15 treesize of output 1 [2025-04-30 10:38:49,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 16 [2025-04-30 10:38:49,873 INFO L354 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 15 treesize of output 7 [2025-04-30 10:38:49,945 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:38:49,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-04-30 10:38:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:49,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:50,247 INFO L354 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 10 treesize of output 8 [2025-04-30 10:38:50,250 INFO L354 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 18 treesize of output 16 [2025-04-30 10:38:50,479 INFO L354 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 134 treesize of output 126 [2025-04-30 10:38:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:38:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968696984] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:50,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 35 [2025-04-30 10:38:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496277804] [2025-04-30 10:38:50,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:50,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:38:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:50,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:38:50,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:38:50,611 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 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-04-30 10:38:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:51,243 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2025-04-30 10:38:51,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:38:51,243 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 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 36 [2025-04-30 10:38:51,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:51,243 INFO L225 Difference]: With dead ends: 102 [2025-04-30 10:38:51,243 INFO L226 Difference]: Without dead ends: 102 [2025-04-30 10:38:51,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=1899, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:38:51,244 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:51,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 903 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:38:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-30 10:38:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-04-30 10:38:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 101 states have internal predecessors, (109), 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-04-30 10:38:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2025-04-30 10:38:51,246 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 36 [2025-04-30 10:38:51,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:51,246 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2025-04-30 10:38:51,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 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-04-30 10:38:51,246 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2025-04-30 10:38:51,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:38:51,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:51,246 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:51,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:51,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:38:51,448 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:51,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -675592251, now seen corresponding path program 2 times [2025-04-30 10:38:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:51,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626092393] [2025-04-30 10:38:51,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:51,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-30 10:38:51,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:38:51,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:51,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626092393] [2025-04-30 10:38:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626092393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:51,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776843811] [2025-04-30 10:38:51,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:51,708 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:51,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:38:51,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-30 10:38:51,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:38:51,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:51,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:38:51,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:51,813 INFO L354 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-04-30 10:38:51,839 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:51,842 INFO L354 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 11 treesize of output 7 [2025-04-30 10:38:51,887 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:51,887 INFO L354 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-04-30 10:38:51,916 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2025-04-30 10:38:51,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:38:52,319 INFO L325 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-04-30 10:38:52,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2025-04-30 10:38:52,326 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 15 [2025-04-30 10:38:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:52,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:52,829 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1) 0) 0) (forall ((v_ArrVal_873 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_873) .cse1) 0) 0))))) is different from false [2025-04-30 10:38:57,108 INFO L354 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 102 treesize of output 94 [2025-04-30 10:38:57,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:57,137 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-04-30 10:38:57,143 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:57,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 30 [2025-04-30 10:38:57,146 INFO L354 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 9 treesize of output 7 [2025-04-30 10:38:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-04-30 10:38:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776843811] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:57,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 20] total 48 [2025-04-30 10:38:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430658275] [2025-04-30 10:38:57,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:57,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-30 10:38:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:57,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-30 10:38:57,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2047, Unknown=2, NotChecked=90, Total=2256 [2025-04-30 10:38:57,319 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 48 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 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-04-30 10:38:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:58,485 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2025-04-30 10:38:58,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:38:58,485 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 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 39 [2025-04-30 10:38:58,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:58,486 INFO L225 Difference]: With dead ends: 115 [2025-04-30 10:38:58,486 INFO L226 Difference]: Without dead ends: 115 [2025-04-30 10:38:58,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=209, Invalid=3453, Unknown=2, NotChecked=118, Total=3782 [2025-04-30 10:38:58,487 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:58,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 926 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1419 Invalid, 0 Unknown, 50 Unchecked, 0.6s Time] [2025-04-30 10:38:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-30 10:38:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-04-30 10:38:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 114 states have internal predecessors, (122), 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-04-30 10:38:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2025-04-30 10:38:58,489 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 39 [2025-04-30 10:38:58,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:58,489 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2025-04-30 10:38:58,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 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-04-30 10:38:58,489 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2025-04-30 10:38:58,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:38:58,490 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:58,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:58,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:58,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:58,690 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:58,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1825995910, now seen corresponding path program 3 times [2025-04-30 10:38:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:58,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993931450] [2025-04-30 10:38:58,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:58,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-30 10:38:58,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:38:58,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:38:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:58,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993931450] [2025-04-30 10:38:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993931450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:58,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339344016] [2025-04-30 10:38:58,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:58,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:58,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:58,865 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:58,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:38:58,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-30 10:38:58,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:38:58,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:38:58,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:58,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:38:58,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:59,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339344016] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:59,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 17 [2025-04-30 10:38:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971167909] [2025-04-30 10:38:59,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:59,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:38:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:59,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:38:59,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:38:59,129 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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-04-30 10:38:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:59,283 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2025-04-30 10:38:59,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:38:59,283 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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 39 [2025-04-30 10:38:59,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:59,284 INFO L225 Difference]: With dead ends: 169 [2025-04-30 10:38:59,284 INFO L226 Difference]: Without dead ends: 169 [2025-04-30 10:38:59,284 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:38:59,284 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:59,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 505 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-30 10:38:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-04-30 10:38:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 153 states have (on average 1.130718954248366) internal successors, (173), 160 states have internal predecessors, (173), 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-04-30 10:38:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2025-04-30 10:38:59,287 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 39 [2025-04-30 10:38:59,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:59,287 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2025-04-30 10:38:59,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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-04-30 10:38:59,287 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2025-04-30 10:38:59,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:38:59,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:59,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:59,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:59,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:59,488 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:59,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash 606560090, now seen corresponding path program 3 times [2025-04-30 10:38:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:59,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450614150] [2025-04-30 10:38:59,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:59,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:59,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-04-30 10:38:59,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:38:59,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:38:59,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:59,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:59,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450614150] [2025-04-30 10:38:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450614150] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:59,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857608540] [2025-04-30 10:38:59,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:59,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:59,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:59,562 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:59,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-30 10:38:59,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-04-30 10:38:59,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:38:59,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:38:59,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:59,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:38:59,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:59,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857608540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:59,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-04-30 10:38:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720893628] [2025-04-30 10:38:59,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:59,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:38:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:59,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:38:59,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:59,717 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-04-30 10:38:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:59,772 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2025-04-30 10:38:59,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:38:59,772 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 39 [2025-04-30 10:38:59,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:59,773 INFO L225 Difference]: With dead ends: 147 [2025-04-30 10:38:59,773 INFO L226 Difference]: Without dead ends: 147 [2025-04-30 10:38:59,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:38:59,773 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:59,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 207 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-30 10:38:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-04-30 10:38:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 145 states have internal predecessors, (155), 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-04-30 10:38:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2025-04-30 10:38:59,776 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 39 [2025-04-30 10:38:59,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:59,777 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2025-04-30 10:38:59,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-04-30 10:38:59,777 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2025-04-30 10:38:59,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:38:59,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:59,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:59,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-30 10:38:59,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:59,978 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:38:59,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 531488693, now seen corresponding path program 2 times [2025-04-30 10:38:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:59,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400078128] [2025-04-30 10:38:59,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:59,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-30 10:38:59,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:38:59,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:59,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:39:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:00,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400078128] [2025-04-30 10:39:00,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400078128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:00,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115367571] [2025-04-30 10:39:00,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:39:00,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:00,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:00,321 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:00,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-30 10:39:00,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-30 10:39:00,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:39:00,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:39:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:00,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-30 10:39:00,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:00,509 INFO L354 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 15 treesize of output 1 [2025-04-30 10:39:00,685 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:00,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 36 [2025-04-30 10:39:00,919 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_35| Int) (|v_ULTIMATE.start_sll_destroy_~head#1.base_34| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_35|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_34| 0) |v_ULTIMATE.start_sll_destroy_~head#1.base_35| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_35| 1) |v_ULTIMATE.start_sll_destroy_~head#1.base_34|) 0))) is different from true [2025-04-30 10:39:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-04-30 10:39:00,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:01,170 INFO L354 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 20 treesize of output 18 [2025-04-30 10:39:01,171 INFO L354 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 38 treesize of output 36 [2025-04-30 10:39:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:39:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115367571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:01,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 39 [2025-04-30 10:39:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649411980] [2025-04-30 10:39:01,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:01,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:39:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:01,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:39:01,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1383, Unknown=1, NotChecked=74, Total=1560 [2025-04-30 10:39:01,659 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 40 states have internal predecessors, (97), 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-04-30 10:39:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:02,510 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2025-04-30 10:39:02,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:39:02,511 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 40 states have internal predecessors, (97), 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 40 [2025-04-30 10:39:02,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:02,511 INFO L225 Difference]: With dead ends: 148 [2025-04-30 10:39:02,511 INFO L226 Difference]: Without dead ends: 113 [2025-04-30 10:39:02,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=157, Invalid=2102, Unknown=1, NotChecked=92, Total=2352 [2025-04-30 10:39:02,512 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:02,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 561 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 808 Invalid, 0 Unknown, 68 Unchecked, 0.5s Time] [2025-04-30 10:39:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-30 10:39:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-30 10:39:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 112 states have internal predecessors, (121), 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-04-30 10:39:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-04-30 10:39:02,514 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 40 [2025-04-30 10:39:02,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:02,514 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-04-30 10:39:02,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 40 states have internal predecessors, (97), 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-04-30 10:39:02,514 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-04-30 10:39:02,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:02,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:02,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:02,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:02,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,715 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:39:02,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1491352717, now seen corresponding path program 4 times [2025-04-30 10:39:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:02,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126717711] [2025-04-30 10:39:02,715 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:39:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:02,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:39:02,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 43 statements. [2025-04-30 10:39:02,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:39:02,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:02,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:02,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126717711] [2025-04-30 10:39:02,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126717711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:02,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4105463] [2025-04-30 10:39:02,777 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:39:02,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:02,779 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:02,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-30 10:39:02,857 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:39:02,873 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 43 statements. [2025-04-30 10:39:02,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:39:02,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:39:02,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:02,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:02,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4105463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:02,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:02,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-04-30 10:39:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854294060] [2025-04-30 10:39:02,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:02,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:39:02,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:02,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:39:02,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:39:02,959 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-04-30 10:39:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:03,038 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2025-04-30 10:39:03,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:39:03,038 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 43 [2025-04-30 10:39:03,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:03,039 INFO L225 Difference]: With dead ends: 103 [2025-04-30 10:39:03,039 INFO L226 Difference]: Without dead ends: 103 [2025-04-30 10:39:03,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:39:03,039 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 58 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:03,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 152 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-30 10:39:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-04-30 10:39:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 101 states have internal predecessors, (109), 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-04-30 10:39:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2025-04-30 10:39:03,041 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 43 [2025-04-30 10:39:03,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:03,041 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2025-04-30 10:39:03,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-04-30 10:39:03,041 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2025-04-30 10:39:03,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:03,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:03,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:03,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:03,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:03,243 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:39:03,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 941203283, now seen corresponding path program 4 times [2025-04-30 10:39:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:03,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726642039] [2025-04-30 10:39:03,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:39:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:03,253 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:39:03,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 43 statements. [2025-04-30 10:39:03,261 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:39:03,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:03,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:03,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726642039] [2025-04-30 10:39:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726642039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:03,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852742322] [2025-04-30 10:39:03,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:39:03,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:03,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:03,837 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:03,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-30 10:39:03,919 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:39:03,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 43 statements. [2025-04-30 10:39:03,941 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:39:03,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:03,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-30 10:39:03,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:03,954 INFO L354 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-04-30 10:39:03,972 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:39:03,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:39:04,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:04,110 INFO L325 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-04-30 10:39:04,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-04-30 10:39:04,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 57 treesize of output 29 [2025-04-30 10:39:04,200 INFO L354 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 15 treesize of output 1 [2025-04-30 10:39:04,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:04,309 INFO L325 Elim1Store]: treesize reduction 96, result has 35.1 percent of original size [2025-04-30 10:39:04,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2025-04-30 10:39:04,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:39:04,398 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-30 10:39:04,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 52 [2025-04-30 10:39:04,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:04,885 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:39:04,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2025-04-30 10:39:05,075 INFO L325 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-04-30 10:39:05,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 49 [2025-04-30 10:39:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:05,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:06,159 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~head~0#1.offset_118| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_114| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_115| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_133| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_133|) 0)) (< (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_133| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_133|) 0 |v_ULTIMATE.start_sll_create_~head~0#1.offset_118|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_115|) |v_ULTIMATE.start_sll_length_~head#1.offset_114|) (< |v_ULTIMATE.start_sll_create_~head~0#1.offset_118| |v_ULTIMATE.start_sll_length_~head#1.offset_115|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_115| 0) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_133| 1) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_133| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_133|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_115|))) |v_ULTIMATE.start_sll_length_~head#1.offset_114|)) 1) (< |v_ULTIMATE.start_sll_length_~head#1.offset_114| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_create_~head~0#1.offset_118|))) is different from false [2025-04-30 10:39:06,171 INFO L354 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 62 treesize of output 58 [2025-04-30 10:39:07,303 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:39:07,305 INFO L354 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 446 treesize of output 438 [2025-04-30 10:39:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 34 refuted. 2 times theorem prover too weak. 10 trivial. 3 not checked. [2025-04-30 10:39:12,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852742322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:12,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2025-04-30 10:39:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051302112] [2025-04-30 10:39:12,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:12,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-30 10:39:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:12,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-30 10:39:12,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2673, Unknown=2, NotChecked=104, Total=2970 [2025-04-30 10:39:12,097 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 55 states have internal predecessors, (91), 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-04-30 10:39:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:14,043 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2025-04-30 10:39:14,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:39:14,043 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 55 states have internal predecessors, (91), 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 43 [2025-04-30 10:39:14,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:14,043 INFO L225 Difference]: With dead ends: 107 [2025-04-30 10:39:14,043 INFO L226 Difference]: Without dead ends: 107 [2025-04-30 10:39:14,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=357, Invalid=4201, Unknown=2, NotChecked=132, Total=4692 [2025-04-30 10:39:14,045 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:14,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 920 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1474 Invalid, 0 Unknown, 42 Unchecked, 1.1s Time] [2025-04-30 10:39:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-30 10:39:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-04-30 10:39:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.175257731958763) internal successors, (114), 104 states have internal predecessors, (114), 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-04-30 10:39:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-04-30 10:39:14,047 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 43 [2025-04-30 10:39:14,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:14,047 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-04-30 10:39:14,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 55 states have internal predecessors, (91), 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-04-30 10:39:14,047 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-04-30 10:39:14,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:14,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:14,047 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:14,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:14,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-30 10:39:14,252 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-04-30 10:39:14,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 941203284, now seen corresponding path program 2 times [2025-04-30 10:39:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:14,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025536119] [2025-04-30 10:39:14,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:39:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:14,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:39:14,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:14,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:39:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:15,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025536119] [2025-04-30 10:39:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025536119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:15,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946573031] [2025-04-30 10:39:15,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:39:15,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:15,017 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:15,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-30 10:39:15,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:39:15,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:15,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:39:15,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-30 10:39:15,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:15,122 INFO L354 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-04-30 10:39:15,126 INFO L354 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-04-30 10:39:15,184 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:39:15,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:39:15,197 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:39:15,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:39:15,238 INFO L354 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 11 treesize of output 7 [2025-04-30 10:39:15,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:15,321 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:39:15,321 INFO L354 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 1 case distinctions, treesize of input 18 treesize of output 21 [2025-04-30 10:39:15,355 INFO L325 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-04-30 10:39:15,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-04-30 10:39:15,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-04-30 10:39:15,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 34 [2025-04-30 10:39:15,558 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-30 10:39:15,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-04-30 10:39:15,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,581 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-30 10:39:15,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-04-30 10:39:15,665 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-30 10:39:15,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 54 [2025-04-30 10:39:15,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-30 10:39:16,392 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:39:16,417 INFO L325 Elim1Store]: treesize reduction 73, result has 20.7 percent of original size [2025-04-30 10:39:16,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 76 [2025-04-30 10:39:16,437 INFO L325 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-04-30 10:39:16,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2025-04-30 10:39:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:16,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15