./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext-properties/test-0504_1.c --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-ext-properties/test-0504_1.c -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 87edddfd1c55541ca81e097067faf616fdc925f1b59ee9fc2df93613a98a9314 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:17:24,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:17:24,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:17:24,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:17:24,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:17:24,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:17:24,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:17:24,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:17:24,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:17:24,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:17:24,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:17:24,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:17:24,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:17:24,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:17:24,469 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:17:24,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:17:24,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:17:24,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:17:24,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:17:24,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:17:24,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:17:24,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:17:24,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:17:24,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:17:24,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:17:24,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:17:24,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:17:24,472 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 -> 87edddfd1c55541ca81e097067faf616fdc925f1b59ee9fc2df93613a98a9314 [2025-04-29 11:17:24,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:17:24,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:17:24,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:17:24,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:17:24,675 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:17:24,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1.c [2025-04-29 11:17:25,873 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509d5bee4/c9b02a967c264ab49225db5371ae9ad5/FLAGafa3700c4 [2025-04-29 11:17:26,075 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:17:26,076 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/test-0504_1.c [2025-04-29 11:17:26,077 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:17:26,077 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:17:26,083 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509d5bee4/c9b02a967c264ab49225db5371ae9ad5/FLAGafa3700c4 [2025-04-29 11:17:26,874 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509d5bee4/c9b02a967c264ab49225db5371ae9ad5 [2025-04-29 11:17:26,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:17:26,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:17:26,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:17:26,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:17:26,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:17:26,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:17:26" (1/1) ... [2025-04-29 11:17:26,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d992848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:26, skipping insertion in model container [2025-04-29 11:17:26,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:17:26" (1/1) ... [2025-04-29 11:17:26,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:17:27,051 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:17:27,060 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:17:27,089 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:17:27,099 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:17:27,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27 WrapperNode [2025-04-29 11:17:27,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:17:27,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:17:27,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:17:27,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:17:27,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,126 INFO L138 Inliner]: procedures = 12, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2025-04-29 11:17:27,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:17:27,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:17:27,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:17:27,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:17:27,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,155 INFO L175 MemorySlicer]: Split 18 memory accesses to 1 slices as follows [18]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 12 writes are split as follows [12]. [2025-04-29 11:17:27,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:17:27,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:17:27,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:17:27,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:17:27,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (1/1) ... [2025-04-29 11:17:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:17:27,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:27,199 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-29 11:17:27,202 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-29 11:17:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:17:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:17:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:17:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:17:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:17:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:17:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:17:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:17:27,271 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:17:27,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:17:27,510 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-04-29 11:17:27,510 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:17:27,518 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:17:27,518 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:17:27,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:17:27 BoogieIcfgContainer [2025-04-29 11:17:27,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:17:27,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:17:27,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:17:27,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:17:27,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:17:26" (1/3) ... [2025-04-29 11:17:27,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3a73b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:17:27, skipping insertion in model container [2025-04-29 11:17:27,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:17:27" (2/3) ... [2025-04-29 11:17:27,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3a73b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:17:27, skipping insertion in model container [2025-04-29 11:17:27,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:17:27" (3/3) ... [2025-04-29 11:17:27,524 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0504_1.c [2025-04-29 11:17:27,533 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:17:27,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0504_1.c that has 1 procedures, 97 locations, 108 edges, 1 initial locations, 4 loop locations, and 43 error locations. [2025-04-29 11:17:27,559 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:17:27,567 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;@394b0cfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:17:27,568 INFO L341 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-04-29 11:17:27,570 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 96 states have internal predecessors, (108), 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-29 11:17:27,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:17:27,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:27,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:17:27,573 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:27,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 28796107, now seen corresponding path program 1 times [2025-04-29 11:17:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:27,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124174095] [2025-04-29 11:17:27,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:27,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:17:27,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:17:27,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:27,650 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-29 11:17:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:27,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124174095] [2025-04-29 11:17:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124174095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085463010] [2025-04-29 11:17:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:27,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:17:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:27,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:17:27,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:17:27,669 INFO L87 Difference]: Start difference. First operand has 97 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 96 states have internal predecessors, (108), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-29 11:17:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:27,683 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-04-29 11:17:27,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:17:27,685 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-04-29 11:17:27,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:27,689 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:17:27,690 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:17:27,691 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-29 11:17:27,694 INFO L437 NwaCegarLoop]: 104 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, 104 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-29 11:17:27,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:17:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:17:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 94 states have internal predecessors, (102), 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-29 11:17:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-04-29 11:17:27,718 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 5 [2025-04-29 11:17:27,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:27,718 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-04-29 11:17:27,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-29 11:17:27,718 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-04-29 11:17:27,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:17:27,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:27,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:27,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:17:27,719 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:27,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1805897805, now seen corresponding path program 1 times [2025-04-29 11:17:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:27,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440505988] [2025-04-29 11:17:27,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:27,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:17:27,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:17:27,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:27,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:27,778 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-29 11:17:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:27,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440505988] [2025-04-29 11:17:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440505988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:27,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875943300] [2025-04-29 11:17:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:27,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:27,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:27,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:27,781 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-29 11:17:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:27,807 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-04-29 11:17:27,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:27,809 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-29 11:17:27,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:27,810 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:17:27,810 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:17:27,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:27,811 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:27,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 194 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:17:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-04-29 11:17:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 98 states have internal predecessors, (108), 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-29 11:17:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-04-29 11:17:27,817 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2025-04-29 11:17:27,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:27,817 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-04-29 11:17:27,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-29 11:17:27,818 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-04-29 11:17:27,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:17:27,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:27,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:27,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:17:27,819 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:27,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1805899149, now seen corresponding path program 1 times [2025-04-29 11:17:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:27,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937795062] [2025-04-29 11:17:27,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:27,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:17:27,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:17:27,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:27,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:27,840 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-29 11:17:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:27,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937795062] [2025-04-29 11:17:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937795062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:27,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:27,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762343647] [2025-04-29 11:17:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:27,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:27,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:27,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:27,841 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-29 11:17:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:27,912 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-04-29 11:17:27,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:27,913 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-29 11:17:27,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:27,914 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:17:27,914 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:17:27,915 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-29 11:17:27,915 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 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.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:27,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:17:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-04-29 11:17:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 97 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-29 11:17:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-04-29 11:17:27,922 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 7 [2025-04-29 11:17:27,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:27,922 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-04-29 11:17:27,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-29 11:17:27,922 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-04-29 11:17:27,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:17:27,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:27,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:27,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:17:27,922 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:27,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash 148105389, now seen corresponding path program 1 times [2025-04-29 11:17:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:27,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773133706] [2025-04-29 11:17:27,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:27,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:17:27,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:17:27,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,011 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-29 11:17:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773133706] [2025-04-29 11:17:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773133706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077882542] [2025-04-29 11:17:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:28,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:28,012 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-29 11:17:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:28,092 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-04-29 11:17:28,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:28,092 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-04-29 11:17:28,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:28,093 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:17:28,093 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:17:28,093 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-29 11:17:28,093 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:28,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 89 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:17:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-04-29 11:17:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 89 states have internal predecessors, (98), 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-29 11:17:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-04-29 11:17:28,097 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 8 [2025-04-29 11:17:28,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:28,097 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-04-29 11:17:28,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-29 11:17:28,097 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-04-29 11:17:28,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:17:28,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:28,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:28,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:17:28,098 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:28,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 148105390, now seen corresponding path program 1 times [2025-04-29 11:17:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:28,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011447418] [2025-04-29 11:17:28,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:28,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:17:28,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:17:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:28,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,172 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-29 11:17:28,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011447418] [2025-04-29 11:17:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011447418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265145245] [2025-04-29 11:17:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:28,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:28,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:28,174 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-29 11:17:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:28,227 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-04-29 11:17:28,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:28,227 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-04-29 11:17:28,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:28,229 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:17:28,229 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:17:28,229 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-29 11:17:28,229 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:28,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:17:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-04-29 11:17:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 91 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-29 11:17:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-04-29 11:17:28,236 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 8 [2025-04-29 11:17:28,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:28,236 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-04-29 11:17:28,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-29 11:17:28,236 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-04-29 11:17:28,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:28,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:28,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:28,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:17:28,237 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:28,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1321981186, now seen corresponding path program 1 times [2025-04-29 11:17:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:28,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513984266] [2025-04-29 11:17:28,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:28,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:28,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:28,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:17:28,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:28,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,443 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-29 11:17:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513984266] [2025-04-29 11:17:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513984266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:17:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248725869] [2025-04-29 11:17:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:28,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:28,445 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-29 11:17:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:28,530 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-04-29 11:17:28,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:17:28,531 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-04-29 11:17:28,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:28,531 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:17:28,531 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:17:28,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:28,532 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 40 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:28,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 153 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:17:28,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2025-04-29 11:17:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 81 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-29 11:17:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-04-29 11:17:28,535 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 19 [2025-04-29 11:17:28,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:28,536 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-04-29 11:17:28,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-29 11:17:28,536 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-04-29 11:17:28,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:17:28,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:28,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:28,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:17:28,536 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:28,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1322074528, now seen corresponding path program 1 times [2025-04-29 11:17:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:28,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808562672] [2025-04-29 11:17:28,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:28,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:28,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:17:28,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:17:28,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:28,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,586 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-29 11:17:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808562672] [2025-04-29 11:17:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808562672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783710222] [2025-04-29 11:17:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:28,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:28,588 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-29 11:17:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:28,596 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2025-04-29 11:17:28,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:28,597 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-04-29 11:17:28,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:28,597 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:17:28,597 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:17:28,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:28,598 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:28,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 163 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:17:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2025-04-29 11:17:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.5875) internal successors, (127), 106 states have internal predecessors, (127), 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-29 11:17:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2025-04-29 11:17:28,603 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 19 [2025-04-29 11:17:28,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:28,603 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2025-04-29 11:17:28,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-29 11:17:28,604 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2025-04-29 11:17:28,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:17:28,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:28,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:28,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:17:28,604 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:28,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:28,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1968256187, now seen corresponding path program 1 times [2025-04-29 11:17:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:28,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853326031] [2025-04-29 11:17:28,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:28,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:17:28,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:17:28,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:28,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,666 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-29 11:17:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853326031] [2025-04-29 11:17:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853326031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071646080] [2025-04-29 11:17:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:28,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:28,667 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-29 11:17:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:28,708 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2025-04-29 11:17:28,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:28,709 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-04-29 11:17:28,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:28,709 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:17:28,709 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:17:28,709 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-29 11:17:28,710 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:28,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:17:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-29 11:17:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.4875) internal successors, (119), 102 states have internal predecessors, (119), 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-29 11:17:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2025-04-29 11:17:28,712 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 20 [2025-04-29 11:17:28,712 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:28,713 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2025-04-29 11:17:28,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-29 11:17:28,713 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2025-04-29 11:17:28,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:17:28,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:28,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:28,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:17:28,713 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:28,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1968256186, now seen corresponding path program 1 times [2025-04-29 11:17:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:28,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622202467] [2025-04-29 11:17:28,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:28,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:17:28,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:17:28,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:28,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,773 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-29 11:17:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622202467] [2025-04-29 11:17:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622202467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:17:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417912138] [2025-04-29 11:17:28,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:17:28,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:17:28,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:17:28,774 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-29 11:17:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:28,807 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2025-04-29 11:17:28,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:17:28,808 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-04-29 11:17:28,808 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:28,808 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:17:28,808 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:17:28,808 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-29 11:17:28,809 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:28,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 115 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:17:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:17:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 98 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-29 11:17:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-04-29 11:17:28,811 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 20 [2025-04-29 11:17:28,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:28,812 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-04-29 11:17:28,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-29 11:17:28,812 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-04-29 11:17:28,812 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:17:28,812 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:28,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:28,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:17:28,812 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:28,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1426501177, now seen corresponding path program 1 times [2025-04-29 11:17:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:28,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184097802] [2025-04-29 11:17:28,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:28,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:17:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:17:28,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:28,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:28,991 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-29 11:17:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:28,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184097802] [2025-04-29 11:17:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184097802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648444190] [2025-04-29 11:17:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:28,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:28,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:28,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:17:28,992 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-29 11:17:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:29,102 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2025-04-29 11:17:29,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:17:29,102 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 23 [2025-04-29 11:17:29,102 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:29,103 INFO L225 Difference]: With dead ends: 137 [2025-04-29 11:17:29,103 INFO L226 Difference]: Without dead ends: 137 [2025-04-29 11:17:29,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:29,104 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:29,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 240 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-29 11:17:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2025-04-29 11:17:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.37) internal successors, (137), 118 states have internal predecessors, (137), 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-29 11:17:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2025-04-29 11:17:29,107 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 23 [2025-04-29 11:17:29,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:29,109 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2025-04-29 11:17:29,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-29 11:17:29,109 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2025-04-29 11:17:29,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:17:29,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:29,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:29,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:17:29,110 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:29,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1426501176, now seen corresponding path program 1 times [2025-04-29 11:17:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:29,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683656864] [2025-04-29 11:17:29,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:29,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:17:29,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:17:29,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:29,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:29,544 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-29 11:17:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:29,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683656864] [2025-04-29 11:17:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683656864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:17:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171721189] [2025-04-29 11:17:29,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:29,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:17:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:29,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:17:29,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:17:29,545 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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-29 11:17:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:29,801 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2025-04-29 11:17:29,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:29,801 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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 23 [2025-04-29 11:17:29,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:29,802 INFO L225 Difference]: With dead ends: 136 [2025-04-29 11:17:29,802 INFO L226 Difference]: Without dead ends: 136 [2025-04-29 11:17:29,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:17:29,803 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:29,803 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 298 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-29 11:17:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2025-04-29 11:17:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.35) internal successors, (135), 118 states have internal predecessors, (135), 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-29 11:17:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-04-29 11:17:29,806 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 23 [2025-04-29 11:17:29,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:29,806 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-04-29 11:17:29,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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-29 11:17:29,806 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-04-29 11:17:29,806 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:17:29,806 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:29,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:29,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:17:29,806 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:29,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2015810969, now seen corresponding path program 1 times [2025-04-29 11:17:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:29,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230159845] [2025-04-29 11:17:29,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:29,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:17:29,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:17:29,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:29,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:29,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230159845] [2025-04-29 11:17:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230159845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357590551] [2025-04-29 11:17:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:29,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:29,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:29,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:29,858 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-29 11:17:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:29,940 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-04-29 11:17:29,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:29,941 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 24 [2025-04-29 11:17:29,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:29,941 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:17:29,941 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:17:29,942 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-29 11:17:29,942 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:29,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:17:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2025-04-29 11:17:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 120 states have internal predecessors, (139), 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-29 11:17:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2025-04-29 11:17:29,946 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 24 [2025-04-29 11:17:29,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:29,946 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2025-04-29 11:17:29,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-29 11:17:29,947 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2025-04-29 11:17:29,947 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:17:29,947 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:29,947 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:29,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:17:29,948 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:29,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2015810968, now seen corresponding path program 1 times [2025-04-29 11:17:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:29,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322084815] [2025-04-29 11:17:29,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:29,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:17:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:17:29,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:30,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322084815] [2025-04-29 11:17:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322084815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:30,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:30,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:30,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011841327] [2025-04-29 11:17:30,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:30,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:30,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:30,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:30,055 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-29 11:17:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:30,133 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2025-04-29 11:17:30,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:30,133 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 24 [2025-04-29 11:17:30,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:30,134 INFO L225 Difference]: With dead ends: 157 [2025-04-29 11:17:30,134 INFO L226 Difference]: Without dead ends: 157 [2025-04-29 11:17:30,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-29 11:17:30,134 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:30,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 167 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-29 11:17:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2025-04-29 11:17:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.359375) internal successors, (174), 146 states have internal predecessors, (174), 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-29 11:17:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2025-04-29 11:17:30,139 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 24 [2025-04-29 11:17:30,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:30,139 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2025-04-29 11:17:30,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-29 11:17:30,139 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2025-04-29 11:17:30,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:17:30,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:30,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:30,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:17:30,141 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:30,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2015809625, now seen corresponding path program 1 times [2025-04-29 11:17:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:30,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048433204] [2025-04-29 11:17:30,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:30,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:17:30,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:17:30,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:30,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:30,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048433204] [2025-04-29 11:17:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048433204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:30,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092765316] [2025-04-29 11:17:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:30,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:30,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:30,194 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-29 11:17:30,195 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-29 11:17:30,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:17:30,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:17:30,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:30,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:30,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:17:30,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:30,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:17:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092765316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:17:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 11:17:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626118775] [2025-04-29 11:17:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:30,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:30,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:30,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:30,314 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-29 11:17:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:30,328 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2025-04-29 11:17:30,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:17:30,328 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 24 [2025-04-29 11:17:30,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:30,329 INFO L225 Difference]: With dead ends: 147 [2025-04-29 11:17:30,329 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:17:30,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-29 11:17:30,329 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 79 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:30,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 112 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:17:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-29 11:17:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.34375) internal successors, (172), 146 states have internal predecessors, (172), 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-29 11:17:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2025-04-29 11:17:30,333 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 24 [2025-04-29 11:17:30,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:30,333 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2025-04-29 11:17:30,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-29 11:17:30,333 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2025-04-29 11:17:30,334 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:17:30,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:30,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:30,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:17:30,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:17:30,537 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:30,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash -164087960, now seen corresponding path program 1 times [2025-04-29 11:17:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:30,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950488551] [2025-04-29 11:17:30,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:17:30,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:17:30,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:30,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:30,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950488551] [2025-04-29 11:17:30,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950488551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:30,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:30,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:17:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729969251] [2025-04-29 11:17:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:30,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:30,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:30,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:30,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:30,601 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-29 11:17:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:30,719 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2025-04-29 11:17:30,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:30,719 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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 26 [2025-04-29 11:17:30,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:30,720 INFO L225 Difference]: With dead ends: 172 [2025-04-29 11:17:30,720 INFO L226 Difference]: Without dead ends: 172 [2025-04-29 11:17:30,720 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:30,720 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 79 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:30,720 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-29 11:17:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2025-04-29 11:17:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.381294964028777) internal successors, (192), 157 states have internal predecessors, (192), 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-29 11:17:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2025-04-29 11:17:30,724 INFO L79 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 26 [2025-04-29 11:17:30,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:30,725 INFO L485 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2025-04-29 11:17:30,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-29 11:17:30,725 INFO L278 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2025-04-29 11:17:30,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:17:30,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:30,725 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:30,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:17:30,725 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:30,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -164087959, now seen corresponding path program 1 times [2025-04-29 11:17:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:30,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218792858] [2025-04-29 11:17:30,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:30,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:17:30,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:17:30,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:30,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:30,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218792858] [2025-04-29 11:17:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218792858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:17:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521825480] [2025-04-29 11:17:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:30,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:30,800 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-29 11:17:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:30,913 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2025-04-29 11:17:30,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:30,914 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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 26 [2025-04-29 11:17:30,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:30,915 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:17:30,915 INFO L226 Difference]: Without dead ends: 193 [2025-04-29 11:17:30,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:30,915 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:30,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 201 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-29 11:17:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2025-04-29 11:17:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.4276729559748427) internal successors, (227), 177 states have internal predecessors, (227), 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-29 11:17:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2025-04-29 11:17:30,919 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 227 transitions. Word has length 26 [2025-04-29 11:17:30,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:30,919 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 227 transitions. [2025-04-29 11:17:30,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-29 11:17:30,919 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2025-04-29 11:17:30,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:17:30,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:30,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:30,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:17:30,920 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:30,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -671544013, now seen corresponding path program 1 times [2025-04-29 11:17:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:30,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308669941] [2025-04-29 11:17:30,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:30,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:30,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:30,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:31,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:31,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308669941] [2025-04-29 11:17:31,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308669941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:31,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103137950] [2025-04-29 11:17:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:31,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:17:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:31,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:17:31,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:31,040 INFO L87 Difference]: Start difference. First operand 178 states and 227 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-29 11:17:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:31,210 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2025-04-29 11:17:31,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:17:31,210 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-29 11:17:31,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:31,211 INFO L225 Difference]: With dead ends: 214 [2025-04-29 11:17:31,211 INFO L226 Difference]: Without dead ends: 214 [2025-04-29 11:17:31,211 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:17:31,211 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:31,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 261 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-29 11:17:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2025-04-29 11:17:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 170 states have (on average 1.423529411764706) internal successors, (242), 188 states have internal predecessors, (242), 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-29 11:17:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2025-04-29 11:17:31,215 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 29 [2025-04-29 11:17:31,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:31,215 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2025-04-29 11:17:31,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-29 11:17:31,215 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2025-04-29 11:17:31,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:17:31,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:31,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:31,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:17:31,216 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:31,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash -671544012, now seen corresponding path program 1 times [2025-04-29 11:17:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:31,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931567954] [2025-04-29 11:17:31,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:31,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:17:31,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:17:31,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:31,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:31,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931567954] [2025-04-29 11:17:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931567954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:31,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:31,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035646049] [2025-04-29 11:17:31,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:31,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:31,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:31,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:31,402 INFO L87 Difference]: Start difference. First operand 189 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-29 11:17:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:31,524 INFO L93 Difference]: Finished difference Result 197 states and 248 transitions. [2025-04-29 11:17:31,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:31,524 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-29 11:17:31,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:31,525 INFO L225 Difference]: With dead ends: 197 [2025-04-29 11:17:31,525 INFO L226 Difference]: Without dead ends: 197 [2025-04-29 11:17:31,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:17:31,525 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:31,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 345 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-29 11:17:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2025-04-29 11:17:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 187 states have internal predecessors, (239), 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-29 11:17:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2025-04-29 11:17:31,532 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 29 [2025-04-29 11:17:31,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:31,532 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2025-04-29 11:17:31,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-29 11:17:31,532 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2025-04-29 11:17:31,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:17:31,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:31,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:31,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:17:31,533 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:31,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash 656994050, now seen corresponding path program 1 times [2025-04-29 11:17:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:31,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277361725] [2025-04-29 11:17:31,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:31,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:31,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:31,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:31,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277361725] [2025-04-29 11:17:31,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277361725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:17:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573479377] [2025-04-29 11:17:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:31,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:31,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:31,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:31,578 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-29 11:17:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:31,672 INFO L93 Difference]: Finished difference Result 219 states and 276 transitions. [2025-04-29 11:17:31,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:17:31,672 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-29 11:17:31,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:31,673 INFO L225 Difference]: With dead ends: 219 [2025-04-29 11:17:31,673 INFO L226 Difference]: Without dead ends: 219 [2025-04-29 11:17:31,673 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:31,673 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 78 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:31,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 268 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-29 11:17:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2025-04-29 11:17:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 189 states have (on average 1.4603174603174602) internal successors, (276), 207 states have internal predecessors, (276), 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-29 11:17:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 276 transitions. [2025-04-29 11:17:31,677 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 276 transitions. Word has length 30 [2025-04-29 11:17:31,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:31,677 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 276 transitions. [2025-04-29 11:17:31,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-29 11:17:31,678 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2025-04-29 11:17:31,678 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:17:31,678 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:31,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:31,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:17:31,679 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:31,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash 343955127, now seen corresponding path program 1 times [2025-04-29 11:17:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:31,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170308707] [2025-04-29 11:17:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:31,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:17:31,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:17:31,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:31,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170308707] [2025-04-29 11:17:31,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170308707] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:31,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888712205] [2025-04-29 11:17:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:31,719 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-29 11:17:31,721 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-29 11:17:31,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:17:31,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:17:31,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:31,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:31,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:17:31,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:31,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:31,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888712205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:31,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-29 11:17:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505717055] [2025-04-29 11:17:31,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:31,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:31,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:31,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:31,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:31,860 INFO L87 Difference]: Start difference. First operand 208 states and 276 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-29 11:17:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:31,882 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2025-04-29 11:17:31,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:17:31,882 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-29 11:17:31,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:31,883 INFO L225 Difference]: With dead ends: 265 [2025-04-29 11:17:31,883 INFO L226 Difference]: Without dead ends: 265 [2025-04-29 11:17:31,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:31,883 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:31,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 205 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-29 11:17:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2025-04-29 11:17:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 231 states have (on average 1.4805194805194806) internal successors, (342), 249 states have internal predecessors, (342), 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-29 11:17:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 342 transitions. [2025-04-29 11:17:31,890 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 342 transitions. Word has length 33 [2025-04-29 11:17:31,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:31,890 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 342 transitions. [2025-04-29 11:17:31,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-29 11:17:31,890 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 342 transitions. [2025-04-29 11:17:31,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:17:31,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:31,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:31,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:32,092 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,SelfDestructingSolverStorable19 [2025-04-29 11:17:32,092 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:32,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 343956471, now seen corresponding path program 1 times [2025-04-29 11:17:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:32,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879230924] [2025-04-29 11:17:32,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:32,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:17:32,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:17:32,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:32,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:32,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879230924] [2025-04-29 11:17:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879230924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:32,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393588967] [2025-04-29 11:17:32,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:32,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:32,173 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-29 11:17:32,175 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-29 11:17:32,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:17:32,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:17:32,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:32,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:32,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:17:32,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:32,296 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 13 treesize of output 9 [2025-04-29 11:17:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:32,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:32,360 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)))) is different from false [2025-04-29 11:17:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-29 11:17:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393588967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:32,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2025-04-29 11:17:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777253365] [2025-04-29 11:17:32,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:32,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:17:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:32,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:17:32,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-04-29 11:17:32,374 INFO L87 Difference]: Start difference. First operand 250 states and 342 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 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-29 11:17:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:32,511 INFO L93 Difference]: Finished difference Result 255 states and 346 transitions. [2025-04-29 11:17:32,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:32,512 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 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 33 [2025-04-29 11:17:32,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:32,513 INFO L225 Difference]: With dead ends: 255 [2025-04-29 11:17:32,513 INFO L226 Difference]: Without dead ends: 244 [2025-04-29 11:17:32,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2025-04-29 11:17:32,514 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:32,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 316 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2025-04-29 11:17:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-29 11:17:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2025-04-29 11:17:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 242 states have internal predecessors, (334), 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-29 11:17:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2025-04-29 11:17:32,518 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 33 [2025-04-29 11:17:32,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:32,518 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2025-04-29 11:17:32,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 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-29 11:17:32,518 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2025-04-29 11:17:32,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:17:32,519 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:32,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:32,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:32,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:32,723 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:32,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 219825338, now seen corresponding path program 1 times [2025-04-29 11:17:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:32,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388764589] [2025-04-29 11:17:32,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:32,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:17:32,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:17:32,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:32,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:32,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388764589] [2025-04-29 11:17:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388764589] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:32,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424550224] [2025-04-29 11:17:32,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:32,809 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-29 11:17:32,810 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-29 11:17:32,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:17:32,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:17:32,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:32,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:32,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:17:32,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:32,920 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-29 11:17:32,965 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:17:32,965 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-29 11:17:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:32,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424550224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:33,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-04-29 11:17:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393310234] [2025-04-29 11:17:33,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:33,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:17:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:33,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:17:33,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:33,134 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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-29 11:17:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:33,247 INFO L93 Difference]: Finished difference Result 264 states and 351 transitions. [2025-04-29 11:17:33,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:33,248 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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 36 [2025-04-29 11:17:33,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:33,248 INFO L225 Difference]: With dead ends: 264 [2025-04-29 11:17:33,249 INFO L226 Difference]: Without dead ends: 264 [2025-04-29 11:17:33,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:33,251 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 173 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:33,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 171 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-04-29 11:17:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 242. [2025-04-29 11:17:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 224 states have (on average 1.4821428571428572) internal successors, (332), 241 states have internal predecessors, (332), 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-29 11:17:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 332 transitions. [2025-04-29 11:17:33,255 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 332 transitions. Word has length 36 [2025-04-29 11:17:33,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:33,255 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 332 transitions. [2025-04-29 11:17:33,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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-29 11:17:33,255 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2025-04-29 11:17:33,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:17:33,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:33,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:33,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:33,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:33,456 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:33,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash 219825339, now seen corresponding path program 1 times [2025-04-29 11:17:33,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:33,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644042752] [2025-04-29 11:17:33,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:33,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:17:33,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:17:33,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:33,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:33,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:33,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644042752] [2025-04-29 11:17:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644042752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:33,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627531239] [2025-04-29 11:17:33,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:33,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:33,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:33,567 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-29 11:17:33,569 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-29 11:17:33,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:17:33,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:17:33,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:33,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:33,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:17:33,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:33,666 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-29 11:17:33,667 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-29 11:17:33,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:33,759 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-29 11:17:33,764 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:17:33,765 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-29 11:17:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:33,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627531239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:34,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-04-29 11:17:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264385948] [2025-04-29 11:17:34,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:34,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:17:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:17:34,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:17:34,096 INFO L87 Difference]: Start difference. First operand 242 states and 332 transitions. Second operand has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 10 states have internal predecessors, (98), 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-29 11:17:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:34,274 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2025-04-29 11:17:34,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:17:34,275 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 10 states have internal predecessors, (98), 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-29 11:17:34,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:34,276 INFO L225 Difference]: With dead ends: 263 [2025-04-29 11:17:34,276 INFO L226 Difference]: Without dead ends: 263 [2025-04-29 11:17:34,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:17:34,276 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 230 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:34,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 215 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-29 11:17:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2025-04-29 11:17:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 224 states have (on average 1.4732142857142858) internal successors, (330), 240 states have internal predecessors, (330), 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-29 11:17:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 330 transitions. [2025-04-29 11:17:34,281 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 330 transitions. Word has length 36 [2025-04-29 11:17:34,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:34,281 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 330 transitions. [2025-04-29 11:17:34,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.88888888888889) internal successors, (98), 10 states have internal predecessors, (98), 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-29 11:17:34,281 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 330 transitions. [2025-04-29 11:17:34,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:17:34,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:34,282 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, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:34,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:34,486 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,SelfDestructingSolverStorable22 [2025-04-29 11:17:34,486 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:34,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -882570338, now seen corresponding path program 1 times [2025-04-29 11:17:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:34,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260383042] [2025-04-29 11:17:34,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:34,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:17:34,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:17:34,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:34,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:34,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260383042] [2025-04-29 11:17:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260383042] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:34,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558972436] [2025-04-29 11:17:34,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:34,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:34,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:34,701 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-29 11:17:34,703 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-29 11:17:34,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:17:34,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:17:34,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:34,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:34,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:17:34,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:34,807 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-29 11:17:34,821 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-29 11:17:34,835 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:17:34,835 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 16 treesize of output 18 [2025-04-29 11:17:34,878 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:17:34,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 20 [2025-04-29 11:17:34,919 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:17:34,920 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 28 treesize of output 12 [2025-04-29 11:17:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:34,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558972436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:34,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2025-04-29 11:17:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556491556] [2025-04-29 11:17:34,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:34,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:17:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:34,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:17:34,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:17:34,972 INFO L87 Difference]: Start difference. First operand 241 states and 330 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 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-29 11:17:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:35,138 INFO L93 Difference]: Finished difference Result 240 states and 328 transitions. [2025-04-29 11:17:35,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:35,139 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 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 38 [2025-04-29 11:17:35,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:35,140 INFO L225 Difference]: With dead ends: 240 [2025-04-29 11:17:35,140 INFO L226 Difference]: Without dead ends: 240 [2025-04-29 11:17:35,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:17:35,140 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 21 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:35,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-04-29 11:17:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-04-29 11:17:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 224 states have (on average 1.4642857142857142) internal successors, (328), 239 states have internal predecessors, (328), 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-29 11:17:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 328 transitions. [2025-04-29 11:17:35,145 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 328 transitions. Word has length 38 [2025-04-29 11:17:35,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:35,145 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 328 transitions. [2025-04-29 11:17:35,146 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 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-29 11:17:35,146 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 328 transitions. [2025-04-29 11:17:35,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:17:35,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:35,146 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, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:35,152 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-29 11:17:35,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:35,347 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:35,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -882570337, now seen corresponding path program 1 times [2025-04-29 11:17:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:35,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111875822] [2025-04-29 11:17:35,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:35,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:17:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:17:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:35,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111875822] [2025-04-29 11:17:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111875822] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:35,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474207763] [2025-04-29 11:17:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:35,679 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-29 11:17:35,681 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-29 11:17:35,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:17:35,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:17:35,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:35,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:35,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:17:35,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:35,800 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-29 11:17:35,838 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-29 11:17:35,840 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-29 11:17:35,875 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:17:35,875 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 16 treesize of output 18 [2025-04-29 11:17:35,936 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:17:35,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 20 [2025-04-29 11:17:35,949 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:17:35,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2025-04-29 11:17:35,992 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:17:35,992 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 28 treesize of output 12 [2025-04-29 11:17:35,998 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:17:35,998 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 7 [2025-04-29 11:17:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:36,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:36,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474207763] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:36,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-29 11:17:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264576666] [2025-04-29 11:17:36,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:36,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:17:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:36,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:17:36,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:17:36,208 INFO L87 Difference]: Start difference. First operand 240 states and 328 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 21 states have internal predecessors, (82), 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-29 11:17:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:36,618 INFO L93 Difference]: Finished difference Result 248 states and 335 transitions. [2025-04-29 11:17:36,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:17:36,619 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 21 states have internal predecessors, (82), 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 38 [2025-04-29 11:17:36,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:36,620 INFO L225 Difference]: With dead ends: 248 [2025-04-29 11:17:36,620 INFO L226 Difference]: Without dead ends: 248 [2025-04-29 11:17:36,620 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:17:36,620 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:36,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 571 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-29 11:17:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2025-04-29 11:17:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 224 states have internal predecessors, (312), 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-29 11:17:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 312 transitions. [2025-04-29 11:17:36,624 INFO L79 Accepts]: Start accepts. Automaton has 225 states and 312 transitions. Word has length 38 [2025-04-29 11:17:36,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:36,624 INFO L485 AbstractCegarLoop]: Abstraction has 225 states and 312 transitions. [2025-04-29 11:17:36,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 21 states have internal predecessors, (82), 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-29 11:17:36,625 INFO L278 IsEmpty]: Start isEmpty. Operand 225 states and 312 transitions. [2025-04-29 11:17:36,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:17:36,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:36,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:36,631 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-29 11:17:36,829 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:36,829 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:36,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1961143153, now seen corresponding path program 1 times [2025-04-29 11:17:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:36,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163154552] [2025-04-29 11:17:36,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:36,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:17:36,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:17:36,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:36,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:37,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163154552] [2025-04-29 11:17:37,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163154552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:37,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228268808] [2025-04-29 11:17:37,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:37,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:37,186 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-29 11:17:37,187 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-29 11:17:37,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:17:37,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:17:37,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:37,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:37,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:17:37,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:37,299 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-29 11:17:37,301 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-29 11:17:37,324 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-29 11:17:37,333 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 23 treesize of output 11 [2025-04-29 11:17:37,345 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 23 treesize of output 11 [2025-04-29 11:17:37,388 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:17:37,389 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-29 11:17:37,400 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:17:37,401 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-29 11:17:37,434 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 23 treesize of output 18 [2025-04-29 11:17:37,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 11:17:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:37,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:37,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228268808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:37,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 4] total 15 [2025-04-29 11:17:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921053762] [2025-04-29 11:17:37,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:37,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:17:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:37,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:17:37,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:17:37,713 INFO L87 Difference]: Start difference. First operand 225 states and 312 transitions. Second operand has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 16 states have internal predecessors, (85), 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-29 11:17:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:37,985 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2025-04-29 11:17:37,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:17:37,986 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 16 states have internal predecessors, (85), 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-29 11:17:37,986 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:37,986 INFO L225 Difference]: With dead ends: 273 [2025-04-29 11:17:37,986 INFO L226 Difference]: Without dead ends: 273 [2025-04-29 11:17:37,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:17:37,987 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 81 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:37,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 364 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-04-29 11:17:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2025-04-29 11:17:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.456896551724138) internal successors, (338), 246 states have internal predecessors, (338), 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-29 11:17:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2025-04-29 11:17:37,994 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 39 [2025-04-29 11:17:37,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:37,995 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2025-04-29 11:17:37,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 16 states have internal predecessors, (85), 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-29 11:17:37,995 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2025-04-29 11:17:37,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:17:37,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:37,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:38,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:38,200 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,SelfDestructingSolverStorable25 [2025-04-29 11:17:38,200 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:38,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -832071118, now seen corresponding path program 1 times [2025-04-29 11:17:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:38,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254547788] [2025-04-29 11:17:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:38,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:17:38,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:17:38,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:38,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:38,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254547788] [2025-04-29 11:17:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254547788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:38,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711874093] [2025-04-29 11:17:38,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:38,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:38,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:38,500 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-29 11:17:38,502 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-29 11:17:38,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:17:38,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:17:38,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:38,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:38,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:17:38,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:38,630 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-29 11:17:38,642 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 11 [2025-04-29 11:17:38,647 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 11 [2025-04-29 11:17:38,709 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:17:38,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 18 [2025-04-29 11:17:38,733 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:17:38,733 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 19 treesize of output 7 [2025-04-29 11:17:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:38,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:38,803 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:38,804 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-29 11:17:38,891 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-29 11:17:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711874093] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:17:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 8] total 18 [2025-04-29 11:17:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549797925] [2025-04-29 11:17:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:38,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:17:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:38,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:17:38,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:17:38,892 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-29 11:17:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:38,979 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2025-04-29 11:17:38,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:17:38,980 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 41 [2025-04-29 11:17:38,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:38,981 INFO L225 Difference]: With dead ends: 247 [2025-04-29 11:17:38,981 INFO L226 Difference]: Without dead ends: 247 [2025-04-29 11:17:38,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:17:38,981 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 57 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:38,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 163 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-29 11:17:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-04-29 11:17:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.4482758620689655) internal successors, (336), 246 states have internal predecessors, (336), 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-29 11:17:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 336 transitions. [2025-04-29 11:17:38,986 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 336 transitions. Word has length 41 [2025-04-29 11:17:38,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:38,986 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 336 transitions. [2025-04-29 11:17:38,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-29 11:17:38,986 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 336 transitions. [2025-04-29 11:17:38,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:17:38,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:38,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:38,993 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-29 11:17:39,187 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,SelfDestructingSolverStorable26 [2025-04-29 11:17:39,188 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:39,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1974350711, now seen corresponding path program 1 times [2025-04-29 11:17:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:39,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512735529] [2025-04-29 11:17:39,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:39,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:17:39,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:17:39,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:39,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:39,236 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-29 11:17:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:39,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512735529] [2025-04-29 11:17:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512735529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:39,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:17:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724969515] [2025-04-29 11:17:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:39,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:39,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:39,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:39,238 INFO L87 Difference]: Start difference. First operand 247 states and 336 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 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-29 11:17:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:39,286 INFO L93 Difference]: Finished difference Result 255 states and 332 transitions. [2025-04-29 11:17:39,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:17:39,287 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 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) Word has length 44 [2025-04-29 11:17:39,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:39,288 INFO L225 Difference]: With dead ends: 255 [2025-04-29 11:17:39,288 INFO L226 Difference]: Without dead ends: 255 [2025-04-29 11:17:39,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:17:39,288 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:39,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 168 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-04-29 11:17:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2025-04-29 11:17:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 190 states have (on average 1.4210526315789473) internal successors, (270), 204 states have internal predecessors, (270), 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-29 11:17:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 270 transitions. [2025-04-29 11:17:39,292 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 270 transitions. Word has length 44 [2025-04-29 11:17:39,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:39,293 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 270 transitions. [2025-04-29 11:17:39,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 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-29 11:17:39,293 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2025-04-29 11:17:39,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:17:39,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:39,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:39,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:17:39,294 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:39,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1974351414, now seen corresponding path program 1 times [2025-04-29 11:17:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:39,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204819999] [2025-04-29 11:17:39,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:39,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:39,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:17:39,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:17:39,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:39,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:39,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204819999] [2025-04-29 11:17:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204819999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268706605] [2025-04-29 11:17:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:39,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:17:39,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:39,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:17:39,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:39,408 INFO L87 Difference]: Start difference. First operand 205 states and 270 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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-29 11:17:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:39,560 INFO L93 Difference]: Finished difference Result 241 states and 317 transitions. [2025-04-29 11:17:39,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:17:39,561 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-29 11:17:39,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:39,561 INFO L225 Difference]: With dead ends: 241 [2025-04-29 11:17:39,561 INFO L226 Difference]: Without dead ends: 241 [2025-04-29 11:17:39,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:17:39,562 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:39,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-29 11:17:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2025-04-29 11:17:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 203 states have (on average 1.4236453201970443) internal successors, (289), 217 states have internal predecessors, (289), 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-29 11:17:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2025-04-29 11:17:39,570 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 44 [2025-04-29 11:17:39,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:39,571 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2025-04-29 11:17:39,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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-29 11:17:39,571 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2025-04-29 11:17:39,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:17:39,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:39,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:39,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:17:39,571 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:39,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1974351413, now seen corresponding path program 1 times [2025-04-29 11:17:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:39,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097391854] [2025-04-29 11:17:39,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:39,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:17:39,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:17:39,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:39,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:39,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097391854] [2025-04-29 11:17:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097391854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:17:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121750444] [2025-04-29 11:17:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:39,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:17:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:39,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:17:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:39,811 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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-29 11:17:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:39,992 INFO L93 Difference]: Finished difference Result 254 states and 331 transitions. [2025-04-29 11:17:39,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:17:39,992 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-29 11:17:39,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:39,993 INFO L225 Difference]: With dead ends: 254 [2025-04-29 11:17:39,993 INFO L226 Difference]: Without dead ends: 254 [2025-04-29 11:17:39,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:17:39,994 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 32 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:39,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 373 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-29 11:17:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 218. [2025-04-29 11:17:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 203 states have (on average 1.4137931034482758) internal successors, (287), 217 states have internal predecessors, (287), 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-29 11:17:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 287 transitions. [2025-04-29 11:17:39,998 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 287 transitions. Word has length 44 [2025-04-29 11:17:39,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:39,998 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 287 transitions. [2025-04-29 11:17:39,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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-29 11:17:39,998 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 287 transitions. [2025-04-29 11:17:39,999 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:17:39,999 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:39,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:39,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:17:39,999 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:39,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1023839115, now seen corresponding path program 1 times [2025-04-29 11:17:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:39,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375654700] [2025-04-29 11:17:40,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:40,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:17:40,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:17:40,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:40,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:17:40,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:40,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375654700] [2025-04-29 11:17:40,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375654700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:40,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:40,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:17:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038835436] [2025-04-29 11:17:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:40,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:17:40,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:40,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:17:40,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:40,044 INFO L87 Difference]: Start difference. First operand 218 states and 287 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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-29 11:17:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:40,092 INFO L93 Difference]: Finished difference Result 219 states and 281 transitions. [2025-04-29 11:17:40,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:17:40,093 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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) Word has length 46 [2025-04-29 11:17:40,093 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:40,094 INFO L225 Difference]: With dead ends: 219 [2025-04-29 11:17:40,094 INFO L226 Difference]: Without dead ends: 219 [2025-04-29 11:17:40,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:17:40,094 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:40,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-29 11:17:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-04-29 11:17:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 215 states have internal predecessors, (278), 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-29 11:17:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2025-04-29 11:17:40,097 INFO L79 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 46 [2025-04-29 11:17:40,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:40,098 INFO L485 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2025-04-29 11:17:40,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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-29 11:17:40,098 INFO L278 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2025-04-29 11:17:40,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:17:40,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:40,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:40,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:17:40,099 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:40,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1023839116, now seen corresponding path program 1 times [2025-04-29 11:17:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:40,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384175674] [2025-04-29 11:17:40,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:40,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:17:40,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:17:40,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:40,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:40,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384175674] [2025-04-29 11:17:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384175674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:17:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574131932] [2025-04-29 11:17:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:40,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:17:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:40,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:17:40,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:17:40,334 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 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-29 11:17:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:40,570 INFO L93 Difference]: Finished difference Result 260 states and 333 transitions. [2025-04-29 11:17:40,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:17:40,571 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 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) Word has length 46 [2025-04-29 11:17:40,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:40,571 INFO L225 Difference]: With dead ends: 260 [2025-04-29 11:17:40,571 INFO L226 Difference]: Without dead ends: 260 [2025-04-29 11:17:40,572 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:17:40,572 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:40,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 402 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:17:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-29 11:17:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 220. [2025-04-29 11:17:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 219 states have internal predecessors, (282), 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-29 11:17:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 282 transitions. [2025-04-29 11:17:40,580 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 282 transitions. Word has length 46 [2025-04-29 11:17:40,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:40,580 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 282 transitions. [2025-04-29 11:17:40,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 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-29 11:17:40,580 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 282 transitions. [2025-04-29 11:17:40,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:17:40,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:40,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:40,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:17:40,581 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:40,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1013642510, now seen corresponding path program 1 times [2025-04-29 11:17:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:40,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354970109] [2025-04-29 11:17:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:40,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:17:40,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:17:40,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:40,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:40,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354970109] [2025-04-29 11:17:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354970109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:40,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185344202] [2025-04-29 11:17:40,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:40,709 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-29 11:17:40,711 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-29 11:17:40,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:17:40,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:17:40,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:40,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:17:40,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:40,850 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-29 11:17:40,887 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:17:40,888 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-29 11:17:40,921 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-29 11:17:40,964 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:40,964 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-29 11:17:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:41,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:41,083 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-29 11:17:41,085 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-29 11:17:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185344202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:41,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-04-29 11:17:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154586197] [2025-04-29 11:17:41,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:41,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:17:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:41,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:17:41,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:17:41,168 INFO L87 Difference]: Start difference. First operand 220 states and 282 transitions. Second operand has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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-29 11:17:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:41,530 INFO L93 Difference]: Finished difference Result 274 states and 342 transitions. [2025-04-29 11:17:41,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:17:41,531 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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 48 [2025-04-29 11:17:41,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:41,531 INFO L225 Difference]: With dead ends: 274 [2025-04-29 11:17:41,531 INFO L226 Difference]: Without dead ends: 274 [2025-04-29 11:17:41,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:17:41,532 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:41,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 649 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:17:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-29 11:17:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2025-04-29 11:17:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 219 states have internal predecessors, (280), 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-29 11:17:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2025-04-29 11:17:41,536 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 48 [2025-04-29 11:17:41,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:41,536 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2025-04-29 11:17:41,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 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-29 11:17:41,536 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2025-04-29 11:17:41,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:17:41,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:41,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:41,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:17:41,738 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,SelfDestructingSolverStorable32 [2025-04-29 11:17:41,739 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:41,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 361882059, now seen corresponding path program 1 times [2025-04-29 11:17:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:41,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927472873] [2025-04-29 11:17:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:41,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:17:41,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:17:41,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:41,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:41,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927472873] [2025-04-29 11:17:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927472873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:41,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:17:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338596574] [2025-04-29 11:17:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:41,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:17:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:41,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:17:41,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:17:41,906 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 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-29 11:17:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:42,069 INFO L93 Difference]: Finished difference Result 262 states and 331 transitions. [2025-04-29 11:17:42,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:17:42,070 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 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) Word has length 48 [2025-04-29 11:17:42,070 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:42,071 INFO L225 Difference]: With dead ends: 262 [2025-04-29 11:17:42,071 INFO L226 Difference]: Without dead ends: 262 [2025-04-29 11:17:42,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:17:42,071 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:42,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 524 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-04-29 11:17:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 224. [2025-04-29 11:17:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 223 states have internal predecessors, (286), 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-29 11:17:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2025-04-29 11:17:42,079 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 48 [2025-04-29 11:17:42,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:42,079 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2025-04-29 11:17:42,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 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-29 11:17:42,079 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2025-04-29 11:17:42,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:17:42,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:42,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:42,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:17:42,080 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:42,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1666557891, now seen corresponding path program 1 times [2025-04-29 11:17:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:42,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748337657] [2025-04-29 11:17:42,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:42,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:17:42,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:17:42,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:42,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:42,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748337657] [2025-04-29 11:17:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748337657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:42,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:17:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958447725] [2025-04-29 11:17:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:42,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:17:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:42,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:17:42,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:17:42,219 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 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-29 11:17:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:42,407 INFO L93 Difference]: Finished difference Result 262 states and 331 transitions. [2025-04-29 11:17:42,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:17:42,407 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 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) Word has length 49 [2025-04-29 11:17:42,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:42,408 INFO L225 Difference]: With dead ends: 262 [2025-04-29 11:17:42,408 INFO L226 Difference]: Without dead ends: 262 [2025-04-29 11:17:42,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:17:42,410 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:42,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 466 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-04-29 11:17:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2025-04-29 11:17:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 213 states have (on average 1.352112676056338) internal successors, (288), 225 states have internal predecessors, (288), 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-29 11:17:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 288 transitions. [2025-04-29 11:17:42,414 INFO L79 Accepts]: Start accepts. Automaton has 226 states and 288 transitions. Word has length 49 [2025-04-29 11:17:42,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:42,414 INFO L485 AbstractCegarLoop]: Abstraction has 226 states and 288 transitions. [2025-04-29 11:17:42,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 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-29 11:17:42,414 INFO L278 IsEmpty]: Start isEmpty. Operand 226 states and 288 transitions. [2025-04-29 11:17:42,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:17:42,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:42,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:42,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:17:42,416 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:42,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1388670552, now seen corresponding path program 1 times [2025-04-29 11:17:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:42,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634155637] [2025-04-29 11:17:42,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:42,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:17:42,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:17:42,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:42,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:42,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634155637] [2025-04-29 11:17:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634155637] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:42,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61036265] [2025-04-29 11:17:42,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:42,733 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-29 11:17:42,735 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-29 11:17:42,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:17:42,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:17:42,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:42,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:42,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:17:42,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:42,886 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-29 11:17:42,900 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-29 11:17:42,902 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-29 11:17:42,923 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 19 treesize of output 18 [2025-04-29 11:17:42,928 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 23 treesize of output 11 [2025-04-29 11:17:42,954 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 30 treesize of output 21 [2025-04-29 11:17:42,970 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 23 treesize of output 11 [2025-04-29 11:17:43,092 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:17:43,092 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-29 11:17:43,134 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 16 treesize of output 11 [2025-04-29 11:17:43,138 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 23 treesize of output 16 [2025-04-29 11:17:43,149 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 16 treesize of output 11 [2025-04-29 11:17:43,155 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 23 treesize of output 16 [2025-04-29 11:17:43,167 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 16 treesize of output 11 [2025-04-29 11:17:43,175 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 23 treesize of output 16 [2025-04-29 11:17:43,186 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 16 treesize of output 11 [2025-04-29 11:17:43,192 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 23 treesize of output 16 [2025-04-29 11:17:43,205 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 23 treesize of output 16 [2025-04-29 11:17:43,210 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 16 treesize of output 11 [2025-04-29 11:17:43,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:43,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:17:43,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:43,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:43,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-04-29 11:17:43,320 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 16 treesize of output 11 [2025-04-29 11:17:43,324 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 23 treesize of output 16 [2025-04-29 11:17:43,394 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:43,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:17:43,403 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-29 11:17:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:43,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:52,259 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_61| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2227 Int) (v_ArrVal_2215 Int) (v_ArrVal_2231 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_19| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_61|) 0)) (< |v_ULTIMATE.start_main_~last~0#1.offset_19| |c_ULTIMATE.start_main_~x~0#1.offset|) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1 v_ArrVal_2215)) |v_ULTIMATE.start_main_~x~0#1.base_61| v_ArrVal_2226) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_19| 12) v_ArrVal_2227)) |v_ULTIMATE.start_main_~x~0#1.base_61| v_ArrVal_2231) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_61| Int) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_19| Int) (v_ArrVal_2228 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_61|) 0)) (< |v_ULTIMATE.start_main_~last~0#1.offset_19| |c_ULTIMATE.start_main_~x~0#1.offset|) (not (= v_ArrVal_2214 (store (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_2214 .cse0)) .cse1 (select v_ArrVal_2214 .cse1)))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2214) |v_ULTIMATE.start_main_~x~0#1.base_61| v_ArrVal_2225) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_19| 12) v_ArrVal_2228)) |v_ULTIMATE.start_main_~x~0#1.base_61| v_ArrVal_2232) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2025-04-29 11:17:52,268 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 72 treesize of output 70 [2025-04-29 11:17:52,274 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:17:52,276 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 5 treesize of output 3 [2025-04-29 11:17:52,280 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:17:52,283 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-29 11:17:52,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 1 [2025-04-29 11:17:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-29 11:17:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61036265] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:52,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 34 [2025-04-29 11:17:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140589335] [2025-04-29 11:17:52,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:52,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:17:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:52,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:17:52,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=917, Unknown=27, NotChecked=62, Total=1122 [2025-04-29 11:17:52,316 INFO L87 Difference]: Start difference. First operand 226 states and 288 transitions. Second operand has 34 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 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-29 11:17:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:53,296 INFO L93 Difference]: Finished difference Result 286 states and 356 transitions. [2025-04-29 11:17:53,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:17:53,296 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 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 49 [2025-04-29 11:17:53,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:53,297 INFO L225 Difference]: With dead ends: 286 [2025-04-29 11:17:53,297 INFO L226 Difference]: Without dead ends: 286 [2025-04-29 11:17:53,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=288, Invalid=1669, Unknown=27, NotChecked=86, Total=2070 [2025-04-29 11:17:53,298 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 159 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:53,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 981 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 873 Invalid, 0 Unknown, 122 Unchecked, 0.6s Time] [2025-04-29 11:17:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-04-29 11:17:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 246. [2025-04-29 11:17:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 233 states have (on average 1.3433476394849786) internal successors, (313), 245 states have internal predecessors, (313), 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-29 11:17:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 313 transitions. [2025-04-29 11:17:53,301 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 313 transitions. Word has length 49 [2025-04-29 11:17:53,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:53,301 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 313 transitions. [2025-04-29 11:17:53,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 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-29 11:17:53,302 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 313 transitions. [2025-04-29 11:17:53,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:17:53,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:53,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:53,309 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-29 11:17:53,502 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,SelfDestructingSolverStorable35 [2025-04-29 11:17:53,503 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:53,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash -123441330, now seen corresponding path program 1 times [2025-04-29 11:17:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:53,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987671047] [2025-04-29 11:17:53,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:17:53,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:17:53,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:53,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:53,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987671047] [2025-04-29 11:17:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987671047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:53,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790875642] [2025-04-29 11:17:53,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:53,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:53,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:53,973 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-29 11:17:53,974 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-29 11:17:54,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:17:54,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:17:54,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:54,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:54,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-04-29 11:17:54,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:54,134 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-29 11:17:54,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:17:54,155 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 19 treesize of output 18 [2025-04-29 11:17:54,160 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 23 treesize of output 11 [2025-04-29 11:17:54,186 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 23 treesize of output 11 [2025-04-29 11:17:54,192 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 30 treesize of output 21 [2025-04-29 11:17:54,287 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:17:54,287 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:17:54,302 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:17:54,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 18 [2025-04-29 11:17:54,414 INFO L325 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2025-04-29 11:17:54,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2025-04-29 11:17:54,433 INFO L325 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2025-04-29 11:17:54,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 37 [2025-04-29 11:17:54,443 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 13 treesize of output 9 [2025-04-29 11:17:54,457 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 11 treesize of output 7 [2025-04-29 11:17:54,498 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 31 treesize of output 30 [2025-04-29 11:17:54,502 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 31 treesize of output 30 [2025-04-29 11:17:54,547 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-29 11:17:54,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:54,552 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 1 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:17:54,580 INFO L325 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-04-29 11:17:54,580 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2025-04-29 11:17:54,593 INFO L325 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-04-29 11:17:54,593 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 56 [2025-04-29 11:17:55,000 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:17:55,000 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 31 [2025-04-29 11:17:55,004 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:17:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:55,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:33,271 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_2368 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2373 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2368)) (.cse1 (select v_ArrVal_2368 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse1))) (store (store (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_main_~y~0#1.base| .cse0) .cse1 v_ArrVal_2373) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse2 |ULTIMATE.start_main_~y~0#1.base| .cse0) .cse1 v_ArrVal_2373) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= v_ArrVal_2368 (store .cse3 .cse4 (select v_ArrVal_2368 .cse4)))))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse4 v_ArrVal_2369)))) (let ((.cse5 (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse8 |c_ULTIMATE.start_main_~x~0#1.offset|))) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_main_~y~0#1.base| .cse5) .cse6 v_ArrVal_2374) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse7 |ULTIMATE.start_main_~y~0#1.base| .cse5) .cse6 v_ArrVal_2374) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0))))) |ULTIMATE.start_main_~y~0#1.base|) 0))))) is different from false [2025-04-29 11:18:33,303 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_2368 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2373 (Array Int Int))) (or (not (= v_ArrVal_2368 (store (store .cse0 .cse1 (select v_ArrVal_2368 .cse1)) .cse2 (select v_ArrVal_2368 .cse2)))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2368)) (.cse4 (select v_ArrVal_2368 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse4))) (store (store (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_main_~y~0#1.base| .cse3) .cse4 v_ArrVal_2373) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse5 |ULTIMATE.start_main_~y~0#1.base| .cse3) .cse4 v_ArrVal_2373) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse9 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse9 .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse2 v_ArrVal_2369)))) (let ((.cse6 (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|))) (.cse7 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_main_~y~0#1.base| .cse6) .cse7 v_ArrVal_2374) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse8 |ULTIMATE.start_main_~y~0#1.base| .cse6) .cse7 v_ArrVal_2374) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0))))) |ULTIMATE.start_main_~y~0#1.base|) 0))))) is different from false [2025-04-29 11:18:33,313 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 54 treesize of output 50 [2025-04-29 11:18:33,319 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-29 11:18:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790875642] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:33,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 49 [2025-04-29 11:18:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433637901] [2025-04-29 11:18:33,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:33,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-29 11:18:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:33,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-29 11:18:33,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1874, Unknown=108, NotChecked=182, Total=2352 [2025-04-29 11:18:33,330 INFO L87 Difference]: Start difference. First operand 246 states and 313 transitions. Second operand has 49 states, 49 states have (on average 2.673469387755102) internal successors, (131), 49 states have internal predecessors, (131), 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) Killed by 15