./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-middle-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:06:45,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:06:45,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 12:06:45,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:06:45,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:06:45,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:06:45,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:06:45,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:06:45,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:06:45,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:06:45,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:06:45,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:06:45,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:06:45,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:06:45,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:06:45,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:06:45,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:06:45,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:06:45,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:06:45,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:06:45,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:06:45,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:06:45,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 [2025-03-17 12:06:45,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:06:45,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:06:45,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:06:45,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:06:45,807 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:06:45,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2025-03-17 12:06:46,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35ec54a1/c35da9e43f8b42788332c6c11847ebdb/FLAGd90121170 [2025-03-17 12:06:47,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:06:47,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2025-03-17 12:06:47,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35ec54a1/c35da9e43f8b42788332c6c11847ebdb/FLAGd90121170 [2025-03-17 12:06:47,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35ec54a1/c35da9e43f8b42788332c6c11847ebdb [2025-03-17 12:06:47,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:06:47,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:06:47,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:06:47,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:06:47,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:06:47,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe3e7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47, skipping insertion in model container [2025-03-17 12:06:47,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:06:47,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:06:47,807 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:06:47,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:06:47,861 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:06:47,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47 WrapperNode [2025-03-17 12:06:47,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:06:47,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:06:47,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:06:47,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:06:47,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,897 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 73 [2025-03-17 12:06:47,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:06:47,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:06:47,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:06:47,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:06:47,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,934 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2025-03-17 12:06:47,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:06:47,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:06:47,955 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:06:47,955 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:06:47,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (1/1) ... [2025-03-17 12:06:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:06:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:47,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:06:48,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:06:48,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:06:48,027 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:06:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:06:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:06:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:06:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:06:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:06:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:06:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:06:48,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:06:48,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:06:48,468 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-17 12:06:48,471 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:06:48,482 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:06:48,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:06:48,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:48 BoogieIcfgContainer [2025-03-17 12:06:48,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:06:48,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:06:48,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:06:48,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:06:48,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:06:47" (1/3) ... [2025-03-17 12:06:48,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b228ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:48, skipping insertion in model container [2025-03-17 12:06:48,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:47" (2/3) ... [2025-03-17 12:06:48,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b228ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:48, skipping insertion in model container [2025-03-17 12:06:48,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:48" (3/3) ... [2025-03-17 12:06:48,494 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-middle-data.i [2025-03-17 12:06:48,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:06:48,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-middle-data.i that has 2 procedures, 82 locations, 1 initial locations, 3 loop locations, and 36 error locations. [2025-03-17 12:06:48,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:06:48,548 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;@2de2509e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:06:48,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-17 12:06:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:06:48,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:48,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:06:48,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash 3449443, now seen corresponding path program 1 times [2025-03-17 12:06:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749463018] [2025-03-17 12:06:48,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:48,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:06:48,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:06:48,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:48,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:48,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:48,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749463018] [2025-03-17 12:06:48,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749463018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:48,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:48,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:06:48,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044465017] [2025-03-17 12:06:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:48,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:06:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:48,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:06:48,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:48,748 INFO L87 Difference]: Start difference. First operand has 82 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:48,836 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-03-17 12:06:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:06:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 12:06:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:48,842 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:06:48,842 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:06:48,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:48,844 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:48,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:06:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 12:06:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.829268292682927) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-17 12:06:48,875 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 4 [2025-03-17 12:06:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:48,875 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-17 12:06:48,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-17 12:06:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:06:48,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:48,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:06:48,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:06:48,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:48,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 3449444, now seen corresponding path program 1 times [2025-03-17 12:06:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:48,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181601433] [2025-03-17 12:06:48,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:48,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:06:48,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:06:48,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:48,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181601433] [2025-03-17 12:06:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181601433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:48,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:48,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:06:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424434713] [2025-03-17 12:06:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:48,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:06:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:48,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:06:48,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:48,994 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:49,058 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-03-17 12:06:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:06:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 12:06:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:49,060 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:06:49,060 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:06:49,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:06:49,060 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:49,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:06:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:06:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-03-17 12:06:49,067 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2025-03-17 12:06:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:49,067 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-03-17 12:06:49,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:06:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-03-17 12:06:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:06:49,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:49,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:49,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:06:49,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:49,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1227017701, now seen corresponding path program 1 times [2025-03-17 12:06:49,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:49,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942946447] [2025-03-17 12:06:49,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:49,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:06:49,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:06:49,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:49,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942946447] [2025-03-17 12:06:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942946447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:49,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:49,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:06:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012238722] [2025-03-17 12:06:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:06:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:49,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:06:49,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:49,228 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:49,360 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2025-03-17 12:06:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:06:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 12:06:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:49,362 INFO L225 Difference]: With dead ends: 70 [2025-03-17 12:06:49,362 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 12:06:49,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:49,363 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:49,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 153 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 12:06:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-03-17 12:06:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-17 12:06:49,374 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 12 [2025-03-17 12:06:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-17 12:06:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-17 12:06:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:06:49,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:49,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:06:49,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1227017702, now seen corresponding path program 1 times [2025-03-17 12:06:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706747029] [2025-03-17 12:06:49,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:49,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:06:49,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:06:49,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:49,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706747029] [2025-03-17 12:06:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706747029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:49,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:49,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:06:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825812942] [2025-03-17 12:06:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:06:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:49,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:06:49,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:49,638 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:49,753 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2025-03-17 12:06:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:06:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 12:06:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:49,755 INFO L225 Difference]: With dead ends: 68 [2025-03-17 12:06:49,755 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 12:06:49,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:06:49,755 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:49,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 190 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 12:06:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-17 12:06:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-03-17 12:06:49,763 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 12 [2025-03-17 12:06:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:49,763 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-03-17 12:06:49,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-03-17 12:06:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:06:49,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:49,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:49,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:06:49,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1280319707, now seen corresponding path program 1 times [2025-03-17 12:06:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886048845] [2025-03-17 12:06:49,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:49,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:06:49,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:06:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886048845] [2025-03-17 12:06:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886048845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:49,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:49,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598166964] [2025-03-17 12:06:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:49,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:49,942 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:50,068 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2025-03-17 12:06:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 12:06:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:50,069 INFO L225 Difference]: With dead ends: 70 [2025-03-17 12:06:50,069 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 12:06:50,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:50,070 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:50,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 205 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 12:06:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-17 12:06:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2025-03-17 12:06:50,074 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 20 [2025-03-17 12:06:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:50,074 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2025-03-17 12:06:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2025-03-17 12:06:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:06:50,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:50,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:50,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:06:50,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1280319708, now seen corresponding path program 1 times [2025-03-17 12:06:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240803844] [2025-03-17 12:06:50,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:06:50,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:06:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240803844] [2025-03-17 12:06:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240803844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:50,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974951233] [2025-03-17 12:06:50,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:50,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:50,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:50,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:50,361 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:50,494 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2025-03-17 12:06:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:50,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 12:06:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:50,495 INFO L225 Difference]: With dead ends: 70 [2025-03-17 12:06:50,496 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 12:06:50,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:50,496 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:50,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 208 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 12:06:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-17 12:06:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-03-17 12:06:50,501 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 20 [2025-03-17 12:06:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:50,501 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-03-17 12:06:50,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-03-17 12:06:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:06:50,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:50,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:06:50,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1035199999, now seen corresponding path program 1 times [2025-03-17 12:06:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080035980] [2025-03-17 12:06:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:50,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:06:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:06:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080035980] [2025-03-17 12:06:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080035980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558117706] [2025-03-17 12:06:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:50,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:50,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:50,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:50,616 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:50,658 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-03-17 12:06:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:50,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 12:06:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:50,659 INFO L225 Difference]: With dead ends: 71 [2025-03-17 12:06:50,659 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 12:06:50,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:50,660 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:50,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 304 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:06:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 12:06:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-17 12:06:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-03-17 12:06:50,667 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 21 [2025-03-17 12:06:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:50,667 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-03-17 12:06:50,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-03-17 12:06:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:06:50,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:50,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:06:50,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:50,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1600164414, now seen corresponding path program 1 times [2025-03-17 12:06:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149430971] [2025-03-17 12:06:50,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:50,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:06:50,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:06:50,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:50,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149430971] [2025-03-17 12:06:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149430971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581716386] [2025-03-17 12:06:51,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:51,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:51,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:51,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:06:51,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:06:51,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:06:51,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:51,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:51,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-17 12:06:51,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:51,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:06:51,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:06:51,658 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 29 treesize of output 13 [2025-03-17 12:06:51,665 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 29 treesize of output 13 [2025-03-17 12:06:51,684 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 25 treesize of output 13 [2025-03-17 12:06:51,692 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 [2025-03-17 12:06:51,703 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 29 treesize of output 13 [2025-03-17 12:06:51,708 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 29 treesize of output 13 [2025-03-17 12:06:51,816 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 [2025-03-17 12:06:51,825 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 [2025-03-17 12:06:51,858 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 29 treesize of output 13 [2025-03-17 12:06:51,865 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 29 treesize of output 13 [2025-03-17 12:06:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:51,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:06:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581716386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:06:52,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:06:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 19 [2025-03-17 12:06:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597609738] [2025-03-17 12:06:52,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:06:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 12:06:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:52,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 12:06:52,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:06:52,480 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:06:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:52,638 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2025-03-17 12:06:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:06:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-17 12:06:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:52,640 INFO L225 Difference]: With dead ends: 73 [2025-03-17 12:06:52,640 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 12:06:52,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:06:52,640 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:52,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 537 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 12:06:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-17 12:06:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.469387755102041) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-03-17 12:06:52,644 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 23 [2025-03-17 12:06:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:52,644 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-03-17 12:06:52,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:06:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-03-17 12:06:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:06:52,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:52,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:52,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:06:52,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:52,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1934505464, now seen corresponding path program 1 times [2025-03-17 12:06:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128076044] [2025-03-17 12:06:52,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:52,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:06:52,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:06:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128076044] [2025-03-17 12:06:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128076044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:06:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862154550] [2025-03-17 12:06:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:52,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:52,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:52,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:52,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:52,919 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:52,971 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-17 12:06:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 12:06:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:52,972 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:06:52,972 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:06:52,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:52,973 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:52,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 310 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:06:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:06:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-03-17 12:06:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-03-17 12:06:52,975 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2025-03-17 12:06:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-03-17 12:06:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-03-17 12:06:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:06:52,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:52,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:06:52,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1934505815, now seen corresponding path program 1 times [2025-03-17 12:06:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589565956] [2025-03-17 12:06:52,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:52,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:06:52,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:06:52,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:52,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:53,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589565956] [2025-03-17 12:06:53,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589565956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:53,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729687787] [2025-03-17 12:06:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:53,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:53,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:53,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:53,064 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:53,183 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-17 12:06:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 12:06:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:53,184 INFO L225 Difference]: With dead ends: 75 [2025-03-17 12:06:53,185 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 12:06:53,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:53,185 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:53,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 12:06:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 12:06:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-03-17 12:06:53,190 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 24 [2025-03-17 12:06:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:53,190 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-03-17 12:06:53,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-03-17 12:06:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:06:53,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:53,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:53,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:06:53,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:53,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1934505816, now seen corresponding path program 1 times [2025-03-17 12:06:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371013866] [2025-03-17 12:06:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:53,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:06:53,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:06:53,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:53,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371013866] [2025-03-17 12:06:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371013866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:53,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:53,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45388400] [2025-03-17 12:06:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:53,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:53,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:53,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:53,363 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:53,489 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-03-17 12:06:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 12:06:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:53,491 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:06:53,491 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:06:53,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:53,492 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:53,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 220 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:06:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-03-17 12:06:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2025-03-17 12:06:53,499 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 24 [2025-03-17 12:06:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:53,499 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2025-03-17 12:06:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2025-03-17 12:06:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:06:53,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:53,500 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:06:53,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -867329902, now seen corresponding path program 1 times [2025-03-17 12:06:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013881821] [2025-03-17 12:06:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:53,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:53,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013881821] [2025-03-17 12:06:53,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013881821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117782795] [2025-03-17 12:06:53,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:53,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:53,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:53,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:53,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:06:53,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:53,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:53,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:53,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:06:53,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:53,790 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-03-17 12:06:53,835 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:06:53,835 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 [2025-03-17 12:06:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:53,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:06:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117782795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:53,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:06:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-17 12:06:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990149424] [2025-03-17 12:06:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:06:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:53,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:06:53,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:06:53,840 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:53,888 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-03-17 12:06:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:06:53,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-17 12:06:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:53,889 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:06:53,889 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:06:53,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:06:53,889 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:53,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 89 Unchecked, 0.0s Time] [2025-03-17 12:06:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:06:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:06:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-03-17 12:06:53,893 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 27 [2025-03-17 12:06:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:53,894 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-03-17 12:06:53,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-03-17 12:06:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:06:53,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:53,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:53,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:06:54,099 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,SelfDestructingSolverStorable11 [2025-03-17 12:06:54,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -867329901, now seen corresponding path program 1 times [2025-03-17 12:06:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750351653] [2025-03-17 12:06:54,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:54,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:54,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:54,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:54,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750351653] [2025-03-17 12:06:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750351653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756160093] [2025-03-17 12:06:54,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:54,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:54,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:54,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:54,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:06:54,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:54,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:54,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:54,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:54,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 12:06:54,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:54,489 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:06:54,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:06:54,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:06:54,523 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:06:54,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:06:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:54,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:06:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756160093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:54,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:06:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-03-17 12:06:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976827385] [2025-03-17 12:06:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:54,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:06:54,536 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:54,613 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2025-03-17 12:06:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-17 12:06:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:54,614 INFO L225 Difference]: With dead ends: 97 [2025-03-17 12:06:54,614 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 12:06:54,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:06:54,614 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:54,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 126 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2025-03-17 12:06:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 12:06:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2025-03-17 12:06:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.411764705882353) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2025-03-17 12:06:54,619 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 27 [2025-03-17 12:06:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:54,619 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2025-03-17 12:06:54,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2025-03-17 12:06:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:06:54,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:54,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:54,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:06:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:54,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:54,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash 991550913, now seen corresponding path program 1 times [2025-03-17 12:06:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38230029] [2025-03-17 12:06:54,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:54,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:06:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:06:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:54,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38230029] [2025-03-17 12:06:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38230029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:06:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456409932] [2025-03-17 12:06:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:06:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:54,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:06:54,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:54,902 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:54,971 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-17 12:06:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:06:54,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-17 12:06:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:54,972 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:06:54,972 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:06:54,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:54,973 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 32 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:54,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 304 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:06:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 12:06:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 90 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-03-17 12:06:54,975 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 27 [2025-03-17 12:06:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:54,975 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-03-17 12:06:54,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-03-17 12:06:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:06:54,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:54,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:54,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:06:54,976 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:54,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -101825076, now seen corresponding path program 1 times [2025-03-17 12:06:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838889511] [2025-03-17 12:06:54,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:54,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:06:54,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:06:54,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:54,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:06:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838889511] [2025-03-17 12:06:55,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838889511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:55,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:55,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755403803] [2025-03-17 12:06:55,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:55,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:55,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:55,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:55,067 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:06:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:55,168 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2025-03-17 12:06:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-17 12:06:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:55,169 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:06:55,169 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:06:55,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:55,170 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:55,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 204 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:06:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:06:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-03-17 12:06:55,175 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 30 [2025-03-17 12:06:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:55,175 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-03-17 12:06:55,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:06:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-03-17 12:06:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:06:55,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:55,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:55,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:06:55,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -101825075, now seen corresponding path program 1 times [2025-03-17 12:06:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158489373] [2025-03-17 12:06:55,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:06:55,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:06:55,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:55,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158489373] [2025-03-17 12:06:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158489373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:55,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:55,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:06:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894701081] [2025-03-17 12:06:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:06:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:55,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:06:55,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:06:55,359 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:06:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:55,457 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-03-17 12:06:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:06:55,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-17 12:06:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:55,458 INFO L225 Difference]: With dead ends: 93 [2025-03-17 12:06:55,458 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 12:06:55,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:06:55,459 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:55,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 215 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:06:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 12:06:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 12:06:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.375) internal successors, (99), 88 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-03-17 12:06:55,461 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 30 [2025-03-17 12:06:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:55,462 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-03-17 12:06:55,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:06:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-03-17 12:06:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:06:55,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:55,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:55,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:06:55,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:55,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1491824655, now seen corresponding path program 1 times [2025-03-17 12:06:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294934469] [2025-03-17 12:06:55,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:55,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:06:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:06:55,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294934469] [2025-03-17 12:06:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294934469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507203227] [2025-03-17 12:06:55,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:55,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:55,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:06:55,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:06:55,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:06:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:55,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:06:55,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:55,778 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 13 treesize of output 9 [2025-03-17 12:06:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:55,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:06:55,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_14|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_14| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-03-17 12:06:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507203227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:55,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:06:55,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2025-03-17 12:06:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715935815] [2025-03-17 12:06:55,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:06:55,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:06:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:55,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:06:55,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:06:55,854 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:56,029 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2025-03-17 12:06:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:06:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-17 12:06:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:56,030 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:06:56,030 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 12:06:56,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:06:56,030 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:56,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 328 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 12:06:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2025-03-17 12:06:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.36) internal successors, (102), 91 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2025-03-17 12:06:56,033 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2025-03-17 12:06:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:56,034 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-03-17 12:06:56,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:06:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2025-03-17 12:06:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:06:56,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:56,035 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:56,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:06:56,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:06:56,240 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:56,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1491824304, now seen corresponding path program 1 times [2025-03-17 12:06:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:56,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934655030] [2025-03-17 12:06:56,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:56,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:06:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:06:56,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:56,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934655030] [2025-03-17 12:06:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934655030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326961765] [2025-03-17 12:06:56,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:56,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:56,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:56,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:56,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:06:56,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:06:56,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:06:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:56,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-17 12:06:56,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:56,706 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 [2025-03-17 12:06:56,711 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 [2025-03-17 12:06:56,733 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 [2025-03-17 12:06:56,738 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 [2025-03-17 12:06:56,749 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 [2025-03-17 12:06:56,755 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 [2025-03-17 12:06:56,766 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 [2025-03-17 12:06:56,771 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 [2025-03-17 12:06:56,873 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 [2025-03-17 12:06:56,880 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 [2025-03-17 12:06:56,898 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 [2025-03-17 12:06:56,904 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 [2025-03-17 12:06:57,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:06:57,007 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 17 treesize of output 15 [2025-03-17 12:06:57,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:06:57,013 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 17 treesize of output 15 [2025-03-17 12:06:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:57,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:06:57,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-17 12:06:57,753 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 7090 treesize of output 7026 [2025-03-17 12:06:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:06:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326961765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:06:57,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:06:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 29 [2025-03-17 12:06:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498252736] [2025-03-17 12:06:57,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:06:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:06:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:06:57,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-03-17 12:06:57,772 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 26 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:06:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:58,303 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2025-03-17 12:06:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:06:58,303 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 26 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-17 12:06:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:58,304 INFO L225 Difference]: With dead ends: 107 [2025-03-17 12:06:58,304 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:06:58,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 12:06:58,305 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:58,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 705 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:06:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:06:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-17 12:06:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 89 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-03-17 12:06:58,308 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 30 [2025-03-17 12:06:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:58,309 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-03-17 12:06:58,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 26 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:06:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2025-03-17 12:06:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:06:58,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:58,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:58,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:06:58,509 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,SelfDestructingSolverStorable17 [2025-03-17 12:06:58,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 713730694, now seen corresponding path program 1 times [2025-03-17 12:06:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740714664] [2025-03-17 12:06:58,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:58,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:06:58,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:06:58,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:58,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740714664] [2025-03-17 12:06:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740714664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:06:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 12:06:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431303745] [2025-03-17 12:06:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:58,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:06:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:58,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:06:58,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:06:58,806 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:59,023 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-17 12:06:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:06:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-03-17 12:06:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:59,024 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:06:59,024 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:06:59,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:06:59,025 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 342 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:06:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-17 12:06:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 89 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-03-17 12:06:59,029 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 34 [2025-03-17 12:06:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:59,029 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-03-17 12:06:59,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-03-17 12:06:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:06:59,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:59,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:06:59,030 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:06:59,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:06:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 713730695, now seen corresponding path program 1 times [2025-03-17 12:06:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:06:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442802451] [2025-03-17 12:06:59,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:06:59,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:06:59,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:06:59,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:59,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:06:59,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442802451] [2025-03-17 12:06:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442802451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:06:59,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391583479] [2025-03-17 12:06:59,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:06:59,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:06:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:06:59,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:06:59,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:06:59,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:06:59,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:06:59,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:06:59,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:06:59,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:06:59,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:06:59,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:06:59,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:06:59,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:06:59,617 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:06:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:06:59,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:06:59,687 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:06:59,693 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 30 treesize of output 13 [2025-03-17 12:06:59,707 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 31 treesize of output 13 [2025-03-17 12:06:59,711 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 9 treesize of output 3 [2025-03-17 12:06:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:06:59,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:06:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391583479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:06:59,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:06:59,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2025-03-17 12:06:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152667842] [2025-03-17 12:06:59,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:06:59,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:06:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:06:59,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:06:59,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:06:59,734 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:06:59,944 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2025-03-17 12:06:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:06:59,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-03-17 12:06:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:06:59,945 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:06:59,945 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:06:59,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:06:59,946 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:06:59,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 239 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:06:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:06:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:06:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 89 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:06:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2025-03-17 12:06:59,950 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 34 [2025-03-17 12:06:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:06:59,950 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2025-03-17 12:06:59,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:06:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2025-03-17 12:06:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:06:59,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:06:59,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:06:59,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:07:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:00,155 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:00,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash 948854848, now seen corresponding path program 1 times [2025-03-17 12:07:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225444708] [2025-03-17 12:07:00,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:00,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:00,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:00,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:00,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225444708] [2025-03-17 12:07:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225444708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:07:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:07:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 12:07:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72523850] [2025-03-17 12:07:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:07:00,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:07:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:00,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:07:00,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:07:00,579 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:00,841 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2025-03-17 12:07:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:07:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-17 12:07:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:00,842 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:07:00,842 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:07:00,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:07:00,843 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:00,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 361 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:07:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:07:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-17 12:07:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-03-17 12:07:00,846 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 38 [2025-03-17 12:07:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:00,846 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-03-17 12:07:00,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-03-17 12:07:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:07:00,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:00,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:07:00,847 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 948854849, now seen corresponding path program 1 times [2025-03-17 12:07:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403587090] [2025-03-17 12:07:00,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:00,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:00,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:00,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:00,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403587090] [2025-03-17 12:07:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403587090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187273650] [2025-03-17 12:07:01,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:01,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:01,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:01,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:01,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:07:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:07:01,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:07:01,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:01,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:01,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 12:07:01,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:01,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:01,583 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:01,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:01,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:07:01,613 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:07:01,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:01,678 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:07:01,682 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 30 treesize of output 13 [2025-03-17 12:07:01,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:01,741 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:07:01,745 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 30 treesize of output 13 [2025-03-17 12:07:01,781 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 31 treesize of output 13 [2025-03-17 12:07:01,785 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 9 treesize of output 3 [2025-03-17 12:07:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:01,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:07:01,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187273650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:07:01,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:07:01,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2025-03-17 12:07:01,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812157312] [2025-03-17 12:07:01,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:07:01,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:07:01,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:01,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:07:01,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:07:01,806 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:02,067 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-03-17 12:07:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:07:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-17 12:07:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:02,068 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:07:02,068 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:07:02,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-03-17 12:07:02,072 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:02,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 295 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:07:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:07:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:07:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.36986301369863) internal successors, (100), 89 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2025-03-17 12:07:02,076 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 38 [2025-03-17 12:07:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:02,078 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2025-03-17 12:07:02,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2025-03-17 12:07:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 12:07:02,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:02,079 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:02,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:02,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:02,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:02,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 316935514, now seen corresponding path program 1 times [2025-03-17 12:07:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:02,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880836436] [2025-03-17 12:07:02,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 12:07:02,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 12:07:02,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880836436] [2025-03-17 12:07:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880836436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270244147] [2025-03-17 12:07:02,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:02,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:02,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:02,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:02,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:07:02,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 12:07:02,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 12:07:02,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:02,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 12:07:02,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:02,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:02,578 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:07:02,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-17 12:07:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270244147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:02,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-17 12:07:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988346582] [2025-03-17 12:07:02,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:02,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:07:02,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:02,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:07:02,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:07:02,594 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:02,682 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2025-03-17 12:07:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:07:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2025-03-17 12:07:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:02,682 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:07:02,682 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:07:02,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:07:02,683 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:02,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:07:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:07:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-17 12:07:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 95 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2025-03-17 12:07:02,685 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 46 [2025-03-17 12:07:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:02,685 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2025-03-17 12:07:02,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2025-03-17 12:07:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 12:07:02,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:02,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:02,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:02,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 12:07:02,890 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:02,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 316935515, now seen corresponding path program 1 times [2025-03-17 12:07:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940935176] [2025-03-17 12:07:02,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:02,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 12:07:02,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 12:07:02,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:02,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:07:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940935176] [2025-03-17 12:07:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940935176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74155285] [2025-03-17 12:07:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:03,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:03,081 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:03,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:07:03,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 12:07:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 12:07:03,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:03,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:07:03,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:03,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:03,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:03,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:07:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:07:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74155285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:03,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2025-03-17 12:07:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426952773] [2025-03-17 12:07:03,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:03,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:07:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:07:03,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:07:03,517 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 17 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:07:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:03,645 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2025-03-17 12:07:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:07:03,646 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2025-03-17 12:07:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:03,647 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:07:03,647 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:07:03,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:07:03,647 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:03,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 374 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:07:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:07:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-17 12:07:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 95 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-03-17 12:07:03,651 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 46 [2025-03-17 12:07:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:03,651 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-03-17 12:07:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:07:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-03-17 12:07:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:07:03,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:03,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:03,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:07:03,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:07:03,856 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1487781091, now seen corresponding path program 1 times [2025-03-17 12:07:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798350579] [2025-03-17 12:07:03,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:07:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:07:03,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798350579] [2025-03-17 12:07:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798350579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072371697] [2025-03-17 12:07:04,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:04,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:04,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:07:04,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:07:04,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:07:04,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:04,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:04,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 12:07:04,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:04,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:04,835 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:07:04,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:04,919 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-17 12:07:04,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:04,987 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:07:05,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:05,077 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:07:05,142 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 31 treesize of output 13 [2025-03-17 12:07:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:05,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:05,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2071) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2025-03-17 12:07:05,253 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 12:07:05,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-17 12:07:05,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem10#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2070))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_2071)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))) is different from false [2025-03-17 12:07:05,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2070))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2071)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))))) is different from false [2025-03-17 12:07:05,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2069 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2069)) (.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2070))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2071)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))))) is different from false [2025-03-17 12:07:05,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2069 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_2070))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2071)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse3))))) is different from false [2025-03-17 12:07:05,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:05,291 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 68 [2025-03-17 12:07:05,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:05,308 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 5138 treesize of output 4219 [2025-03-17 12:07:05,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:05,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1038 treesize of output 846 [2025-03-17 12:07:05,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:05,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 838 treesize of output 742 [2025-03-17 12:07:05,439 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 734 treesize of output 670 [2025-03-17 12:07:05,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072371697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:05,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:05,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 31 [2025-03-17 12:07:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91398947] [2025-03-17 12:07:05,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:05,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:07:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:05,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:07:05,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1125, Unknown=16, NotChecked=360, Total=1640 [2025-03-17 12:07:05,917 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 28 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:06,491 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2025-03-17 12:07:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:07:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 28 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2025-03-17 12:07:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:06,493 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:07:06,493 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:07:06,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=1663, Unknown=17, NotChecked=440, Total=2352 [2025-03-17 12:07:06,494 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:06,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 692 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:07:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:07:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 12:07:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 98 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2025-03-17 12:07:06,506 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 49 [2025-03-17 12:07:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:06,506 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2025-03-17 12:07:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 28 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2025-03-17 12:07:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:07:06,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:06,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:06,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:06,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 12:07:06,708 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:06,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1487781092, now seen corresponding path program 1 times [2025-03-17 12:07:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:06,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110111208] [2025-03-17 12:07:06,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:06,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:07:06,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:07:06,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:06,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110111208] [2025-03-17 12:07:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110111208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652652615] [2025-03-17 12:07:07,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:07,667 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:07,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:07:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:07:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:07:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:07,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:07,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-17 12:07:07,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:07,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:07,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:08,000 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:07:08,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:07:08,094 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:08,095 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:07:08,099 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 30 treesize of output 13 [2025-03-17 12:07:08,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:08,209 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:07:08,215 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 30 treesize of output 13 [2025-03-17 12:07:08,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:08,273 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:07:08,277 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 30 treesize of output 13 [2025-03-17 12:07:08,374 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 31 treesize of output 13 [2025-03-17 12:07:08,380 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 9 treesize of output 3 [2025-03-17 12:07:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:08,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:08,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:08,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 470 [2025-03-17 12:07:16,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse17 (forall ((v_ArrVal_2252 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0))) (.cse7 (+ 9 |c_ULTIMATE.start_create_#t~mem9#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse3 (select (select (store .cse10 .cse9 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse0 (store .cse10 .cse9 v_ArrVal_2253))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse3) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse8 (store .cse4 .cse9 v_ArrVal_2254))) (let ((.cse6 (select (select (store .cse8 .cse1 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< .cse6 .cse7) (< .cse6 (+ (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))))))) (= .cse1 .cse3))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse3)))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_2253))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse12 (select (select (store .cse15 .cse16 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse11 (select (select (store .cse14 .cse13 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse11) (= .cse11 .cse12) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse13) (= .cse13 .cse12) (= .cse11 .cse13)))))))) .cse17) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse23 (select (select (store .cse24 .cse22 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2253 (Array Int Int))) (let ((.cse18 (store .cse24 .cse22 v_ArrVal_2253))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store .cse18 .cse19 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse20 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (let ((.cse21 (store .cse20 .cse22 v_ArrVal_2254))) (< (select (select (store .cse21 .cse19 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) (+ (select (select .cse21 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse19) (= .cse19 .cse23))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse23)))))) (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse31 (store .cse30 .cse29 v_ArrVal_2253))) (let ((.cse25 (select (select .cse31 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse25) (forall ((v_ArrVal_2255 (Array Int Int))) (let ((.cse26 (select (select (store .cse31 .cse25 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse26) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse27 (select (select (store .cse30 .cse29 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= .cse26 .cse27) (= .cse25 .cse27) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse28 .cse29 v_prenex_11) .cse27 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse28 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))))))))))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse38 (store .cse39 .cse40 v_ArrVal_2253)) (.cse32 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse36 (store .cse32 .cse40 v_ArrVal_2254)) (.cse37 (select (select .cse38 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse35 (select (select (store .cse36 .cse37 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (.cse34 (select (select (store .cse39 .cse40 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse33 (select (select (store .cse38 .cse37 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse32 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse33 .cse34) (< .cse35 .cse7) (< .cse35 (+ (select (select .cse36 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)) (= .cse37 .cse34) (= .cse33 .cse37)))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse47 (select (select .cse49 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse42 (select (select (store .cse49 .cse47 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse48 (store .cse49 .cse47 v_ArrVal_2253))) (let ((.cse46 (select (select .cse48 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse41 (select (select (store .cse48 .cse46 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse41 .cse42) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse45 (store .cse43 .cse47 v_ArrVal_2254))) (let ((.cse44 (select (select (store .cse45 .cse46 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse43 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< .cse44 .cse7) (< .cse44 (+ (select (select .cse45 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))))))) (= .cse46 .cse42) (= .cse41 .cse46)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse42)))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse55 (select (select .cse54 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse51 (select (select (store .cse54 .cse55 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse53 (store .cse54 .cse55 v_ArrVal_2253))) (let ((.cse52 (select (select .cse53 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse50 (select (select (store .cse53 .cse52 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse50) (= .cse50 .cse51) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse52)))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse56 .cse55 v_prenex_11) .cse51 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse56 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse51)))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse59 (select (select .cse62 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse63 (store .cse62 .cse59 v_ArrVal_2253))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse58 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252)) (.cse57 (select (select (store .cse63 .cse61 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (.cse60 (select (select (store .cse62 .cse59 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse57) (< 0 (+ 5 (select (select (store (store .cse58 .cse59 v_prenex_11) .cse60 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse58 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse57 .cse60) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse61)))))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse69 (select (select .cse68 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse67 (store .cse68 .cse69 v_ArrVal_2253))) (let ((.cse66 (select (select .cse67 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse65 (select (select (store .cse68 .cse69 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse64 (select (select (store .cse67 .cse66 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse64) (= .cse64 .cse65) (= .cse66 .cse65) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse65) (= .cse64 .cse66)))))))) .cse17) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse74 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse75 (select (select .cse74 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse73 (store .cse74 .cse75 v_ArrVal_2253))) (let ((.cse72 (select (select .cse73 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse71 (select (select (store .cse74 .cse75 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse70 (select (select (store .cse73 .cse72 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse70) (= .cse70 .cse71) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse72) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse71) (= .cse70 .cse72)))))))) .cse17) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse81 (select (select .cse80 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse77 (select (select (store .cse80 .cse81 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse79 (store .cse80 .cse81 v_ArrVal_2253))) (let ((.cse78 (select (select .cse79 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse76 (select (select (store .cse79 .cse78 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse76 .cse77) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse78) (= .cse78 .cse77) (= .cse76 .cse78)))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse82 .cse81 v_prenex_11) .cse77 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse82 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse77)))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse89 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse87 (select (select .cse89 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse84 (select (select (store .cse89 .cse87 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse88 (store .cse89 .cse87 v_ArrVal_2253))) (let ((.cse85 (select (select .cse88 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse83 (select (select (store .cse88 .cse85 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse83 .cse84) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse85) (= .cse85 .cse84) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse86 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse86 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< (select (select (store (store .cse86 .cse87 v_ArrVal_2254) .cse85 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse7)))) (= .cse83 .cse85)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse84)))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse96 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse94 (select (select .cse96 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse90 (select (select (store .cse96 .cse94 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse90) (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse95 (store .cse96 .cse94 v_ArrVal_2253))) (let ((.cse92 (select (select .cse95 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse91 (select (select (store .cse95 .cse92 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse91 .cse90) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse92) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse93 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse93 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< (select (select (store (store .cse93 .cse94 v_ArrVal_2254) .cse92 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse7)))) (= .cse91 .cse92))))))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse103 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse99 (select (select .cse103 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse102 (store .cse103 .cse99 v_ArrVal_2253))) (let ((.cse101 (select (select .cse102 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse98 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252)) (.cse100 (select (select (store .cse103 .cse99 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse97 (select (select (store .cse102 .cse101 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse97) (< 0 (+ 5 (select (select (store (store .cse98 .cse99 v_prenex_11) .cse100 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse98 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse97 .cse100) (= .cse97 .cse101)))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse107 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse108 (select (select .cse107 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse106 (select (select (store .cse107 .cse108 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse104 (store .cse107 .cse108 v_ArrVal_2253))) (let ((.cse105 (select (select .cse104 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= (select (select (store .cse104 .cse105 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse106) (= .cse105 .cse106))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse109 .cse108 v_prenex_11) .cse106 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse109 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse106)))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse116 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse111 (select (select .cse116 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse115 (store .cse116 .cse111 v_ArrVal_2253))) (let ((.cse114 (select (select .cse115 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse110 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252)) (.cse112 (select (select (store .cse116 .cse111 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse113 (select (select (store .cse115 .cse114 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< 0 (+ 5 (select (select (store (store .cse110 .cse111 v_prenex_11) .cse112 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse110 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse113 .cse112) (= .cse113 .cse114)))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse125 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse124 (select (select .cse125 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse117 (select (select (store .cse125 .cse124 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse117) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse123 (store .cse125 .cse124 v_ArrVal_2253)) (.cse118 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse121 (store .cse118 .cse124 v_ArrVal_2254)) (.cse122 (select (select .cse123 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse120 (select (select (store .cse121 .cse122 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (.cse119 (select (select (store .cse123 .cse122 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse118 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse119 .cse117) (< .cse120 .cse7) (< .cse120 (+ (select (select .cse121 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)) (= .cse119 .cse122))))))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse133 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse131 (select (select .cse133 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse126 (select (select (store .cse133 .cse131 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse126) (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse132 (store .cse133 .cse131 v_ArrVal_2253))) (let ((.cse130 (select (select .cse132 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse127 (select (select (store .cse132 .cse130 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse127) (= .cse127 .cse126) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse128 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse128 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (let ((.cse129 (store .cse128 .cse131 v_ArrVal_2254))) (< (select (select (store .cse129 .cse130 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) (+ (select (select .cse129 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse130))))))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse136 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse137 (select (select .cse136 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse134 (store .cse136 .cse137 v_ArrVal_2253))) (let ((.cse135 (select (select .cse134 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int))) (= (select (select (store .cse134 .cse135 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse135)) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse135) (= .cse135 (select (select (store .cse136 .cse137 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse138 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< (select (select (store (store .cse138 .cse137 v_ArrVal_2254) .cse135 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse7)))))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse143 (select (select .cse144 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse139 (select (select (store .cse144 .cse143 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse139) (forall ((v_ArrVal_2253 (Array Int Int))) (let ((.cse140 (store .cse144 .cse143 v_ArrVal_2253))) (let ((.cse141 (select (select .cse140 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int))) (= (select (select (store .cse140 .cse141 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse141)) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse141) (= .cse141 .cse139) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse142 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse142 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< (select (select (store (store .cse142 .cse143 v_ArrVal_2254) .cse141 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse7))))))))))))) (forall ((v_ArrVal_2252 (Array Int Int))) (let ((.cse145 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse145 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse151 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse146 (select (select .cse151 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse147 (select (select (store .cse151 .cse146 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (< 0 (+ 5 (select (select (store (store .cse145 .cse146 v_prenex_11) .cse147 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (forall ((v_ArrVal_2253 (Array Int Int))) (let ((.cse150 (store .cse151 .cse146 v_ArrVal_2253))) (let ((.cse148 (select (select .cse150 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse148) (forall ((v_ArrVal_2255 (Array Int Int))) (let ((.cse149 (select (select (store .cse150 .cse148 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse149) (= .cse149 .cse148)))))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse147))))))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse157 (select (select .cse156 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse155 (store .cse156 .cse157 v_ArrVal_2253))) (let ((.cse154 (select (select .cse155 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse153 (select (select (store .cse156 .cse157 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse152 (select (select (store .cse155 .cse154 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse152) (= .cse152 .cse153) (= .cse154 .cse153) (= .cse152 .cse154)))))))) .cse17) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse165 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse164 (select (select .cse165 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse161 (select (select (store .cse165 .cse164 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse159 (store .cse165 .cse164 v_ArrVal_2253)) (.cse158 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse163 (store .cse158 .cse164 v_ArrVal_2254)) (.cse160 (select (select .cse159 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse162 (select (select (store .cse163 .cse160 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse158 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= (select (select (store .cse159 .cse160 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse161) (< .cse162 .cse7) (< .cse162 (+ (select (select .cse163 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse161)))))) (forall ((v_ArrVal_2252 (Array Int Int))) (let ((.cse166 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse166 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (< 0 (+ 5 (select (select (let ((.cse168 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse167 (select (select .cse168 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (store (store .cse166 .cse167 v_prenex_11) (select (select (store .cse168 .cse167 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_prenex_10))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse170 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse171 (select (select .cse170 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse173 (store .cse170 .cse171 v_ArrVal_2253))) (let ((.cse172 (select (select .cse173 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse169 (select (select (store .cse173 .cse172 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse169) (= .cse169 (select (select (store .cse170 .cse171 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (= .cse169 .cse172)))))))) .cse17) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse180 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse175 (select (select .cse180 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse179 (store .cse180 .cse175 v_ArrVal_2253))) (let ((.cse178 (select (select .cse179 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse174 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252)) (.cse176 (select (select (store .cse180 .cse175 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse177 (select (select (store .cse179 .cse178 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< 0 (+ 5 (select (select (store (store .cse174 .cse175 v_prenex_11) .cse176 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse174 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse177 .cse176) (= .cse178 .cse176) (= .cse177 .cse178)))))))) (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse185 (select (select .cse184 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse186 (store .cse184 .cse185 v_ArrVal_2253))) (let ((.cse183 (select (select .cse186 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse181 (select (select (store .cse186 .cse183 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (.cse182 (select (select (store .cse184 .cse185 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse181) (= .cse181 .cse182) (= .cse183 .cse182)))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse187 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse187 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (let ((.cse188 (store .cse187 .cse185 v_ArrVal_2254))) (< (select (select (store .cse188 .cse183 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) (+ (select (select .cse188 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse183))))))) (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse193 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse192 (select (select .cse193 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse195 (store .cse193 .cse192 v_ArrVal_2253))) (let ((.cse194 (select (select .cse195 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse189 (select (select (store .cse195 .cse194 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse189) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse190 (select (select (store .cse193 .cse192 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= .cse189 .cse190) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse191 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse191 .cse192 v_prenex_11) .cse190 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse191 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse190)))) (= .cse189 .cse194)))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse197 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse198 (select (select .cse197 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse199 (select (select (store .cse197 .cse198 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (= (select (select (let ((.cse196 (store .cse197 .cse198 v_ArrVal_2253))) (store .cse196 (select (select .cse196 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_ArrVal_2255)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse199)) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse200 .cse198 v_prenex_11) .cse199 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse200 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse199)))))) (forall ((v_ArrVal_2252 (Array Int Int))) (let ((.cse201 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse201 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse206 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse202 (select (select .cse206 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse203 (select (select (store .cse206 .cse202 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (< 0 (+ 5 (select (select (store (store .cse201 .cse202 v_prenex_11) .cse203 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (forall ((v_ArrVal_2253 (Array Int Int))) (let ((.cse204 (store .cse206 .cse202 v_ArrVal_2253))) (let ((.cse205 (select (select .cse204 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store .cse204 .cse205 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse205))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse203))))))))) (forall ((v_ArrVal_2252 (Array Int Int))) (let ((.cse207 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse207 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse210 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse211 (select (select .cse210 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse209 (store .cse207 .cse211 v_ArrVal_2254))) (let ((.cse208 (select (select (store .cse209 (select (select (store .cse210 .cse211 v_ArrVal_2253) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< .cse208 .cse7) (< .cse208 (+ (select (select .cse209 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))))))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse218 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse214 (select (select .cse218 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse217 (store .cse218 .cse214 v_ArrVal_2253))) (let ((.cse216 (select (select .cse217 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse213 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252)) (.cse215 (select (select (store .cse218 .cse214 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse212 (select (select (store .cse217 .cse216 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse212) (< 0 (+ 5 (select (select (store (store .cse213 .cse214 v_prenex_11) .cse215 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse213 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse212 .cse215) (= .cse216 .cse215) (= .cse212 .cse216)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse225 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse222 (select (select .cse225 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse224 (store .cse225 .cse222 v_ArrVal_2253))) (let ((.cse223 (select (select .cse224 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse219 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252)) (.cse221 (select (select (store .cse225 .cse222 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse220 (select (select (store .cse224 .cse223 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse219 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse220 .cse221) (< (select (select (store (store .cse219 .cse222 v_ArrVal_2254) .cse223 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) .cse7) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse223) (= .cse223 .cse221) (= .cse220 .cse223)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse229 (select (select .cse228 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse233 (store .cse228 .cse229 v_ArrVal_2253)) (.cse226 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse231 (store .cse226 .cse229 v_ArrVal_2254)) (.cse232 (select (select .cse233 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse230 (select (select (store .cse231 .cse232 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (.cse227 (select (select (store .cse233 .cse232 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse226 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse227 (select (select (store .cse228 .cse229 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (< .cse230 .cse7) (< .cse230 (+ (select (select .cse231 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)) (= .cse227 .cse232)))))))) (forall ((v_ArrVal_2252 (Array Int Int))) (let ((.cse234 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse234 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse235 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse236 (select (select .cse235 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store .cse235 .cse236 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse237 (store .cse235 .cse236 v_ArrVal_2253))) (let ((.cse238 (select (select .cse237 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store .cse237 .cse238 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse238) (let ((.cse239 (store .cse234 .cse236 v_ArrVal_2254))) (< (select (select (store .cse239 .cse238 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) (+ (select (select .cse239 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13)))))))))))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse244 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse245 (select (select .cse244 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse243 (store .cse244 .cse245 v_ArrVal_2253))) (let ((.cse242 (select (select .cse243 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse241 (select (select (store .cse244 .cse245 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse240 (select (select (store .cse243 .cse242 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse240) (= .cse240 .cse241) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse241) (= .cse240 .cse242)))))))) .cse17) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse251 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse250 (select (select .cse251 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse249 (select (select (store .cse251 .cse250 v_ArrVal_2253) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse246 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse248 (store .cse246 .cse250 v_ArrVal_2254))) (let ((.cse247 (select (select (store .cse248 .cse249 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (< (select (select .cse246 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (< .cse247 .cse7) (< .cse247 (+ (select (select .cse248 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))))))) (= .cse249 (select (select (store .cse251 .cse250 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse256 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse257 (select (select .cse256 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse253 (select (select (store .cse256 .cse257 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse255 (store .cse256 .cse257 v_ArrVal_2253))) (let ((.cse254 (select (select .cse255 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse252 (select (select (store .cse255 .cse254 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse252 .cse253) (= .cse252 .cse254)))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse258 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse258 .cse257 v_prenex_11) .cse253 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse258 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse253)))))) (forall ((v_ArrVal_2252 (Array Int Int))) (let ((.cse259 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< (select (select .cse259 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse265 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse263 (select (select .cse265 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse264 (store .cse265 .cse263 v_ArrVal_2253))) (let ((.cse261 (select (select .cse264 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse260 (select (select (store .cse264 .cse261 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse260) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse261) (let ((.cse262 (store .cse259 .cse263 v_ArrVal_2254))) (< (select (select (store .cse262 .cse261 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) (+ (select (select .cse262 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))) (= .cse260 .cse261)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store .cse265 .cse263 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))))))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse272 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse267 (select (select .cse272 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse268 (select (select (store .cse272 .cse267 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse266 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse266 .cse267 v_prenex_11) .cse268 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse266 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse271 (store .cse272 .cse267 v_ArrVal_2253))) (let ((.cse270 (select (select .cse271 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse269 (select (select (store .cse271 .cse270 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse269 .cse268) (= .cse270 .cse268) (= .cse269 .cse270)))))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse268)))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse277 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse278 (select (select .cse277 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse274 (select (select (store .cse277 .cse278 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int))) (let ((.cse276 (store .cse277 .cse278 v_ArrVal_2253))) (let ((.cse275 (select (select .cse276 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse273 (select (select (store .cse276 .cse275 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= .cse273 .cse274) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse275) (= .cse273 .cse275)))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse279 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse279 .cse278 v_prenex_11) .cse274 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse279 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse274)))))) (forall ((v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse280 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse281 (select (select .cse280 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse282 (select (select (store .cse280 .cse281 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= (select (select (store .cse280 .cse281 v_ArrVal_2253) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) .cse282) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse283 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse283 .cse281 v_prenex_11) .cse282 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse283 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0))))))))) (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse289 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse288 (select (select .cse289 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse290 (store .cse289 .cse288 v_ArrVal_2253))) (let ((.cse286 (select (select .cse290 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse284 (select (select (store .cse290 .cse286 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse284) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse285 (select (select (store .cse289 .cse288 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= .cse284 .cse285) (= .cse286 .cse285) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse287 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse287 .cse288 v_prenex_11) .cse285 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse287 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse285)))) (= .cse284 .cse286)))))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse295 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse296 (select (select .cse295 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse294 (store .cse295 .cse296 v_ArrVal_2253))) (let ((.cse292 (select (select .cse294 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse293 (select (select (store .cse295 .cse296 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse291 (select (select (store .cse294 .cse292 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse291) (= .cse292 .cse293) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse293) (= .cse291 .cse292)))))))) .cse17) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse298 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse299 (select (select .cse298 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse301 (store .cse298 .cse299 v_ArrVal_2253))) (let ((.cse300 (select (select .cse301 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse297 (select (select (store .cse301 .cse300 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse297) (= .cse297 (select (select (store .cse298 .cse299 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse300) (= .cse297 .cse300)))))))) .cse17) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse304 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse305 (select (select .cse304 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse309 (store .cse304 .cse305 v_ArrVal_2253)) (.cse303 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (let ((.cse308 (store .cse303 .cse305 v_ArrVal_2254)) (.cse307 (select (select .cse309 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse302 (select (select (store .cse309 .cse307 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (.cse306 (select (select (store .cse308 .cse307 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse302) (< (select (select .cse303 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0) (= .cse302 (select (select (store .cse304 .cse305 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (< .cse306 .cse7) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse307) (< .cse306 (+ (select (select .cse308 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 13))))))))) (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse314 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2251))) (let ((.cse313 (select (select .cse314 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse316 (store .cse314 .cse313 v_ArrVal_2253))) (let ((.cse315 (select (select .cse316 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2255 (Array Int Int))) (let ((.cse310 (select (select (store .cse316 .cse315 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse310) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse311 (select (select (store .cse314 .cse313 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (or (= .cse310 .cse311) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (let ((.cse312 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2252))) (or (< 0 (+ 5 (select (select (store (store .cse312 .cse313 v_prenex_11) .cse311 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (< (select (select .cse312 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) 0)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse311)))) (= .cse310 .cse315)))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| .cse315)))))))))) is different from false [2025-03-17 12:07:21,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse16 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 9)) (.cse9 (forall ((v_ArrVal_2252 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0))) (.cse8 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse7 (store .cse4 .cse5 v_ArrVal_2253))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse1 (select (select (store .cse7 .cse3 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse0 (select (select (store .cse4 .cse5 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 .cse1) (= .cse2 .cse0)))))))) .cse9) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse11 (store .cse17 .cse18 v_ArrVal_2253)) (.cse15 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse14 (store .cse15 .cse18 v_ArrVal_2254)) (.cse12 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse10 (select (select (store .cse17 .cse18 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse13 (select (select (store .cse14 .cse12 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= .cse10 (select (select (store .cse11 .cse12 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (= .cse12 .cse10) (< .cse13 (+ (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse10) (< .cse13 .cse16)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse25 (store .cse24 .cse23 v_ArrVal_2253))) (let ((.cse21 (select (select .cse25 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse20 (select (select (store .cse25 .cse21 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse19 (select (select (store .cse24 .cse23 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse22 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse19 .cse20) (= .cse21 .cse20) (= .cse21 .cse19) (< 0 (+ (select (select (store (store .cse22 .cse23 v_prenex_11) .cse19 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse22 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse32 (store .cse31 .cse30 v_ArrVal_2253))) (let ((.cse28 (select (select .cse32 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse27 (select (select (store .cse32 .cse28 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse26 (select (select (store .cse31 .cse30 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse29 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse26 .cse27) (= .cse2 .cse27) (= .cse28 .cse27) (= .cse28 .cse26) (< 0 (+ (select (select (store (store .cse29 .cse30 v_prenex_11) .cse26 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse29 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse37 (select (select .cse38 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse39 (store .cse38 .cse37 v_ArrVal_2253))) (let ((.cse35 (select (select .cse39 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse34 (select (select (store .cse39 .cse35 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse33 (select (select (store .cse38 .cse37 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse36 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse33 .cse34) (= .cse2 .cse35) (= .cse2 .cse34) (< 0 (+ (select (select (store (store .cse36 .cse37 v_prenex_11) .cse33 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse36 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse44 (select (select .cse45 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse46 (store .cse45 .cse44 v_ArrVal_2253))) (let ((.cse42 (select (select .cse46 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse41 (select (select (store .cse46 .cse42 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse43 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse40 (select (select (store .cse45 .cse44 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse40 .cse41) (= .cse42 .cse41) (< 0 (+ (select (select (store (store .cse43 .cse44 v_prenex_11) .cse40 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse43 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse40)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse49 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse51 (select (select .cse50 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse48 (store .cse49 .cse51 v_ArrVal_2254))) (let ((.cse47 (select (select (store .cse48 (select (select (store .cse50 .cse51 v_ArrVal_2253) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (< .cse47 (+ (select (select .cse48 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse49 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< .cse47 .cse16))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse56 (select (select .cse57 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse58 (store .cse57 .cse56 v_ArrVal_2253))) (let ((.cse54 (select (select .cse58 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse53 (select (select (store .cse58 .cse54 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse52 (select (select (store .cse57 .cse56 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse55 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse52 .cse53) (= .cse2 .cse54) (= .cse54 .cse53) (= .cse54 .cse52) (< (select (select .cse55 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< (select (select (store (store .cse55 .cse56 v_ArrVal_2254) .cse54 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) .cse16)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse63 (select (select .cse64 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse65 (store .cse64 .cse63 v_ArrVal_2253))) (let ((.cse61 (select (select .cse65 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse60 (select (select (store .cse65 .cse61 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse62 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse59 (select (select (store .cse64 .cse63 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse59 .cse60) (= .cse61 .cse60) (= .cse61 .cse59) (< 0 (+ (select (select (store (store .cse62 .cse63 v_prenex_11) .cse59 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse62 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse59)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse70 (select (select .cse71 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse72 (store .cse71 .cse70 v_ArrVal_2253))) (let ((.cse68 (select (select .cse72 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse67 (select (select (store .cse72 .cse68 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse66 (select (select (store .cse71 .cse70 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse69 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse66 .cse67) (= .cse2 .cse67) (= .cse68 .cse67) (< 0 (+ (select (select (store (store .cse69 .cse70 v_prenex_11) .cse66 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse69 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse77 (select (select .cse78 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse79 (store .cse78 .cse77 v_ArrVal_2253))) (let ((.cse75 (select (select .cse79 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse74 (select (select (store .cse79 .cse75 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse73 (select (select (store .cse78 .cse77 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse76 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse73 .cse74) (= .cse2 .cse75) (= .cse2 .cse74) (= .cse75 .cse73) (< 0 (+ (select (select (store (store .cse76 .cse77 v_prenex_11) .cse73 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse76 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse84 (select (select .cse85 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse81 (store .cse85 .cse84 v_ArrVal_2253))) (let ((.cse80 (select (select .cse81 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse83 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse2 .cse80) (= .cse2 (select (select (store .cse81 .cse80 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (let ((.cse82 (store .cse83 .cse84 v_ArrVal_2254))) (< (select (select (store .cse82 .cse80 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) (+ (select (select .cse82 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13))) (< (select (select .cse83 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 (select (select (store .cse85 .cse84 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse92 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse93 (select (select .cse92 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse94 (store .cse92 .cse93 v_ArrVal_2253)) (.cse91 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse90 (store .cse91 .cse93 v_ArrVal_2254)) (.cse88 (select (select .cse94 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse87 (select (select (store .cse94 .cse88 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse86 (select (select (store .cse92 .cse93 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse89 (select (select (store .cse90 .cse88 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= .cse86 .cse87) (= .cse88 .cse87) (< .cse89 (+ (select (select .cse90 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse91 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse86) (< .cse89 .cse16)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse99 (select (select .cse100 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse101 (store .cse100 .cse99 v_ArrVal_2253))) (let ((.cse97 (select (select .cse101 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse96 (select (select (store .cse101 .cse97 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse98 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse95 (select (select (store .cse100 .cse99 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse95 .cse96) (= .cse2 .cse97) (= .cse2 .cse96) (< 0 (+ (select (select (store (store .cse98 .cse99 v_prenex_11) .cse95 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse98 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse95)))))))) (or .cse9 (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse105 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse106 (select (select .cse105 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse107 (store .cse105 .cse106 v_ArrVal_2253))) (let ((.cse103 (select (select .cse107 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse102 (select (select (store .cse107 .cse103 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse104 (select (select (store .cse105 .cse106 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse2 .cse102) (= .cse103 .cse102) (= .cse103 .cse104) (= .cse2 .cse104))))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse113 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse110 (select (select .cse109 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse112 (store .cse113 .cse110 v_ArrVal_2254)) (.cse108 (select (select (store .cse109 .cse110 v_ArrVal_2253) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse111 (select (select (store .cse112 .cse108 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= .cse108 (select (select (store .cse109 .cse110 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (< .cse111 (+ (select (select .cse112 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse113 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< .cse111 .cse16))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse119 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse118 (select (select .cse119 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse120 (store .cse119 .cse118 v_ArrVal_2253))) (let ((.cse116 (select (select .cse120 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse115 (select (select (store .cse120 .cse116 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse117 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse114 (select (select (store .cse119 .cse118 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse114 .cse115) (= .cse2 .cse116) (= .cse116 .cse115) (= .cse116 .cse114) (< 0 (+ (select (select (store (store .cse117 .cse118 v_prenex_11) .cse114 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse117 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse114)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse128 (select (select .cse127 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse122 (store .cse127 .cse128 v_ArrVal_2253)) (.cse126 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse125 (store .cse126 .cse128 v_ArrVal_2254)) (.cse123 (select (select .cse122 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse121 (select (select (store .cse127 .cse128 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse124 (select (select (store .cse125 .cse123 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= .cse121 (select (select (store .cse122 .cse123 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (< .cse124 (+ (select (select .cse125 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse126 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse121) (< .cse124 .cse16)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse129 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse130 (select (select .cse129 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse136 (store .cse129 .cse130 v_ArrVal_2253)) (.cse135 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse134 (store .cse135 .cse130 v_ArrVal_2254)) (.cse132 (select (select .cse136 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse131 (select (select (store .cse136 .cse132 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse133 (select (select (store .cse134 .cse132 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= (select (select (store .cse129 .cse130 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) .cse131) (= .cse2 .cse132) (= .cse2 .cse131) (< .cse133 (+ (select (select .cse134 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse135 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< .cse133 .cse16)))))))) (or .cse9 (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse140 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse141 (select (select .cse140 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse142 (store .cse140 .cse141 v_ArrVal_2253))) (let ((.cse139 (select (select .cse142 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse138 (select (select (store .cse142 .cse139 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse137 (select (select (store .cse140 .cse141 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse137 .cse138) (= .cse2 .cse139) (= .cse2 .cse138) (= .cse139 .cse138) (= .cse139 .cse137))))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse148 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse147 (select (select .cse148 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse149 (store .cse148 .cse147 v_ArrVal_2253))) (let ((.cse145 (select (select .cse149 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse144 (select (select (store .cse149 .cse145 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse146 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse143 (select (select (store .cse148 .cse147 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse143 .cse144) (= .cse2 .cse144) (= .cse145 .cse144) (< 0 (+ (select (select (store (store .cse146 .cse147 v_prenex_11) .cse143 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse146 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse143)))))))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse153 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse154 (select (select .cse153 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse155 (store .cse153 .cse154 v_ArrVal_2253))) (let ((.cse152 (select (select .cse155 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse151 (select (select (store .cse155 .cse152 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse150 (select (select (store .cse153 .cse154 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse150 .cse151) (= .cse2 .cse151) (= .cse152 .cse151) (= .cse152 .cse150) (= .cse2 .cse150)))))))) .cse9) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse161 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse159 (select (select .cse161 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse162 (store .cse161 .cse159 v_ArrVal_2253))) (let ((.cse156 (select (select .cse162 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse157 (select (select (store .cse162 .cse156 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse158 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse160 (select (select (store .cse161 .cse159 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse2 .cse156) (= .cse2 .cse157) (= .cse156 .cse157) (< 0 (+ (select (select (store (store .cse158 .cse159 v_prenex_11) .cse160 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse158 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse160)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse168 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse167 (select (select .cse168 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse169 (store .cse168 .cse167 v_ArrVal_2253))) (let ((.cse165 (select (select .cse169 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse164 (select (select (store .cse169 .cse165 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse166 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse163 (select (select (store .cse168 .cse167 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse163 .cse164) (= .cse2 .cse165) (= .cse2 .cse164) (= .cse165 .cse164) (< 0 (+ (select (select (store (store .cse166 .cse167 v_prenex_11) .cse163 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse166 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse163)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse170 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (< 0 (+ (select (select (let ((.cse172 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse171 (select (select .cse172 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (store (store .cse170 .cse171 v_prenex_11) (select (select (store .cse172 .cse171 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) v_prenex_10))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse170 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))) (or (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse173 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse174 (select (select .cse173 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse177 (store .cse173 .cse174 v_ArrVal_2253))) (let ((.cse176 (select (select .cse177 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse175 (select (select (store .cse177 .cse176 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= (select (select (store .cse173 .cse174 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) .cse175) (= .cse2 .cse175) (= .cse176 .cse175)))))))) .cse9) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse183 (select (select .cse184 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse179 (store .cse184 .cse183 v_ArrVal_2253))) (let ((.cse178 (select (select .cse179 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse182 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse180 (select (select (store .cse184 .cse183 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse2 .cse178) (= .cse2 (select (select (store .cse179 .cse178 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (= .cse178 .cse180) (let ((.cse181 (store .cse182 .cse183 v_ArrVal_2254))) (< (select (select (store .cse181 .cse178 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) (+ (select (select .cse181 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13))) (< (select (select .cse182 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse180))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse191 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse190 (select (select .cse191 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse192 (store .cse191 .cse190 v_ArrVal_2253))) (let ((.cse187 (select (select .cse192 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse186 (select (select (store .cse192 .cse187 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse189 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse185 (select (select (store .cse191 .cse190 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse185 .cse186) (= .cse2 .cse187) (= .cse2 .cse186) (let ((.cse188 (store .cse189 .cse190 v_ArrVal_2254))) (< (select (select (store .cse188 .cse187 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) (+ (select (select .cse188 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13))) (< (select (select .cse189 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse185)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse198 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse197 (select (select .cse198 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse199 (store .cse198 .cse197 v_ArrVal_2253))) (let ((.cse195 (select (select .cse199 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse194 (select (select (store .cse199 .cse195 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse196 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse193 (select (select (store .cse198 .cse197 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse193 .cse194) (= .cse2 .cse194) (= .cse195 .cse194) (= .cse195 .cse193) (< 0 (+ (select (select (store (store .cse196 .cse197 v_prenex_11) .cse193 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse196 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse193)))))))) (or .cse9 (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse201 (select (select .cse200 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse204 (store .cse200 .cse201 v_ArrVal_2253))) (let ((.cse203 (select (select .cse204 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse202 (select (select (store .cse204 .cse203 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= (select (select (store .cse200 .cse201 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) .cse202) (= .cse2 .cse203) (= .cse2 .cse202) (= .cse203 .cse202))))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse210 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse209 (select (select .cse210 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse211 (store .cse210 .cse209 v_ArrVal_2253))) (let ((.cse207 (select (select .cse211 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse206 (select (select (store .cse211 .cse207 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse208 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse205 (select (select (store .cse210 .cse209 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse205 .cse206) (= .cse2 .cse207) (= .cse207 .cse206) (< 0 (+ (select (select (store (store .cse208 .cse209 v_prenex_11) .cse205 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse208 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse205)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse217 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse216 (select (select .cse217 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse218 (store .cse217 .cse216 v_ArrVal_2253))) (let ((.cse214 (select (select .cse218 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse213 (select (select (store .cse218 .cse214 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse212 (select (select (store .cse217 .cse216 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse215 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse212 .cse213) (= .cse2 .cse214) (= .cse214 .cse213) (= .cse214 .cse212) (< (select (select .cse215 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse212) (< (select (select (store (store .cse215 .cse216 v_ArrVal_2254) .cse214 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) .cse16)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse219 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse220 (select (select .cse219 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse226 (store .cse219 .cse220 v_ArrVal_2253)) (.cse225 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse224 (store .cse225 .cse220 v_ArrVal_2254)) (.cse222 (select (select .cse226 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse221 (select (select (store .cse226 .cse222 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse223 (select (select (store .cse224 .cse222 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= (select (select (store .cse219 .cse220 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) .cse221) (= .cse222 .cse221) (< .cse223 (+ (select (select .cse224 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse225 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< .cse223 .cse16)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse232 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse231 (select (select .cse232 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse233 (store .cse232 .cse231 v_ArrVal_2253))) (let ((.cse227 (select (select .cse233 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse228 (select (select (store .cse233 .cse227 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse230 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse2 .cse227) (= .cse2 .cse228) (= .cse227 .cse228) (let ((.cse229 (store .cse230 .cse231 v_ArrVal_2254))) (< (select (select (store .cse229 .cse227 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) (+ (select (select .cse229 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13))) (< (select (select .cse230 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 (select (select (store .cse232 .cse231 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse240 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse241 (select (select .cse240 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse242 (store .cse240 .cse241 v_ArrVal_2253)) (.cse239 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse238 (store .cse239 .cse241 v_ArrVal_2254)) (.cse236 (select (select .cse242 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse235 (select (select (store .cse242 .cse236 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse234 (select (select (store .cse240 .cse241 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse237 (select (select (store .cse238 .cse236 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= .cse234 .cse235) (= .cse236 .cse235) (= .cse236 .cse234) (< .cse237 (+ (select (select .cse238 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse239 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< .cse237 .cse16)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse249 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse248 (select (select .cse249 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse250 (store .cse249 .cse248 v_ArrVal_2253))) (let ((.cse245 (select (select .cse250 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse244 (select (select (store .cse250 .cse245 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse243 (select (select (store .cse249 .cse248 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse247 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse243 .cse244) (= .cse2 .cse245) (= .cse2 .cse244) (= .cse245 .cse243) (let ((.cse246 (store .cse247 .cse248 v_ArrVal_2254))) (< (select (select (store .cse246 .cse245 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) (+ (select (select .cse246 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13))) (< (select (select .cse247 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (or .cse9 (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse254 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse255 (select (select .cse254 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse256 (store .cse254 .cse255 v_ArrVal_2253))) (let ((.cse253 (select (select .cse256 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse252 (select (select (store .cse256 .cse253 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse251 (select (select (store .cse254 .cse255 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse251 .cse252) (= .cse2 .cse252) (= .cse253 .cse252) (= .cse253 .cse251))))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse259 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse260 (select (select .cse259 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse258 (store .cse259 .cse260 v_ArrVal_2253))) (let ((.cse261 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse257 (select (select .cse258 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse2 .cse257) (= .cse257 (select (select (store .cse258 .cse257 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (= .cse257 (select (select (store .cse259 .cse260 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (< (select (select .cse261 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (< (select (select (store (store .cse261 .cse260 v_ArrVal_2254) .cse257 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) .cse16))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse267 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse266 (select (select .cse267 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse268 (store .cse267 .cse266 v_ArrVal_2253))) (let ((.cse264 (select (select .cse268 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse263 (select (select (store .cse268 .cse264 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse262 (select (select (store .cse267 .cse266 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse265 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse262 .cse263) (= .cse264 .cse263) (< 0 (+ (select (select (store (store .cse265 .cse266 v_prenex_11) .cse262 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse265 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse275 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse276 (select (select .cse275 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse277 (store .cse275 .cse276 v_ArrVal_2253)) (.cse274 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (let ((.cse273 (store .cse274 .cse276 v_ArrVal_2254)) (.cse271 (select (select .cse277 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse270 (select (select (store .cse277 .cse271 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse269 (select (select (store .cse275 .cse276 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse272 (select (select (store .cse273 .cse271 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8))) (or (= .cse269 .cse270) (= .cse271 .cse270) (= .cse271 .cse269) (< .cse272 (+ (select (select .cse273 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 13)) (< (select (select .cse274 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse269) (< .cse272 .cse16)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse283 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse281 (select (select .cse283 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse279 (store .cse283 .cse281 v_ArrVal_2253))) (let ((.cse278 (select (select .cse279 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse280 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse282 (select (select (store .cse283 .cse281 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse2 .cse278) (= .cse2 (select (select (store .cse279 .cse278 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (< 0 (+ (select (select (store (store .cse280 .cse281 v_prenex_11) .cse282 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse280 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse282))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse286 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse287 (select (select .cse286 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse288 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse284 (select (select (store .cse286 .cse287 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse284 (select (select (let ((.cse285 (store .cse286 .cse287 v_ArrVal_2253))) (store .cse285 (select (select .cse285 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) v_ArrVal_2255)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (< 0 (+ (select (select (store (store .cse288 .cse287 v_prenex_11) .cse284 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse288 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse284)))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse294 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse293 (select (select .cse294 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse290 (store .cse294 .cse293 v_ArrVal_2253))) (let ((.cse291 (select (select (store .cse294 .cse293 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse292 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse289 (select (select .cse290 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse2 .cse289) (= .cse289 (select (select (store .cse290 .cse289 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (= .cse289 .cse291) (< (select (select .cse292 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse291) (< (select (select (store (store .cse292 .cse293 v_ArrVal_2254) .cse289 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) .cse16))))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse295 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse296 (select (select .cse295 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse297 (select (select (store .cse295 .cse296 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse298 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= (select (select (store .cse295 .cse296 v_ArrVal_2253) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) .cse297) (< 0 (+ (select (select (store (store .cse298 .cse296 v_prenex_11) .cse297 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse298 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse304 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse303 (select (select .cse304 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse305 (store .cse304 .cse303 v_ArrVal_2253))) (let ((.cse301 (select (select .cse305 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse300 (select (select (store .cse305 .cse301 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse299 (select (select (store .cse304 .cse303 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse302 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252))) (or (= .cse299 .cse300) (= .cse2 .cse301) (= .cse301 .cse300) (< (select (select .cse302 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse299) (< (select (select (store (store .cse302 .cse303 v_ArrVal_2254) .cse301 v_ArrVal_2256) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) .cse16)))))))) (or .cse9 (forall ((v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse309 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse310 (select (select .cse309 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse311 (store .cse309 .cse310 v_ArrVal_2253))) (let ((.cse308 (select (select .cse311 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse307 (select (select (store .cse311 .cse308 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (.cse306 (select (select (store .cse309 .cse310 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse306 .cse307) (= .cse2 .cse308) (= .cse2 .cse307) (= .cse308 .cse307) (= .cse2 .cse306))))))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_2251))) (let ((.cse316 (select (select .cse317 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse313 (store .cse317 .cse316 v_ArrVal_2253))) (let ((.cse314 (select (select .cse313 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse315 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_2252)) (.cse312 (select (select (store .cse317 .cse316 v_prenex_12) |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (= .cse312 (select (select (store .cse313 .cse314 v_ArrVal_2255) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8)) (= .cse314 .cse312) (< 0 (+ (select (select (store (store .cse315 .cse316 v_prenex_11) .cse312 v_prenex_10) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse8) 5)) (< (select (select .cse315 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 0) (= .cse2 .cse312))))))))))) is different from false [2025-03-17 12:07:23,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:23,079 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 432 treesize of output 242 [2025-03-17 12:07:23,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:23,135 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 53487 treesize of output 42836 [2025-03-17 12:07:23,409 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 1613 treesize of output 1473 [2025-03-17 12:07:23,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:23,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1544 treesize of output 1340 [2025-03-17 12:07:23,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:23,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1332 treesize of output 1028 [2025-03-17 12:07:23,490 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 460 treesize of output 368 [2025-03-17 12:07:29,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:29,010 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 12:07:29,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:29,014 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 18 treesize of output 12 [2025-03-17 12:07:29,016 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 7 treesize of output 3 [2025-03-17 12:07:29,022 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,022 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 347 treesize of output 1 [2025-03-17 12:07:29,025 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,029 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,035 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,035 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 476 treesize of output 1 [2025-03-17 12:07:29,038 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,041 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,044 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,051 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,052 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 435 treesize of output 1 [2025-03-17 12:07:29,055 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,058 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:29,064 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 347 treesize of output 197 [2025-03-17 12:07:29,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:07:29,082 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 12:07:29,082 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 3666 treesize of output 2107 [2025-03-17 12:07:29,125 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 7 treesize of output 3 [2025-03-17 12:07:29,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:29,135 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 22 treesize of output 23 [2025-03-17 12:07:29,138 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:07:29,140 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 20 treesize of output 8 [2025-03-17 12:07:29,148 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,161 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,161 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 113 treesize of output 1 [2025-03-17 12:07:29,171 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,171 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 113 treesize of output 1 [2025-03-17 12:07:29,177 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,181 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,187 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,191 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,195 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,198 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,207 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,207 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 113 treesize of output 1 [2025-03-17 12:07:29,221 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,221 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 244 treesize of output 1 [2025-03-17 12:07:29,225 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,229 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,233 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,244 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,244 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 391 treesize of output 1 [2025-03-17 12:07:29,249 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,254 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,259 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,264 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,269 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,274 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,279 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,285 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,294 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,295 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 391 treesize of output 1 [2025-03-17 12:07:29,301 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,313 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,314 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 476 treesize of output 1 [2025-03-17 12:07:29,319 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,325 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,336 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:07:29,337 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 244 treesize of output 1 [2025-03-17 12:07:29,343 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,348 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,352 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,356 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,359 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,363 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:07:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652652615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:29,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2025-03-17 12:07:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539181229] [2025-03-17 12:07:29,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:29,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:07:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:29,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:07:29,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1725, Unknown=2, NotChecked=170, Total=2070 [2025-03-17 12:07:29,502 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 34 states, 33 states have (on average 2.696969696969697) internal successors, (89), 30 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:30,330 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2025-03-17 12:07:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:07:30,331 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.696969696969697) internal successors, (89), 30 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2025-03-17 12:07:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:30,331 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:07:30,331 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:07:30,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=272, Invalid=2386, Unknown=2, NotChecked=202, Total=2862 [2025-03-17 12:07:30,332 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:30,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 689 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:07:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:07:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 12:07:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.353658536585366) internal successors, (111), 98 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2025-03-17 12:07:30,336 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 49 [2025-03-17 12:07:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:30,336 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2025-03-17 12:07:30,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.696969696969697) internal successors, (89), 30 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:07:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2025-03-17 12:07:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:07:30,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:30,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:30,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 12:07:30,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:07:30,538 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:30,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1123431338, now seen corresponding path program 1 times [2025-03-17 12:07:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895643834] [2025-03-17 12:07:30,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:07:30,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:07:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:07:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895643834] [2025-03-17 12:07:30,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895643834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:30,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619112223] [2025-03-17 12:07:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:30,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:30,652 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:30,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:07:30,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:07:30,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:07:30,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:30,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:30,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:07:30,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:07:30,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:30,951 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:07:30,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-17 12:07:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:07:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619112223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:30,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:30,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-17 12:07:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233413985] [2025-03-17 12:07:30,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:30,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:07:30,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:30,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:07:30,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:07:30,971 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:31,132 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2025-03-17 12:07:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:07:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-17 12:07:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:31,133 INFO L225 Difference]: With dead ends: 113 [2025-03-17 12:07:31,133 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 12:07:31,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:07:31,134 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:31,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 188 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:07:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 12:07:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-17 12:07:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 105 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2025-03-17 12:07:31,140 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 50 [2025-03-17 12:07:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:31,140 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2025-03-17 12:07:31,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:07:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2025-03-17 12:07:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:07:31,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:31,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:31,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:07:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 12:07:31,341 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1123431337, now seen corresponding path program 1 times [2025-03-17 12:07:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108254913] [2025-03-17 12:07:31,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:31,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:07:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:07:31,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:31,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:07:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108254913] [2025-03-17 12:07:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108254913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156567164] [2025-03-17 12:07:31,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:31,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:31,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:31,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:31,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:07:31,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:07:31,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:07:31,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:31,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 12:07:31,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:07:31,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:32,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:07:32,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:07:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:07:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156567164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:32,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-17 12:07:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229553993] [2025-03-17 12:07:32,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:32,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 12:07:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:32,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 12:07:32,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:07:32,245 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:07:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:32,588 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2025-03-17 12:07:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:07:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2025-03-17 12:07:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:32,589 INFO L225 Difference]: With dead ends: 113 [2025-03-17 12:07:32,589 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 12:07:32,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:07:32,589 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:32,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 362 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:07:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 12:07:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-17 12:07:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2025-03-17 12:07:32,595 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 50 [2025-03-17 12:07:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:32,595 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2025-03-17 12:07:32,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 18 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:07:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2025-03-17 12:07:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:07:32,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:32,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:32,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:07:32,797 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 678260531, now seen corresponding path program 1 times [2025-03-17 12:07:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052058082] [2025-03-17 12:07:32,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:32,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:07:32,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:07:32,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 12:07:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052058082] [2025-03-17 12:07:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052058082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888402388] [2025-03-17 12:07:33,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:33,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:33,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:33,332 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:33,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:07:33,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:07:33,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:07:33,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:33,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:33,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:07:33,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:33,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:33,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:33,599 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:07:33,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:33,650 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:07:33,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:33,716 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:07:33,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:33,771 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:07:33,780 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 31 treesize of output 13 [2025-03-17 12:07:33,791 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-17 12:07:33,809 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:07:33,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:07:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2025-03-17 12:07:33,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:33,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2840) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 12:07:33,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2839 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2839))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2840)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 12:07:33,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2839 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2839))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2840)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 12:07:33,999 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-17 12:07:34,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2025-03-17 12:07:34,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2840 (Array Int Int)) (v_ArrVal_2839 (Array Int Int)) (v_ArrVal_2838 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2838))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2839)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2840)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2025-03-17 12:07:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888402388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:07:34,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:07:34,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 16] total 34 [2025-03-17 12:07:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974175456] [2025-03-17 12:07:34,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:34,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 12:07:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:34,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 12:07:34,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=772, Unknown=14, NotChecked=300, Total=1190 [2025-03-17 12:07:34,123 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 30 states have internal predecessors, (103), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 12:07:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:34,641 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-03-17 12:07:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:07:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 30 states have internal predecessors, (103), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 53 [2025-03-17 12:07:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:34,642 INFO L225 Difference]: With dead ends: 107 [2025-03-17 12:07:34,642 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 12:07:34,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=1172, Unknown=14, NotChecked=370, Total=1722 [2025-03-17 12:07:34,643 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:34,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 544 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 584 Invalid, 0 Unknown, 233 Unchecked, 0.3s Time] [2025-03-17 12:07:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 12:07:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 12:07:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2025-03-17 12:07:34,645 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 53 [2025-03-17 12:07:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:34,645 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2025-03-17 12:07:34,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 30 states have internal predecessors, (103), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 12:07:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2025-03-17 12:07:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:07:34,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:34,646 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:34,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 12:07:34,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:34,846 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 678260532, now seen corresponding path program 1 times [2025-03-17 12:07:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337287133] [2025-03-17 12:07:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:34,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:07:34,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:07:34,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:34,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337287133] [2025-03-17 12:07:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337287133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585688992] [2025-03-17 12:07:35,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:07:35,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:35,462 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:35,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 12:07:35,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:07:35,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:07:35,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:07:35,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:35,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 12:07:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:35,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:07:35,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:35,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:35,789 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:07:35,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:07:35,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:35,893 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 12:07:35,900 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 30 treesize of output 13 [2025-03-17 12:07:36,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:36,002 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 12:07:36,006 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 30 treesize of output 13 [2025-03-17 12:07:36,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:07:36,076 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 12:07:36,082 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 30 treesize of output 13 [2025-03-17 12:07:36,099 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 42 treesize of output 18 [2025-03-17 12:07:36,103 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 9 treesize of output 3 [2025-03-17 12:07:36,204 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:07:36,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:36,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:07:36,237 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:36,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:07:36,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:36,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585688992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:36,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:07:36,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2025-03-17 12:07:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127164189] [2025-03-17 12:07:36,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:07:36,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:07:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:07:36,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:07:36,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1090, Unknown=1, NotChecked=66, Total=1260 [2025-03-17 12:07:36,388 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:07:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:07:37,350 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-03-17 12:07:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:07:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2025-03-17 12:07:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:07:37,351 INFO L225 Difference]: With dead ends: 102 [2025-03-17 12:07:37,351 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:07:37,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=2176, Unknown=1, NotChecked=96, Total=2550 [2025-03-17 12:07:37,352 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 66 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:07:37,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 722 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 800 Invalid, 0 Unknown, 67 Unchecked, 0.5s Time] [2025-03-17 12:07:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:07:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 12:07:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:07:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-03-17 12:07:37,355 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 53 [2025-03-17 12:07:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:07:37,355 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-03-17 12:07:37,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:07:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-03-17 12:07:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 12:07:37,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:07:37,356 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:07:37,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 12:07:37,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:37,557 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-03-17 12:07:37,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:07:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1576012614, now seen corresponding path program 2 times [2025-03-17 12:07:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:07:37,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809015529] [2025-03-17 12:07:37,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:07:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:07:37,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-17 12:07:37,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:07:37,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:07:37,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:07:39,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809015529] [2025-03-17 12:07:39,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809015529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:07:39,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616803186] [2025-03-17 12:07:39,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:07:39,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:07:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:07:39,342 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:07:39,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:07:39,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-17 12:07:39,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:07:39,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:07:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:07:39,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-17 12:07:39,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:07:39,818 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 [2025-03-17 12:07:39,823 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 [2025-03-17 12:07:39,859 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 [2025-03-17 12:07:39,867 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 [2025-03-17 12:07:39,875 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 [2025-03-17 12:07:39,881 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 [2025-03-17 12:07:39,888 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 [2025-03-17 12:07:39,894 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 [2025-03-17 12:07:39,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:07:39,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:07:40,007 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 22 [2025-03-17 12:07:40,023 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 [2025-03-17 12:07:40,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,117 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:07:40,117 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 73 treesize of output 54 [2025-03-17 12:07:40,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 40 treesize of output 38 [2025-03-17 12:07:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,369 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:07:40,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 79 [2025-03-17 12:07:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2025-03-17 12:07:40,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,553 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-03-17 12:07:40,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 93 [2025-03-17 12:07:40,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:07:40,580 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2025-03-17 12:07:40,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 63 treesize of output 47 [2025-03-17 12:07:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:07:40,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:07:41,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse3 (+ 20 |c_ULTIMATE.start_create_#t~mem12#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_3284 (Array Int Int))) (or (forall ((v_ArrVal_3286 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse2 .cse3 v_ArrVal_3286)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3284) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4)) 0)) (not (= v_ArrVal_3284 (store .cse4 .cse3 (select v_ArrVal_3284 .cse3)))))) (forall ((v_ArrVal_3284 (Array Int Int))) (or (not (= v_ArrVal_3284 (store .cse4 .cse3 (select v_ArrVal_3284 .cse3)))) (forall ((v_ArrVal_3286 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3284))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse2 .cse3 v_ArrVal_3286)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) 0)))))) is different from false [2025-03-17 12:07:41,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| .cse3)) (.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int)) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3284 .cse1)) v_ArrVal_3284)) (forall ((v_ArrVal_3286 Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_3284))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse1 v_ArrVal_3286)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| .cse6))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int)) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20))) (or (not (= (store .cse0 .cse7 (select v_ArrVal_3284 .cse7)) v_ArrVal_3284)) (forall ((v_ArrVal_3286 Int)) (= (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse7 v_ArrVal_3286)))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_3284) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| .cse6))))))) is different from false [2025-03-17 12:07:41,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (let ((.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse6 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.offset| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.base| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (or (forall ((v_ArrVal_3282 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse7 v_ArrVal_3282))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20))) (or (forall ((v_ArrVal_3286 Int)) (= (let ((.cse2 (store .cse0 .cse4 v_ArrVal_3284))) (select (select .cse2 (select (select (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3286)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4))) 0)) (not (= (store (select .cse0 .cse4) .cse5 (select v_ArrVal_3284 .cse5)) v_ArrVal_3284))))))))) (not (= v_ArrVal_3282 (store .cse9 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|) (forall ((v_ArrVal_3282 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse7 v_ArrVal_3282))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse14 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20))) (or (forall ((v_ArrVal_3286 Int)) (= (select (let ((.cse11 (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_3286)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6))) (+ (select (select (store .cse15 .cse13 v_ArrVal_3284) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4)) 0)) (not (= (store (select .cse15 .cse13) .cse14 (select v_ArrVal_3284 .cse14)) v_ArrVal_3284)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))) (not (= v_ArrVal_3282 (store .cse9 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)))))))))))) is different from false [2025-03-17 12:07:41,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse10 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse10 .cse9)) (.cse12 (select .cse8 .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|) (forall ((v_ArrVal_3282 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse1 (store .cse10 .cse9 (store .cse11 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse6 (store .cse8 .cse9 v_ArrVal_3282))) (let ((.cse3 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (or (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_3284 .cse3)) v_ArrVal_3284)) (forall ((v_ArrVal_3286 Int)) (= (select (let ((.cse4 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_ArrVal_3286)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse1 .cse2 v_ArrVal_3284) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))) (not (= (store .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)) v_ArrVal_3282)))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|) (forall ((v_ArrVal_3282 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse13 (store .cse10 .cse9 (store .cse11 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse17 (store .cse8 .cse9 v_ArrVal_3282))) (let ((.cse15 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20)) (.cse14 (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (or (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_3284 .cse15)) v_ArrVal_3284)) (forall ((v_ArrVal_3286 Int)) (= (let ((.cse16 (store .cse13 .cse14 v_ArrVal_3284))) (select (select .cse16 (select (select (store .cse17 .cse14 (store (select .cse17 .cse14) .cse15 v_ArrVal_3286)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse16 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))) (not (= (store .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)) v_ArrVal_3282))))))))))) is different from false [2025-03-17 12:07:42,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse7 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse12 (select |c_#memory_$Pointer$#0.base| .cse11)) (.cse14 (select |c_#memory_$Pointer$#0.offset| .cse11))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse0) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (let ((.cse13 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse11 (store .cse14 .cse13 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) |v_ULTIMATE.start_create_#t~mem10#1.offset_35|) (forall ((v_ArrVal_3282 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#0.base| .cse11 (store .cse12 .cse13 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse3 (store .cse1 .cse10 (store (select .cse1 .cse10) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3282))) (let ((.cse5 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20)) (.cse4 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (or (not (= (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3284 .cse5)) v_ArrVal_3284)) (forall ((v_ArrVal_3286 Int)) (= (select (let ((.cse6 (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_ArrVal_3286)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) (+ 4 (select (select (store .cse3 .cse4 v_ArrVal_3284) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) (not (= v_ArrVal_3282 (store (select .cse9 .cse10) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse0) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (let ((.cse23 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (let ((.cse15 (store |c_#memory_$Pointer$#0.offset| .cse11 (store .cse14 .cse23 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) |v_ULTIMATE.start_create_#t~mem10#1.offset_35|) (forall ((v_ArrVal_3282 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#0.base| .cse11 (store .cse12 .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (or (not (= v_ArrVal_3282 (store (select .cse16 .cse17) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse18 (store .cse15 .cse17 (store (select .cse15 .cse17) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse22 (store .cse16 .cse17 v_ArrVal_3282))) (let ((.cse20 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20)) (.cse19 (select (select .cse22 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (or (not (= (store (select .cse18 .cse19) .cse20 (select v_ArrVal_3284 .cse20)) v_ArrVal_3284)) (forall ((v_ArrVal_3286 Int)) (= (let ((.cse21 (store .cse18 .cse19 v_ArrVal_3284))) (select (select .cse21 (select (select (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 v_ArrVal_3286)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)) (+ 4 (select (select .cse21 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse18 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))))))))))))))))) is different from false [2025-03-17 12:07:42,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse13 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse7 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse14 (select .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (let ((.cse12 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (let ((.cse0 (store .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse14 .cse12 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_35|) (forall ((v_ArrVal_3282 (Array Int Int))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse11 .cse12 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse2 (store .cse0 .cse9 (store (select .cse0 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse4 (store .cse8 .cse9 v_ArrVal_3282))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse6 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20))) (or (forall ((v_ArrVal_3286 Int)) (= (let ((.cse3 (store .cse2 .cse5 v_ArrVal_3284))) (select (select .cse3 (select (select (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_3286)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4))) 0)) (not (= v_ArrVal_3284 (store (select .cse2 .cse5) .cse6 (select v_ArrVal_3284 .cse6))))))))))) (not (= v_ArrVal_3282 (store (select .cse8 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)))))))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_35| Int)) (let ((.cse23 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (let ((.cse22 (store .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse14 .cse23 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (forall ((v_ArrVal_3282 (Array Int Int))) (let ((.cse15 (store .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse11 .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_3282 (store (select .cse15 .cse16) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| (select v_ArrVal_3282 |v_ULTIMATE.start_create_#t~mem10#1.offset_35|)))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_34| Int) (v_ArrVal_3283 Int)) (let ((.cse21 (store .cse22 .cse16 (store (select .cse22 .cse16) |v_ULTIMATE.start_create_#t~mem10#1.offset_35| v_ArrVal_3283)))) (or (forall ((v_ArrVal_3284 (Array Int Int))) (let ((.cse18 (store .cse15 .cse16 v_ArrVal_3282))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse20 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_34| 20))) (or (forall ((v_ArrVal_3286 Int)) (= (select (let ((.cse17 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 v_ArrVal_3286)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) (+ (select (select (store .cse21 .cse19 v_ArrVal_3284) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4)) 0)) (not (= v_ArrVal_3284 (store (select .cse21 .cse19) .cse20 (select v_ArrVal_3284 .cse20)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_34| (select (select .cse21 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))))) (< (select (select .cse22 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_35|))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| |c_ULTIMATE.start_create_#t~ret8#1.offset|))))))) is different from false [2025-03-17 12:07:48,781 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 195 DAG size of output: 107 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-17 12:07:48,781 INFO L349 Elim1Store]: treesize reduction 4000, result has 29.1 percent of original size [2025-03-17 12:07:48,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 16117207 treesize of output 15191628