./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:06:17,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:06:17,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:06:17,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:06:17,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:06:17,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:06:17,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:06:17,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:06:17,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:06:17,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:06:17,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:06:17,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:06:17,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:06:17,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:06:17,236 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:06:17,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:06:17,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:06:17,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:06:17,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:06:17,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:06:17,243 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:06:17,244 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:06:17,244 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:06:17,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:06:17,244 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:06:17,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:06:17,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:06:17,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:06:17,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:06:17,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:06:17,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:06:17,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:06:17,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:06:17,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:06:17,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:06:17,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:06:17,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:06:17,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:06:17,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:06:17,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:06:17,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:06:17,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:06:17,252 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2024-11-09 08:06:17,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:06:17,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:06:17,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:06:17,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:06:17,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:06:17,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2024-11-09 08:06:19,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:06:19,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:06:19,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2024-11-09 08:06:19,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b220a5601/f10baca4e107483ca7a5f7e5cee69c5a/FLAGe26105321 [2024-11-09 08:06:19,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b220a5601/f10baca4e107483ca7a5f7e5cee69c5a [2024-11-09 08:06:19,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:06:19,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:06:19,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:06:19,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:06:19,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:06:19,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:06:19" (1/1) ... [2024-11-09 08:06:19,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596704b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:19, skipping insertion in model container [2024-11-09 08:06:19,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:06:19" (1/1) ... [2024-11-09 08:06:19,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:06:20,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:06:20,130 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:06:20,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:06:20,203 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:06:20,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20 WrapperNode [2024-11-09 08:06:20,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:06:20,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:06:20,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:06:20,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:06:20,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,245 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-09 08:06:20,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:06:20,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:06:20,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:06:20,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:06:20,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,294 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-09 08:06:20,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:06:20,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:06:20,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:06:20,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:06:20,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:06:20,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:20,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:06:20,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:06:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 08:06:20,444 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:06:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:06:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:06:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:06:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:06:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:06:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:06:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:06:20,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:06:20,616 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:06:20,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:06:20,644 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 08:06:20,881 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-09 08:06:20,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:06:20,896 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:06:20,896 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 08:06:20,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:06:20 BoogieIcfgContainer [2024-11-09 08:06:20,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:06:20,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:06:20,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:06:20,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:06:20,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:06:19" (1/3) ... [2024-11-09 08:06:20,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fa5eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:06:20, skipping insertion in model container [2024-11-09 08:06:20,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (2/3) ... [2024-11-09 08:06:20,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fa5eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:06:20, skipping insertion in model container [2024-11-09 08:06:20,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:06:20" (3/3) ... [2024-11-09 08:06:20,908 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2024-11-09 08:06:20,925 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:06:20,926 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-11-09 08:06:20,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:06:20,984 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e55b554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:06:20,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-09 08:06:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 71 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:06:20,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:20,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:06:20,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-09 08:06:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241951175] [2024-11-09 08:06:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241951175] [2024-11-09 08:06:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241951175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72651598] [2024-11-09 08:06:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,286 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 71 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,390 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-09 08:06:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:06:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,400 INFO L225 Difference]: With dead ends: 69 [2024-11-09 08:06:21,400 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 08:06:21,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,406 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 08:06:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 08:06:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.763157894736842) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-09 08:06:21,443 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 4 [2024-11-09 08:06:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,443 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-09 08:06:21,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-09 08:06:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:06:21,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:06:21,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:06:21,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:21,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-09 08:06:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937692844] [2024-11-09 08:06:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937692844] [2024-11-09 08:06:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937692844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014210854] [2024-11-09 08:06:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,594 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,658 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-09 08:06:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:06:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,661 INFO L225 Difference]: With dead ends: 60 [2024-11-09 08:06:21,661 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 08:06:21,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,662 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 08:06:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 08:06:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-09 08:06:21,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 4 [2024-11-09 08:06:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,670 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-09 08:06:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-09 08:06:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:06:21,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:21,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:06:21,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:21,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2024-11-09 08:06:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639944262] [2024-11-09 08:06:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639944262] [2024-11-09 08:06:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639944262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870008206] [2024-11-09 08:06:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,814 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,884 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-09 08:06:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:21,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:06:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,886 INFO L225 Difference]: With dead ends: 58 [2024-11-09 08:06:21,886 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 08:06:21,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,887 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 08:06:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 08:06:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.631578947368421) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-11-09 08:06:21,900 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 9 [2024-11-09 08:06:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,900 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-09 08:06:21,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-11-09 08:06:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:06:21,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:21,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:06:21,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2024-11-09 08:06:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468697585] [2024-11-09 08:06:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468697585] [2024-11-09 08:06:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468697585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:22,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:22,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89926442] [2024-11-09 08:06:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:22,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:22,076 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:22,128 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-09 08:06:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:22,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:06:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:22,129 INFO L225 Difference]: With dead ends: 56 [2024-11-09 08:06:22,129 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 08:06:22,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:22,131 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:22,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 08:06:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 08:06:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-11-09 08:06:22,142 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2024-11-09 08:06:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:22,143 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-11-09 08:06:22,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-11-09 08:06:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 08:06:22,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:22,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:22,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:06:22,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:22,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:22,147 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2024-11-09 08:06:22,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:22,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247745113] [2024-11-09 08:06:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247745113] [2024-11-09 08:06:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247745113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:22,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:22,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:06:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671834353] [2024-11-09 08:06:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:22,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:22,236 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:22,249 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-11-09 08:06:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:22,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 08:06:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:22,252 INFO L225 Difference]: With dead ends: 61 [2024-11-09 08:06:22,252 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 08:06:22,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:22,253 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:22,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 08:06:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-09 08:06:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.564102564102564) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-09 08:06:22,263 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2024-11-09 08:06:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:22,264 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-09 08:06:22,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-09 08:06:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:06:22,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:22,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:06:22,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2024-11-09 08:06:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753194474] [2024-11-09 08:06:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753194474] [2024-11-09 08:06:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753194474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30904775] [2024-11-09 08:06:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:22,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:22,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:22,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:06:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:06:22,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30904775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:22,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:22,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 08:06:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822305880] [2024-11-09 08:06:22,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:06:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:22,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:06:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:22,641 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:22,670 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-09 08:06:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:06:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 08:06:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:22,672 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:06:22,672 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 08:06:22,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:22,673 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:22,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 214 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 08:06:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 08:06:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-09 08:06:22,678 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2024-11-09 08:06:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:22,678 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-09 08:06:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-09 08:06:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:06:22,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:22,684 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:22,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 08:06:22,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 08:06:22,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:22,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2024-11-09 08:06:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:22,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605739223] [2024-11-09 08:06:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 08:06:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605739223] [2024-11-09 08:06:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605739223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:23,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:06:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944697799] [2024-11-09 08:06:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:06:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:23,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:06:23,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:06:23,057 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2024-11-09 08:06:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:23,201 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-09 08:06:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:06:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 31 [2024-11-09 08:06:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:23,203 INFO L225 Difference]: With dead ends: 69 [2024-11-09 08:06:23,203 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 08:06:23,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:23,205 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:23,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 08:06:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 08:06:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-09 08:06:23,210 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 31 [2024-11-09 08:06:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:23,210 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-09 08:06:23,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2024-11-09 08:06:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-09 08:06:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:06:23,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:23,212 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:06:23,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2024-11-09 08:06:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140944405] [2024-11-09 08:06:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:23,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140944405] [2024-11-09 08:06:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140944405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:23,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:06:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786897838] [2024-11-09 08:06:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:06:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:06:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:06:23,489 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:23,608 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-09 08:06:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:06:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 08:06:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:23,609 INFO L225 Difference]: With dead ends: 76 [2024-11-09 08:06:23,609 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 08:06:23,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:23,610 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:23,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 08:06:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-11-09 08:06:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-09 08:06:23,619 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 31 [2024-11-09 08:06:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:23,619 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-09 08:06:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-09 08:06:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:06:23,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:23,620 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:23,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:06:23,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash -453739556, now seen corresponding path program 1 times [2024-11-09 08:06:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46169990] [2024-11-09 08:06:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:24,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46169990] [2024-11-09 08:06:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46169990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067940217] [2024-11-09 08:06:24,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:24,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:24,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:24,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:24,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:06:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:24,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 08:06:24,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:24,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:06:24,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:24,927 INFO L378 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 25 treesize of output 13 [2024-11-09 08:06:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:25,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067940217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:25,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-09 08:06:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2177807] [2024-11-09 08:06:25,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 08:06:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 08:06:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-11-09 08:06:25,452 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:25,791 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-09 08:06:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:06:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 08:06:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:25,792 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:06:25,792 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 08:06:25,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 08:06:25,793 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:25,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 489 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 08:06:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 08:06:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-09 08:06:25,797 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 35 [2024-11-09 08:06:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:25,798 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-09 08:06:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-09 08:06:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:06:25,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:25,799 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:25,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 08:06:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 08:06:26,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:26,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2024-11-09 08:06:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502246478] [2024-11-09 08:06:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502246478] [2024-11-09 08:06:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502246478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102670354] [2024-11-09 08:06:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:26,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:26,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:26,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:06:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:26,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 08:06:26,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:26,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:06:26,976 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:26,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:06:27,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:27,016 INFO L378 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 33 treesize of output 17 [2024-11-09 08:06:27,084 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 08:06:27,085 INFO L378 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 29 treesize of output 28 [2024-11-09 08:06:27,276 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:27,277 INFO L378 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 41 treesize of output 28 [2024-11-09 08:06:27,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:27,298 INFO L378 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 33 treesize of output 25 [2024-11-09 08:06:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:27,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102670354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:27,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2024-11-09 08:06:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129090435] [2024-11-09 08:06:27,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:27,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 08:06:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 08:06:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2024-11-09 08:06:27,572 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:28,117 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2024-11-09 08:06:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 08:06:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 08:06:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:28,118 INFO L225 Difference]: With dead ends: 77 [2024-11-09 08:06:28,118 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 08:06:28,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2024-11-09 08:06:28,119 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:28,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 272 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:06:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 08:06:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 08:06:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-11-09 08:06:28,125 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 37 [2024-11-09 08:06:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:28,126 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-11-09 08:06:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-09 08:06:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:06:28,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:28,127 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:28,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:06:28,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:28,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:28,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2024-11-09 08:06:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:28,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687906025] [2024-11-09 08:06:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687906025] [2024-11-09 08:06:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687906025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700832337] [2024-11-09 08:06:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:29,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:29,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:29,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:29,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 08:06:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:29,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 08:06:29,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:29,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:06:29,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:29,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:06:29,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:29,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:29,774 INFO L378 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 33 treesize of output 17 [2024-11-09 08:06:29,788 INFO L378 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 [2024-11-09 08:06:29,875 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 08:06:29,875 INFO L378 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 29 treesize of output 28 [2024-11-09 08:06:29,888 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 08:06:29,888 INFO L378 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 [2024-11-09 08:06:30,160 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:30,160 INFO L378 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 48 treesize of output 35 [2024-11-09 08:06:30,173 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:30,174 INFO L378 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 55 treesize of output 46 [2024-11-09 08:06:30,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:30,226 INFO L378 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 40 treesize of output 32 [2024-11-09 08:06:30,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:30,238 INFO L378 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 28 [2024-11-09 08:06:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:30,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700832337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:31,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2024-11-09 08:06:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020032195] [2024-11-09 08:06:31,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:31,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 08:06:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:31,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 08:06:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 08:06:31,100 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:32,143 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-11-09 08:06:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:06:32,144 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 08:06:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:32,149 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:06:32,149 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:06:32,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=235, Invalid=2117, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 08:06:32,150 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 105 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:32,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 546 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 08:06:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:06:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2024-11-09 08:06:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2024-11-09 08:06:32,159 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 37 [2024-11-09 08:06:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:32,160 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2024-11-09 08:06:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2024-11-09 08:06:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:06:32,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:32,163 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:32,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 08:06:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:32,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2024-11-09 08:06:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145619933] [2024-11-09 08:06:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:32,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145619933] [2024-11-09 08:06:32,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145619933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:32,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:32,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:06:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54471293] [2024-11-09 08:06:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:32,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:06:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:06:32,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:06:32,665 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:32,810 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-09 08:06:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:06:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 [2024-11-09 08:06:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:32,812 INFO L225 Difference]: With dead ends: 90 [2024-11-09 08:06:32,812 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 08:06:32,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:06:32,813 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:32,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 127 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 08:06:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-09 08:06:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-09 08:06:32,822 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2024-11-09 08:06:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:32,822 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-09 08:06:32,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-09 08:06:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:06:32,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:32,823 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:32,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:06:32,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:32,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1642850412, now seen corresponding path program 1 times [2024-11-09 08:06:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392611291] [2024-11-09 08:06:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:34,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392611291] [2024-11-09 08:06:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392611291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525549063] [2024-11-09 08:06:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:34,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:34,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:34,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 08:06:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:34,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 08:06:34,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:34,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:34,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:34,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:34,737 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:34,739 INFO L378 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 20 treesize of output 23 [2024-11-09 08:06:34,795 INFO L378 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 35 treesize of output 19 [2024-11-09 08:06:34,808 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:34,808 INFO L378 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 28 treesize of output 31 [2024-11-09 08:06:34,815 INFO L378 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 [2024-11-09 08:06:34,914 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 08:06:34,914 INFO L378 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 31 treesize of output 30 [2024-11-09 08:06:34,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 08:06:34,937 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 08:06:34,937 INFO L378 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 [2024-11-09 08:06:35,254 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:35,255 INFO L378 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 50 treesize of output 37 [2024-11-09 08:06:35,269 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:35,269 INFO L378 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 43 treesize of output 46 [2024-11-09 08:06:35,276 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:35,277 INFO L378 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 51 treesize of output 42 [2024-11-09 08:06:35,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:35,342 INFO L378 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 42 treesize of output 34 [2024-11-09 08:06:35,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2024-11-09 08:06:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:35,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:44,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:44,443 INFO L378 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 76 treesize of output 80 [2024-11-09 08:06:44,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:44,508 INFO L378 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 76 treesize of output 80 [2024-11-09 08:06:49,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:49,334 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2024-11-09 08:06:49,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:49,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:49,343 INFO L378 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 61 treesize of output 63 [2024-11-09 08:06:49,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-09 08:06:49,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-11-09 08:06:49,404 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-09 08:06:49,404 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2024-11-09 08:06:49,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-09 08:06:49,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:49,427 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:49,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:49,433 INFO L378 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 2 case distinctions, treesize of input 34 treesize of output 27 [2024-11-09 08:06:49,435 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:49,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 08:06:49,443 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:49,443 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2024-11-09 08:06:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525549063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:49,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 44 [2024-11-09 08:06:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127719926] [2024-11-09 08:06:49,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:49,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 08:06:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 08:06:49,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1696, Unknown=56, NotChecked=0, Total=1892 [2024-11-09 08:06:49,562 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:50,911 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-09 08:06:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 08:06:50,912 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 08:06:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:50,912 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:06:50,912 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:06:50,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=292, Invalid=2958, Unknown=56, NotChecked=0, Total=3306 [2024-11-09 08:06:50,914 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:50,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 687 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 08:06:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:06:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2024-11-09 08:06:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-09 08:06:50,917 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 41 [2024-11-09 08:06:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-09 08:06:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-09 08:06:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:06:50,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:50,918 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:50,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 08:06:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 08:06:51,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:51,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1678988715, now seen corresponding path program 1 times [2024-11-09 08:06:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:51,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538029671] [2024-11-09 08:06:51,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538029671] [2024-11-09 08:06:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538029671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446241816] [2024-11-09 08:06:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:51,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:51,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 08:06:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:51,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 08:06:51,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:06:51,908 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:06:51,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 08:06:51,927 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:06:51,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:06:51,949 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:06:51,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:06:51,983 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 08:06:51,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 08:06:52,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2024-11-09 08:06:52,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-09 08:06:52,041 INFO L378 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 17 treesize of output 12 [2024-11-09 08:06:52,091 INFO L378 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 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-09 08:06:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 08:06:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:52,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:52,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1214 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-09 08:06:52,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1213 .cse0))) v_ArrVal_1213)))) is different from false [2024-11-09 08:06:52,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-09 08:06:52,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:06:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 7 not checked. [2024-11-09 08:06:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446241816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:52,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:52,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 27 [2024-11-09 08:06:52,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417750848] [2024-11-09 08:06:52,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:52,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 08:06:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 08:06:52,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=524, Unknown=7, NotChecked=94, Total=702 [2024-11-09 08:06:52,377 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:52,668 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-11-09 08:06:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:06:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 08:06:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:52,669 INFO L225 Difference]: With dead ends: 82 [2024-11-09 08:06:52,669 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 08:06:52,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=684, Unknown=7, NotChecked=110, Total=930 [2024-11-09 08:06:52,670 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:52,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 596 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 488 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2024-11-09 08:06:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 08:06:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 08:06:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-09 08:06:52,672 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 42 [2024-11-09 08:06:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:52,672 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-09 08:06:52,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-09 08:06:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:06:52,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:52,673 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:52,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 08:06:52,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:52,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-09 08:06:52,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2024-11-09 08:06:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:52,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195044795] [2024-11-09 08:06:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:06:54,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:54,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195044795] [2024-11-09 08:06:54,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195044795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:54,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092922392] [2024-11-09 08:06:54,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:06:54,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:54,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:54,521 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:54,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 08:06:54,673 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:06:54,673 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:06:54,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-09 08:06:54,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:54,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:06:54,723 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:54,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:06:54,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:54,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:54,813 INFO L378 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 33 treesize of output 17 [2024-11-09 08:06:54,819 INFO L378 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 [2024-11-09 08:06:54,877 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:54,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-09 08:06:54,984 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 08:06:54,985 INFO L378 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 56 treesize of output 36 [2024-11-09 08:06:55,009 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-09 08:06:55,010 INFO L378 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 22 [2024-11-09 08:06:55,076 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:55,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2024-11-09 08:06:55,090 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:06:55,091 INFO L378 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 34 treesize of output 25 [2024-11-09 08:06:55,208 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-09 08:06:55,208 INFO L378 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 63 treesize of output 60 [2024-11-09 08:06:55,233 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-09 08:06:55,234 INFO L378 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 3 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 08:06:55,791 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 08:06:55,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 88 [2024-11-09 08:06:55,801 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2024-11-09 08:06:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 108 [2024-11-09 08:06:56,345 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 08:06:56,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 91 [2024-11-09 08:06:56,355 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-09 08:06:56,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 88 [2024-11-09 08:06:56,484 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-09 08:06:56,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 119 [2024-11-09 08:06:56,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:56,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 83 [2024-11-09 08:06:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:06:57,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:15,729 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1402 0))) (or (forall ((v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1) (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))))) (select .cse0 (select (select .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) 1) (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1403 4)))))) (not (= (select |c_#valid| .cse3) 1)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse3) (not (= v_ArrVal_1402 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 (select v_ArrVal_1402 4))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1402 0)) (.cse4 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1))) (or (not (= (select .cse4 .cse5) 1)) (forall ((v_ArrVal_1407 Int) (v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (let ((.cse7 (select v_ArrVal_1409 0)) (.cse6 (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1409) .cse5) .cse7) 0) (= (select .cse4 (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (let ((.cse8 (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse9 (select (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse8) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse8) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse9 4 v_ArrVal_1407)) (select .cse9 0))))) .cse7)) 1) (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1403 4)))) (not (= (store (select (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1409 4)) v_ArrVal_1409)))))) (not (= v_ArrVal_1402 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 (select v_ArrVal_1402 4))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1))) (or (not (= (select .cse12 (select v_ArrVal_1402 0)) 1)) (forall ((v_ArrVal_1407 Int) (v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select .cse12 (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (let ((.cse13 (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse14 (select (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse13) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse13) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse14 4 v_ArrVal_1407)) (select .cse14 0))))) (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) 1) (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1403 4)))))) (not (= v_ArrVal_1402 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 (select v_ArrVal_1402 4)))))))) is different from false [2024-11-09 08:07:15,823 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1402 0)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1))) (or (not (= (select .cse0 .cse1) 1)) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1402 4)) v_ArrVal_1402)) (forall ((v_ArrVal_1407 Int) (v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (let ((.cse3 (select v_ArrVal_1409 0)) (.cse2 (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1409) .cse1) .cse3) 0) (= (select .cse0 (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (let ((.cse4 (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse5 (select (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse5 4 v_ArrVal_1407)) (select .cse5 0))))) .cse3)) 1) (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 (select v_ArrVal_1403 4)))) (not (= (store (select (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1409 4)) v_ArrVal_1409))))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1))) (or (not (= (select .cse8 (select v_ArrVal_1402 0)) 1)) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1402 4)) v_ArrVal_1402)) (forall ((v_ArrVal_1407 Int) (v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select .cse8 (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (let ((.cse9 (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse10 (select (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse10 4 v_ArrVal_1407)) (select .cse10 0))))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) 1) (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 (select v_ArrVal_1403 4))))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse16 (select v_ArrVal_1402 0))) (or (forall ((v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1) (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))))) (select .cse13 (select (select .cse13 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) 1) (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 (select v_ArrVal_1403 4)))))) (not (= (select |c_#valid| .cse16) 1)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse16) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1402 4)) v_ArrVal_1402)))))) is different from false [2024-11-09 08:07:16,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1397 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1397 .cse1)) v_ArrVal_1397)) (forall ((v_ArrVal_1398 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (or (not (= (select .cse2 (select v_ArrVal_1402 0)) 1)) (forall ((v_ArrVal_1407 Int) (v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1398))) (or (not (= (store (store (select .cse3 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 (select v_ArrVal_1403 4)) v_ArrVal_1403)) (= (select .cse2 (select (let ((.cse7 (store .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (let ((.cse5 (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse6 (select (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse5) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (select (store (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse5) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse6 4 v_ArrVal_1407)) (select .cse6 0))))) (select (select (let ((.cse8 (store .cse3 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) 1)))) (not (= v_ArrVal_1402 (store (store (select .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1402 4))))))) (not (= v_ArrVal_1398 (store .cse9 .cse1 (select v_ArrVal_1398 .cse1)))))))) (forall ((v_ArrVal_1397 (Array Int Int))) (or (forall ((v_ArrVal_1398 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse10 (select v_ArrVal_1402 0)) (.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (or (not (= (select |c_#valid| .cse10) 1)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse10) (not (= v_ArrVal_1402 (store (store (select .cse11 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1402 4)))) (forall ((v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (not (= v_ArrVal_1403 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 (select v_ArrVal_1403 4)))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1) (select (let ((.cse12 (let ((.cse13 (store .cse11 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))))) (select .cse12 (select (select .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1398) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) 1)))))) (not (= v_ArrVal_1398 (store .cse9 .cse1 (select v_ArrVal_1398 .cse1)))))) (not (= (store .cse0 .cse1 (select v_ArrVal_1397 .cse1)) v_ArrVal_1397)))) (forall ((v_ArrVal_1397 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1397 .cse1)) v_ArrVal_1397)) (forall ((v_ArrVal_1398 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1402 (Array Int Int))) (let ((.cse15 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| 1)) (.cse16 (select v_ArrVal_1402 0)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (or (not (= (select .cse15 .cse16) 1)) (forall ((v_ArrVal_1407 Int) (v_ArrVal_1403 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1409 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1398))) (let ((.cse23 (store .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403))) (let ((.cse24 (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse22 (select v_ArrVal_1409 0))) (or (not (= (store (store (select .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 (select v_ArrVal_1403 4)) v_ArrVal_1403)) (= (select .cse15 (select (let ((.cse21 (store .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1402))) (let ((.cse19 (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse20 (select (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (select (store (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse20 4 v_ArrVal_1407)) (select .cse20 0))))) .cse22)) 1) (not (= v_ArrVal_1409 (store (select (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse24) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1409 4)))) (= (select (select (store (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse24) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1409) .cse16) .cse22) 0)))))) (not (= v_ArrVal_1402 (store (store (select .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1402 4))))))) (not (= v_ArrVal_1398 (store .cse9 .cse1 (select v_ArrVal_1398 .cse1)))))))))) is different from false [2024-11-09 08:07:16,394 INFO L349 Elim1Store]: treesize reduction 112, result has 51.5 percent of original size [2024-11-09 08:07:16,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 5876 treesize of output 5831 [2024-11-09 08:07:16,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:16,535 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-11-09 08:07:16,536 INFO L378 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 4 case distinctions, treesize of input 5042 treesize of output 5012 [2024-11-09 08:07:16,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:16,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:16,657 INFO L378 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 2 case distinctions, treesize of input 898 treesize of output 878 [2024-11-09 08:07:16,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:16,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-11-09 08:07:16,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 08:07:17,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:17,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:17,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:17,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:19,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:19,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:19,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:19,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:19,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1698 treesize of output 1674 [2024-11-09 08:07:19,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:19,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:19,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:19,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 08:07:19,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:19,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 08:07:19,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:19,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 08:07:19,821 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 08:07:19,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:19,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1317 treesize of output 1279 [2024-11-09 08:07:19,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1059 treesize of output 1035 [2024-11-09 08:07:19,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-09 08:07:20,205 INFO L349 Elim1Store]: treesize reduction 114, result has 52.7 percent of original size [2024-11-09 08:07:20,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 12948 treesize of output 12723 [2024-11-09 08:07:21,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:07:21,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:21,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 708 treesize of output 724 [2024-11-09 08:07:21,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:21,516 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 08:07:21,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:21,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:21,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:21,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:21,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:21,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:21,934 INFO L349 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2024-11-09 08:07:21,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 128 [2024-11-09 08:07:22,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:22,115 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-09 08:07:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 35 [2024-11-09 08:07:22,375 INFO L349 Elim1Store]: treesize reduction 33, result has 50.7 percent of original size [2024-11-09 08:07:22,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 98 [2024-11-09 08:07:22,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:22,442 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2024-11-09 08:07:22,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 17 [2024-11-09 08:07:22,705 INFO L349 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2024-11-09 08:07:22,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 1 [2024-11-09 08:07:22,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:22,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:07:22,862 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2024-11-09 08:07:22,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:07:22,893 INFO L349 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2024-11-09 08:07:22,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 1 [2024-11-09 08:07:23,175 INFO L349 Elim1Store]: treesize reduction 482, result has 21.4 percent of original size [2024-11-09 08:07:23,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 15487 treesize of output 15388 [2024-11-09 08:07:24,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:24,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:24,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:24,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 4601 treesize of output 4649 [2024-11-09 08:07:25,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:25,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:25,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 10765 treesize of output 10807 [2024-11-09 08:07:26,218 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:26,220 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:26,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:07:26,343 INFO L349 Elim1Store]: treesize reduction 112, result has 33.7 percent of original size [2024-11-09 08:07:26,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 120 treesize of output 129