./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:51:43,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:51:43,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:51:43,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:51:43,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:51:43,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:51:43,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:51:43,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:51:43,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:51:43,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:51:43,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:51:43,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:51:43,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:51:43,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:51:43,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:51:43,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:51:43,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:51:43,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:51:43,850 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:51:43,850 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:51:43,850 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:51:43,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:51:43,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:51:43,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:51:43,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:51:43,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:51:43,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:51:43,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:51:43,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:51:43,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:51:43,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:51:43,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:51:43,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:51:43,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:51:43,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:51:43,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:51:43,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:51:43,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:51:43,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:51:43,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 [2024-11-19 06:51:44,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:51:44,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:51:44,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:51:44,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:51:44,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:51:44,150 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 [2024-11-19 06:51:45,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:51:46,014 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:51:46,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2024-11-19 06:51:46,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19735a087/29e4f2da596d4bed89fc330265d39c87/FLAGdcccce203 [2024-11-19 06:51:46,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19735a087/29e4f2da596d4bed89fc330265d39c87 [2024-11-19 06:51:46,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:51:46,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:51:46,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:51:46,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:51:46,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:51:46,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f133d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46, skipping insertion in model container [2024-11-19 06:51:46,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:51:46,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:51:46,450 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:51:46,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:51:46,540 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:51:46,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46 WrapperNode [2024-11-19 06:51:46,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:51:46,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:51:46,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:51:46,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:51:46,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,584 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 80 [2024-11-19 06:51:46,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:51:46,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:51:46,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:51:46,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:51:46,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,628 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]. [2024-11-19 06:51:46,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:51:46,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:51:46,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:51:46,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:51:46,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:51:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:46,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:51:46,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:51:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:51:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-19 06:51:46,728 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-19 06:51:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:51:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:51:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:51:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:51:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:51:46,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:51:46,833 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:51:46,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:51:47,213 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-19 06:51:47,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:51:47,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:51:47,227 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:51:47,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:47 BoogieIcfgContainer [2024-11-19 06:51:47,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:51:47,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:51:47,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:51:47,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:51:47,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:51:46" (1/3) ... [2024-11-19 06:51:47,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7444c548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:51:47, skipping insertion in model container [2024-11-19 06:51:47,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (2/3) ... [2024-11-19 06:51:47,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7444c548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:51:47, skipping insertion in model container [2024-11-19 06:51:47,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:47" (3/3) ... [2024-11-19 06:51:47,241 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-data.i [2024-11-19 06:51:47,259 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:51:47,259 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-19 06:51:47,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:51:47,323 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;@77a42892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:51:47,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-19 06:51:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 83 states have internal predecessors, (89), 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) [2024-11-19 06:51:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:51:47,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:47,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:51:47,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 43105657, now seen corresponding path program 1 times [2024-11-19 06:51:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:47,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122710132] [2024-11-19 06:51:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122710132] [2024-11-19 06:51:47,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122710132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:47,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407069707] [2024-11-19 06:51:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:47,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:47,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,591 INFO L87 Difference]: Start difference. First operand has 87 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 83 states have internal predecessors, (89), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-19 06:51:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:47,699 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-19 06:51:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:47,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-19 06:51:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:47,711 INFO L225 Difference]: With dead ends: 83 [2024-11-19 06:51:47,711 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 06:51:47,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,719 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:47,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 06:51:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 06:51:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 77 states have internal predecessors, (80), 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) [2024-11-19 06:51:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-19 06:51:47,766 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 5 [2024-11-19 06:51:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:47,767 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-19 06:51:47,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-19 06:51:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-19 06:51:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:51:47,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:47,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:51:47,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:51:47,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:47,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash 43105658, now seen corresponding path program 1 times [2024-11-19 06:51:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386294719] [2024-11-19 06:51:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:47,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386294719] [2024-11-19 06:51:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386294719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709704274] [2024-11-19 06:51:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:47,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:47,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,896 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-19 06:51:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:47,981 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-19 06:51:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-19 06:51:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:47,983 INFO L225 Difference]: With dead ends: 77 [2024-11-19 06:51:47,983 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 06:51:47,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,986 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 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 [2024-11-19 06:51:47,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 06:51:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 06:51:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 73 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) [2024-11-19 06:51:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-19 06:51:48,003 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 5 [2024-11-19 06:51:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,004 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-19 06:51:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-19 06:51:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-19 06:51:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:51:48,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:51:48,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash 188280013, now seen corresponding path program 1 times [2024-11-19 06:51:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429172198] [2024-11-19 06:51:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429172198] [2024-11-19 06:51:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429172198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:51:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827626333] [2024-11-19 06:51:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:48,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:51:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:51:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:51:48,273 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-19 06:51:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:48,445 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-19 06:51:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:51:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-19 06:51:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:48,450 INFO L225 Difference]: With dead ends: 76 [2024-11-19 06:51:48,451 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 06:51:48,451 INFO L431 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 [2024-11-19 06:51:48,454 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:48,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 174 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 06:51:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-11-19 06:51:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 67 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) [2024-11-19 06:51:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-19 06:51:48,467 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 13 [2024-11-19 06:51:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,468 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-19 06:51:48,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-19 06:51:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-19 06:51:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:51:48,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:48,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:51:48,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 188280014, now seen corresponding path program 1 times [2024-11-19 06:51:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295918753] [2024-11-19 06:51:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295918753] [2024-11-19 06:51:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295918753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:51:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126933759] [2024-11-19 06:51:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:51:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:51:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:51:48,765 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-19 06:51:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:48,890 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-11-19 06:51:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:51:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-19 06:51:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:48,892 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:51:48,893 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:51:48,893 INFO L431 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 [2024-11-19 06:51:48,894 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 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 [2024-11-19 06:51:48,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:51:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-11-19 06:51:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 65 states have internal predecessors, (68), 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) [2024-11-19 06:51:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-19 06:51:48,905 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 13 [2024-11-19 06:51:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,905 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-19 06:51:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-19 06:51:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-19 06:51:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:51:48,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,907 INFO L215 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] [2024-11-19 06:51:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:51:48,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1968389437, now seen corresponding path program 1 times [2024-11-19 06:51:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695323893] [2024-11-19 06:51:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:49,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695323893] [2024-11-19 06:51:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695323893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590206162] [2024-11-19 06:51:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:49,076 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-19 06:51:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:49,242 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2024-11-19 06:51:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 23 [2024-11-19 06:51:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:49,244 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:51:49,244 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 06:51:49,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:49,248 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:49,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 218 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 06:51:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-19 06:51:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.542857142857143) internal successors, (108), 89 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) [2024-11-19 06:51:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2024-11-19 06:51:49,259 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 23 [2024-11-19 06:51:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:49,260 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2024-11-19 06:51:49,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-19 06:51:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2024-11-19 06:51:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:51:49,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:49,261 INFO L215 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] [2024-11-19 06:51:49,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:51:49,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1968389436, now seen corresponding path program 1 times [2024-11-19 06:51:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:49,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73398011] [2024-11-19 06:51:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73398011] [2024-11-19 06:51:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73398011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:49,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:49,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:51:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69705477] [2024-11-19 06:51:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:49,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:49,642 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-19 06:51:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:49,800 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2024-11-19 06:51:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 23 [2024-11-19 06:51:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:49,803 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:51:49,803 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:51:49,803 INFO L431 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 [2024-11-19 06:51:49,804 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:49,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 266 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:51:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 06:51:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.52) internal successors, (114), 94 states have internal predecessors, (114), 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) [2024-11-19 06:51:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-11-19 06:51:49,811 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 23 [2024-11-19 06:51:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:49,811 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-11-19 06:51:49,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-19 06:51:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-11-19 06:51:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:51:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:49,813 INFO L215 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] [2024-11-19 06:51:49,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:51:49,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -890581727, now seen corresponding path program 1 times [2024-11-19 06:51:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115703222] [2024-11-19 06:51:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115703222] [2024-11-19 06:51:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115703222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:49,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:51:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178776696] [2024-11-19 06:51:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:49,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:49,942 INFO L87 Difference]: Start difference. First operand 99 states and 120 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) [2024-11-19 06:51:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:50,008 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2024-11-19 06:51:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:50,009 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 [2024-11-19 06:51:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:50,011 INFO L225 Difference]: With dead ends: 102 [2024-11-19 06:51:50,011 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 06:51:50,011 INFO L431 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 [2024-11-19 06:51:50,012 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:50,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 388 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 06:51:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-19 06:51:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.486842105263158) internal successors, (113), 95 states have internal predecessors, (113), 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) [2024-11-19 06:51:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-11-19 06:51:50,020 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 24 [2024-11-19 06:51:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:50,024 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-11-19 06:51:50,024 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) [2024-11-19 06:51:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2024-11-19 06:51:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:51:50,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:50,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:50,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:51:50,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:50,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash 223592766, now seen corresponding path program 1 times [2024-11-19 06:51:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63501579] [2024-11-19 06:51:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63501579] [2024-11-19 06:51:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63501579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377897480] [2024-11-19 06:51:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:50,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:50,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:51:50,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:51:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:51,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-19 06:51:51,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:51:51,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:51:51,154 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 19 treesize of output 18 [2024-11-19 06:51:51,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:51,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:51:51,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:51,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:51,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:51:51,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:51,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 23 treesize of output 11 [2024-11-19 06:51:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:51,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:51,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:51,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:51,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:51,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:51,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:51,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:51:51,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_264 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0) 0) (not (= v_ArrVal_264 (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 (select v_ArrVal_264 .cse1)))))) (forall ((v_ArrVal_263 Int)) (= 0 (select (select (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 v_ArrVal_263)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0))))) is different from false [2024-11-19 06:51:53,013 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 17 treesize of output 15 [2024-11-19 06:51:53,021 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 50 treesize of output 46 [2024-11-19 06:51:53,043 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 17 treesize of output 15 [2024-11-19 06:51:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:53,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377897480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:51:53,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:51:53,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 29 [2024-11-19 06:51:53,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190148197] [2024-11-19 06:51:53,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:51:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:51:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:53,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:51:53,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=672, Unknown=1, NotChecked=52, Total=812 [2024-11-19 06:51:53,079 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 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) [2024-11-19 06:51:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:53,525 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2024-11-19 06:51:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:51:53,526 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 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 27 [2024-11-19 06:51:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:53,526 INFO L225 Difference]: With dead ends: 102 [2024-11-19 06:51:53,526 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 06:51:53,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=776, Unknown=1, NotChecked=56, Total=930 [2024-11-19 06:51:53,528 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:53,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 918 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 43 Unchecked, 0.4s Time] [2024-11-19 06:51:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 06:51:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-19 06:51:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 97 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) [2024-11-19 06:51:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2024-11-19 06:51:53,533 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 27 [2024-11-19 06:51:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:53,533 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2024-11-19 06:51:53,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 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) [2024-11-19 06:51:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2024-11-19 06:51:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:51:53,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:53,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:53,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:51:53,738 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 [2024-11-19 06:51:53,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:53,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash -726274359, now seen corresponding path program 1 times [2024-11-19 06:51:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150639591] [2024-11-19 06:51:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:54,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:54,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150639591] [2024-11-19 06:51:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150639591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:54,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966391185] [2024-11-19 06:51:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:54,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:54,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:54,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:51:54,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:51:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:54,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:51:54,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:54,160 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 [2024-11-19 06:51:54,202 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:51:54,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:51:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:54,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966391185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:54,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:51:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-19 06:51:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591759403] [2024-11-19 06:51:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:51:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:51:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:51:54,208 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-11-19 06:51:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:54,264 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2024-11-19 06:51:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:51:54,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 28 [2024-11-19 06:51:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:54,265 INFO L225 Difference]: With dead ends: 102 [2024-11-19 06:51:54,265 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 06:51:54,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:51:54,266 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:54,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 103 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2024-11-19 06:51:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 06:51:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-19 06:51:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 97 states have internal predecessors, (114), 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) [2024-11-19 06:51:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2024-11-19 06:51:54,271 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 28 [2024-11-19 06:51:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:54,271 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2024-11-19 06:51:54,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-11-19 06:51:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2024-11-19 06:51:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:51:54,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:54,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:54,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:51:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 06:51:54,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash -726274358, now seen corresponding path program 1 times [2024-11-19 06:51:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518217551] [2024-11-19 06:51:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518217551] [2024-11-19 06:51:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518217551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959233302] [2024-11-19 06:51:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:54,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:54,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:54,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:51:54,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:51:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:54,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:51:54,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:55,003 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 [2024-11-19 06:51:55,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:55,049 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 [2024-11-19 06:51:55,059 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:51:55,059 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 [2024-11-19 06:51:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:55,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959233302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:55,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:51:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-19 06:51:55,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022452351] [2024-11-19 06:51:55,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:55,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:55,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:55,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:55,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=125, Unknown=1, NotChecked=22, Total=182 [2024-11-19 06:51:55,076 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2024-11-19 06:51:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:55,205 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-11-19 06:51:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:55,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 28 [2024-11-19 06:51:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:55,207 INFO L225 Difference]: With dead ends: 108 [2024-11-19 06:51:55,207 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:51:55,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=125, Unknown=1, NotChecked=22, Total=182 [2024-11-19 06:51:55,208 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:55,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 130 Unchecked, 0.1s Time] [2024-11-19 06:51:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:51:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-19 06:51:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 97 states have internal predecessors, (109), 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) [2024-11-19 06:51:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2024-11-19 06:51:55,217 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 28 [2024-11-19 06:51:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:55,217 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2024-11-19 06:51:55,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2024-11-19 06:51:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2024-11-19 06:51:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:51:55,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:55,218 INFO L215 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] [2024-11-19 06:51:55,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:51:55,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:55,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:55,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1658610170, now seen corresponding path program 1 times [2024-11-19 06:51:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:55,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761370090] [2024-11-19 06:51:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761370090] [2024-11-19 06:51:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761370090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:51:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35182676] [2024-11-19 06:51:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:55,524 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-11-19 06:51:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:55,672 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-11-19 06:51:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 28 [2024-11-19 06:51:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:55,673 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:51:55,673 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 06:51:55,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:55,674 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 76 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:55,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 217 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 06:51:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-11-19 06:51:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.411764705882353) internal successors, (120), 103 states have internal predecessors, (120), 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) [2024-11-19 06:51:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2024-11-19 06:51:55,683 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 28 [2024-11-19 06:51:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:55,684 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2024-11-19 06:51:55,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-11-19 06:51:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2024-11-19 06:51:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:51:55,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:55,685 INFO L215 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] [2024-11-19 06:51:55,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:51:55,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1658610169, now seen corresponding path program 1 times [2024-11-19 06:51:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645636786] [2024-11-19 06:51:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:55,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645636786] [2024-11-19 06:51:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645636786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:55,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:55,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:51:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625465538] [2024-11-19 06:51:55,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:55,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:51:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:51:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:55,896 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-11-19 06:51:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:56,077 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2024-11-19 06:51:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:51:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 28 [2024-11-19 06:51:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:56,078 INFO L225 Difference]: With dead ends: 113 [2024-11-19 06:51:56,078 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 06:51:56,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:56,079 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:56,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 273 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 06:51:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-19 06:51:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 108 states have internal predecessors, (126), 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) [2024-11-19 06:51:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2024-11-19 06:51:56,083 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 28 [2024-11-19 06:51:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:56,083 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2024-11-19 06:51:56,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-11-19 06:51:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2024-11-19 06:51:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:51:56,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:56,085 INFO L215 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] [2024-11-19 06:51:56,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:51:56,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:56,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 122690851, now seen corresponding path program 1 times [2024-11-19 06:51:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395126341] [2024-11-19 06:51:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395126341] [2024-11-19 06:51:56,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395126341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:56,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:56,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:51:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755947049] [2024-11-19 06:51:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:56,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:51:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:51:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:56,187 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-19 06:51:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:56,266 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2024-11-19 06:51:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:51:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 29 [2024-11-19 06:51:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:56,268 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:51:56,268 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:51:56,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:56,269 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:56,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 410 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:51:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-19 06:51:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 109 states have internal predecessors, (125), 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) [2024-11-19 06:51:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-19 06:51:56,274 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 29 [2024-11-19 06:51:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:56,274 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-19 06:51:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-19 06:51:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-19 06:51:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:51:56,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:56,275 INFO L215 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] [2024-11-19 06:51:56,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:51:56,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:56,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1605820231, now seen corresponding path program 1 times [2024-11-19 06:51:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:56,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116840629] [2024-11-19 06:51:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116840629] [2024-11-19 06:51:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116840629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514378690] [2024-11-19 06:51:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:56,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:56,511 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2024-11-19 06:51:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:56,631 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-19 06:51:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 31 [2024-11-19 06:51:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:56,633 INFO L225 Difference]: With dead ends: 113 [2024-11-19 06:51:56,633 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 06:51:56,634 INFO L431 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 [2024-11-19 06:51:56,634 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:56,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 06:51:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-19 06:51:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 108 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) [2024-11-19 06:51:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2024-11-19 06:51:56,637 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 31 [2024-11-19 06:51:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:56,638 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2024-11-19 06:51:56,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2024-11-19 06:51:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2024-11-19 06:51:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:51:56,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:56,639 INFO L215 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] [2024-11-19 06:51:56,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:51:56,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:56,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1605820230, now seen corresponding path program 1 times [2024-11-19 06:51:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:56,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523816742] [2024-11-19 06:51:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:51:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523816742] [2024-11-19 06:51:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523816742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:56,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498588057] [2024-11-19 06:51:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:56,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:56,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:56,769 INFO L87 Difference]: Start difference. First operand 113 states and 129 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) [2024-11-19 06:51:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:56,886 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2024-11-19 06:51:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:56,887 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 31 [2024-11-19 06:51:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:56,888 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:51:56,888 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:51:56,888 INFO L431 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 [2024-11-19 06:51:56,889 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 8 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 229 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 [2024-11-19 06:51:56,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 229 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:51:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:51:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 107 states have internal predecessors, (121), 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) [2024-11-19 06:51:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2024-11-19 06:51:56,892 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 31 [2024-11-19 06:51:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:56,893 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2024-11-19 06:51:56,893 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) [2024-11-19 06:51:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2024-11-19 06:51:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:51:56,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:56,897 INFO L215 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, 1] [2024-11-19 06:51:56,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:51:56,897 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1943242535, now seen corresponding path program 1 times [2024-11-19 06:51:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100377426] [2024-11-19 06:51:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:57,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100377426] [2024-11-19 06:51:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100377426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:57,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:51:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260417583] [2024-11-19 06:51:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:57,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:51:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:57,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:51:57,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:57,056 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2024-11-19 06:51:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:57,159 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2024-11-19 06:51:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:51:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 31 [2024-11-19 06:51:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:57,161 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:51:57,162 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 06:51:57,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:57,163 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 30 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:57,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 364 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 06:51:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-19 06:51:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 111 states have internal predecessors, (128), 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) [2024-11-19 06:51:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2024-11-19 06:51:57,167 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 31 [2024-11-19 06:51:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:57,167 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2024-11-19 06:51:57,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2024-11-19 06:51:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2024-11-19 06:51:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:51:57,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:57,168 INFO L215 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, 1, 1, 1, 1] [2024-11-19 06:51:57,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:51:57,168 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:51:57,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -725680917, now seen corresponding path program 1 times [2024-11-19 06:51:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504789650] [2024-11-19 06:51:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504789650] [2024-11-19 06:51:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504789650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988821835] [2024-11-19 06:51:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:57,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:57,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:57,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:51:57,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:51:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:58,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 06:51:58,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:58,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:51:58,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:51:58,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:58,066 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 19 treesize of output 18 [2024-11-19 06:51:58,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:58,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:58,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:58,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:58,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:58,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:58,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:51:58,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:51:58,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:51:58,465 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 [2024-11-19 06:51:58,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:51:58,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-19 06:51:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:58,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:51:58,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_928 Int)) (= (select (select (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|) .cse0 v_ArrVal_928)) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0) (not (= v_ArrVal_929 (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_929 .cse0)))))))) is different from false [2024-11-19 06:51:58,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_929 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0) (not (= (store (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| (select v_ArrVal_929 |c_ULTIMATE.start_create_~now~0#1.offset|)) .cse0 (select v_ArrVal_929 .cse0)) v_ArrVal_929)))) (forall ((v_ArrVal_928 Int) (v_ArrVal_927 Int)) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_927) .cse0 v_ArrVal_928)) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0)))) is different from false [2024-11-19 06:51:59,372 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 [2024-11-19 06:51:59,375 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 442 treesize of output 438 [2024-11-19 06:51:59,390 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 [2024-11-19 06:51:59,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:51:59,395 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:51:59,397 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 102 treesize of output 98 [2024-11-19 06:51:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:51:59,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988821835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:51:59,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:51:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 37 [2024-11-19 06:51:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79802420] [2024-11-19 06:51:59,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:51:59,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 06:51:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:59,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 06:51:59,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1090, Unknown=2, NotChecked=134, Total=1332 [2024-11-19 06:51:59,404 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 37 states, 37 states have (on average 2.189189189189189) internal successors, (81), 34 states have internal predecessors, (81), 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) [2024-11-19 06:52:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:00,064 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2024-11-19 06:52:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:52:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.189189189189189) internal successors, (81), 34 states have internal predecessors, (81), 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 34 [2024-11-19 06:52:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:00,066 INFO L225 Difference]: With dead ends: 119 [2024-11-19 06:52:00,066 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 06:52:00,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=1573, Unknown=2, NotChecked=162, Total=1892 [2024-11-19 06:52:00,067 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:00,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 850 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2024-11-19 06:52:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 06:52:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-19 06:52:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.336734693877551) internal successors, (131), 114 states have internal predecessors, (131), 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) [2024-11-19 06:52:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2024-11-19 06:52:00,071 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 34 [2024-11-19 06:52:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:00,071 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2024-11-19 06:52:00,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.189189189189189) internal successors, (81), 34 states have internal predecessors, (81), 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) [2024-11-19 06:52:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2024-11-19 06:52:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:52:00,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:00,072 INFO L215 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] [2024-11-19 06:52:00,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:00,273 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 [2024-11-19 06:52:00,273 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:00,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash -552420024, now seen corresponding path program 1 times [2024-11-19 06:52:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:00,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823429283] [2024-11-19 06:52:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823429283] [2024-11-19 06:52:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823429283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240891840] [2024-11-19 06:52:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:00,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:00,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:52:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:52:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:00,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:52:00,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:00,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:00,863 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 [2024-11-19 06:52:00,880 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 [2024-11-19 06:52:00,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:00,929 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 [2024-11-19 06:52:00,940 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 [2024-11-19 06:52:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:00,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:52:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240891840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:00,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:52:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2024-11-19 06:52:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904398822] [2024-11-19 06:52:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:52:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:52:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:52:00,945 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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) [2024-11-19 06:52:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:01,186 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-19 06:52:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:52:01,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 35 [2024-11-19 06:52:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:01,187 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:52:01,187 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:52:01,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:52:01,188 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:01,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 366 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:52:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-19 06:52:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 114 states have internal predecessors, (130), 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) [2024-11-19 06:52:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2024-11-19 06:52:01,194 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 35 [2024-11-19 06:52:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:01,194 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2024-11-19 06:52:01,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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) [2024-11-19 06:52:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2024-11-19 06:52:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:52:01,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:01,195 INFO L215 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] [2024-11-19 06:52:01,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:01,396 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 [2024-11-19 06:52:01,396 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -552420023, now seen corresponding path program 1 times [2024-11-19 06:52:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703163033] [2024-11-19 06:52:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:01,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703163033] [2024-11-19 06:52:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703163033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293268100] [2024-11-19 06:52:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:01,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:01,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:52:01,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:52:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:02,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:52:02,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:02,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:52:02,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:02,159 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 [2024-11-19 06:52:02,190 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 [2024-11-19 06:52:02,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:52:02,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:02,278 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 [2024-11-19 06:52:02,288 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 [2024-11-19 06:52:02,305 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 [2024-11-19 06:52:02,310 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 [2024-11-19 06:52:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:02,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:52:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293268100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:02,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:52:02,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-19 06:52:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384915005] [2024-11-19 06:52:02,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:52:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:02,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:52:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:52:02,340 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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) [2024-11-19 06:52:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:02,563 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2024-11-19 06:52:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:52:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 35 [2024-11-19 06:52:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:02,564 INFO L225 Difference]: With dead ends: 119 [2024-11-19 06:52:02,564 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 06:52:02,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:52:02,565 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 27 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:02,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 277 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 06:52:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-19 06:52:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.316326530612245) internal successors, (129), 114 states have internal predecessors, (129), 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) [2024-11-19 06:52:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2024-11-19 06:52:02,569 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 35 [2024-11-19 06:52:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:02,569 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2024-11-19 06:52:02,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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) [2024-11-19 06:52:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2024-11-19 06:52:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:52:02,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:02,570 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-19 06:52:02,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:02,771 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:02,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1021273378, now seen corresponding path program 1 times [2024-11-19 06:52:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303228105] [2024-11-19 06:52:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:52:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303228105] [2024-11-19 06:52:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303228105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460969570] [2024-11-19 06:52:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:02,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:02,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:52:02,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:52:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:03,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:52:03,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:03,166 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 [2024-11-19 06:52:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:52:03,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:03,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-19 06:52:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460969570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:03,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2024-11-19 06:52:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854430287] [2024-11-19 06:52:03,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:52:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:03,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:52:03,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:52:03,245 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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) [2024-11-19 06:52:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:03,409 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-19 06:52:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:52:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 35 [2024-11-19 06:52:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:03,410 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:52:03,410 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 06:52:03,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:52:03,411 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:03,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 06:52:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-19 06:52:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 99 states have internal predecessors, (113), 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) [2024-11-19 06:52:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2024-11-19 06:52:03,418 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 35 [2024-11-19 06:52:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:03,418 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2024-11-19 06:52:03,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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) [2024-11-19 06:52:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2024-11-19 06:52:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:52:03,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:03,419 INFO L215 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, 1] [2024-11-19 06:52:03,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:03,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:03,619 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:03,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1903135819, now seen corresponding path program 1 times [2024-11-19 06:52:03,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:03,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698690816] [2024-11-19 06:52:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698690816] [2024-11-19 06:52:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698690816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229711938] [2024-11-19 06:52:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:04,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:04,139 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) [2024-11-19 06:52:04,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:52:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:04,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 06:52:04,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:04,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:52:04,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:04,404 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 [2024-11-19 06:52:04,433 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 [2024-11-19 06:52:04,438 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 [2024-11-19 06:52:04,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:04,516 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 [2024-11-19 06:52:04,520 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 [2024-11-19 06:52:04,621 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:04,622 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 [2024-11-19 06:52:04,627 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 [2024-11-19 06:52:04,671 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 [2024-11-19 06:52:04,678 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 [2024-11-19 06:52:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:04,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:52:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229711938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:04,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:52:04,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-11-19 06:52:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724458305] [2024-11-19 06:52:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:04,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:52:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:52:04,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:52:04,699 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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) [2024-11-19 06:52:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:04,939 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-19 06:52:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:52:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 39 [2024-11-19 06:52:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:04,940 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:52:04,940 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:52:04,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:52:04,941 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:04,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 285 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:52:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:52:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 06:52:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 99 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) [2024-11-19 06:52:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-11-19 06:52:04,944 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 39 [2024-11-19 06:52:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:04,945 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-19 06:52:04,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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) [2024-11-19 06:52:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-11-19 06:52:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:52:04,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:04,945 INFO L215 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, 1] [2024-11-19 06:52:04,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:05,146 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,SelfDestructingSolverStorable20 [2024-11-19 06:52:05,147 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1903135818, now seen corresponding path program 1 times [2024-11-19 06:52:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700946951] [2024-11-19 06:52:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700946951] [2024-11-19 06:52:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700946951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966888342] [2024-11-19 06:52:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:05,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:05,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:05,500 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:52:05,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:52:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:05,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:52:05,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:05,720 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:05,721 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 [2024-11-19 06:52:05,741 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 [2024-11-19 06:52:05,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:05,783 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 [2024-11-19 06:52:05,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:05,835 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 [2024-11-19 06:52:05,843 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 [2024-11-19 06:52:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:05,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:52:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966888342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:05,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:52:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 19 [2024-11-19 06:52:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438253658] [2024-11-19 06:52:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:52:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:05,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:52:05,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:52:05,847 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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) [2024-11-19 06:52:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:06,041 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2024-11-19 06:52:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:52:06,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 39 [2024-11-19 06:52:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:06,044 INFO L225 Difference]: With dead ends: 104 [2024-11-19 06:52:06,044 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 06:52:06,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:52:06,045 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:06,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 310 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:52:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 06:52:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-19 06:52:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 99 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) [2024-11-19 06:52:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-11-19 06:52:06,048 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 39 [2024-11-19 06:52:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:06,048 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-11-19 06:52:06,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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) [2024-11-19 06:52:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-11-19 06:52:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:52:06,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:06,050 INFO L215 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] [2024-11-19 06:52:06,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:06,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:06,250 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:06,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1447824343, now seen corresponding path program 1 times [2024-11-19 06:52:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766393123] [2024-11-19 06:52:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:52:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766393123] [2024-11-19 06:52:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766393123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675463292] [2024-11-19 06:52:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:06,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:06,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:06,510 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) [2024-11-19 06:52:06,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:52:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:06,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 06:52:06,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:52:06,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:06,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:06,982 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 [2024-11-19 06:52:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:52:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675463292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:52:07,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:52:07,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 20 [2024-11-19 06:52:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12075819] [2024-11-19 06:52:07,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:52:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:52:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:52:07,091 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 21 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 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) [2024-11-19 06:52:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:07,303 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-19 06:52:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:52:07,303 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 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 49 [2024-11-19 06:52:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:07,304 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:52:07,304 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:52:07,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:52:07,305 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:07,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 368 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:52:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 06:52:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 99 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) [2024-11-19 06:52:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-19 06:52:07,311 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 49 [2024-11-19 06:52:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:07,311 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-19 06:52:07,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 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) [2024-11-19 06:52:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-19 06:52:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:52:07,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:07,313 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-19 06:52:07,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 06:52:07,513 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,SelfDestructingSolverStorable22 [2024-11-19 06:52:07,514 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -147699503, now seen corresponding path program 1 times [2024-11-19 06:52:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547268942] [2024-11-19 06:52:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547268942] [2024-11-19 06:52:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547268942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795930967] [2024-11-19 06:52:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:08,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:08,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:08,435 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) [2024-11-19 06:52:08,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:52:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:08,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-19 06:52:08,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:08,836 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:08,837 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 [2024-11-19 06:52:08,877 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 15 treesize of output 1 [2024-11-19 06:52:08,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:52:08,927 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 15 treesize of output 7 [2024-11-19 06:52:08,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:08,976 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-11-19 06:52:09,117 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-19 06:52:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2024-11-19 06:52:09,120 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 [2024-11-19 06:52:09,182 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:52:09,183 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 34 treesize of output 33 [2024-11-19 06:52:09,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:52:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:09,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:09,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2039) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2024-11-19 06:52:09,509 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 06:52:09,509 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 [2024-11-19 06:52:09,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (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_2038))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_2039)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))) is different from false [2024-11-19 06:52:09,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (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_2038))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2039)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))))) is different from false [2024-11-19 06:52:09,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_16| Int) (v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (or (let ((.cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store |c_#memory_$Pointer$#0.base| .cse4 (store (select |c_#memory_$Pointer$#0.base| .cse4) (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_16|) |c_ULTIMATE.start_create_~now~0#1.base|))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2038))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2039)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_16| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-19 06:52:09,669 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-19 06:52:09,669 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 2 case distinctions, treesize of input 406 treesize of output 384 [2024-11-19 06:52:09,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:09,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 457 treesize of output 459 [2024-11-19 06:52:09,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:09,718 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 356 treesize of output 324 [2024-11-19 06:52:09,730 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 316 treesize of output 284 [2024-11-19 06:52:09,964 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 [2024-11-19 06:52:09,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:09,970 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 32 treesize of output 28 [2024-11-19 06:52:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795930967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:10,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:10,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2024-11-19 06:52:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525463930] [2024-11-19 06:52:10,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-19 06:52:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 06:52:10,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1898, Unknown=20, NotChecked=364, Total=2450 [2024-11-19 06:52:10,108 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 34 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:52:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:10,792 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-19 06:52:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:52:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 34 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-19 06:52:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:10,793 INFO L225 Difference]: With dead ends: 109 [2024-11-19 06:52:10,793 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 06:52:10,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=2694, Unknown=20, NotChecked=436, Total=3422 [2024-11-19 06:52:10,795 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:10,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 892 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:52:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 06:52:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-19 06:52:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 103 states have internal predecessors, (116), 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) [2024-11-19 06:52:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-11-19 06:52:10,798 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 53 [2024-11-19 06:52:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:10,798 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-11-19 06:52:10,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 34 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:52:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-11-19 06:52:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:52:10,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:10,799 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-19 06:52:10,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 06:52:10,999 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,SelfDestructingSolverStorable23 [2024-11-19 06:52:10,999 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:11,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash -147699502, now seen corresponding path program 1 times [2024-11-19 06:52:11,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:11,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912197005] [2024-11-19 06:52:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912197005] [2024-11-19 06:52:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912197005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745679364] [2024-11-19 06:52:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:12,205 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) [2024-11-19 06:52:12,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 06:52:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:12,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-19 06:52:12,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:12,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:52:12,555 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:12,555 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 [2024-11-19 06:52:12,595 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 [2024-11-19 06:52:12,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:52:12,707 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:12,707 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 [2024-11-19 06:52:12,713 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 [2024-11-19 06:52:12,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:12,803 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 [2024-11-19 06:52:12,807 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 [2024-11-19 06:52:12,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:12,898 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 [2024-11-19 06:52:12,925 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 [2024-11-19 06:52:13,064 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 [2024-11-19 06:52:13,067 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 9 treesize of output 3 [2024-11-19 06:52:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:13,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:13,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2224) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))) (forall ((v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))))) is different from false [2024-11-19 06:52:13,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2221))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2222) .cse0 v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2224) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2222) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2221) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))))) is different from false [2024-11-19 06:52:13,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2221))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2222) .cse1 v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2224) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2222) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2221) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)))))) is different from false [2024-11-19 06:52:13,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2219))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2220) .cse0 v_ArrVal_2222) (select (select (store .cse1 .cse0 v_ArrVal_2221) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2223))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2219))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2221))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2220) .cse4 v_ArrVal_2222) .cse5 v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2224) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))))))))) is different from false [2024-11-19 06:52:13,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2219))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse1 v_ArrVal_2221))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2220) .cse1 v_ArrVal_2222) .cse2 v_ArrVal_2223) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2224) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2219))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2220) .cse7 v_ArrVal_2222) (select (select (store .cse8 .cse7 v_ArrVal_2221) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_ArrVal_2223))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)))))) is different from false [2024-11-19 06:52:13,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:13,554 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 177 treesize of output 178 [2024-11-19 06:52:13,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:13,559 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 167 treesize of output 108 [2024-11-19 06:52:13,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:13,584 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 8940 treesize of output 7673 [2024-11-19 06:52:13,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:13,853 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 16303 treesize of output 15840 [2024-11-19 06:52:14,001 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 1497 treesize of output 1409 [2024-11-19 06:52:14,019 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 1409 treesize of output 1385 [2024-11-19 06:52:14,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:14,048 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 1385 treesize of output 1117 [2024-11-19 06:52:14,071 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 584 treesize of output 552 [2024-11-19 06:52:14,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:14,097 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 1077 treesize of output 965 [2024-11-19 06:52:14,115 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 957 treesize of output 869 [2024-11-19 06:52:15,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:15,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 90 treesize of output 91 [2024-11-19 06:52:15,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:15,142 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 80 treesize of output 61 [2024-11-19 06:52:15,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:52:15,148 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 85 treesize of output 55 [2024-11-19 06:52:15,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:52:15,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:15,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 06:52:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745679364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:15,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2024-11-19 06:52:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710937743] [2024-11-19 06:52:15,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:15,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 06:52:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 06:52:15,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1805, Unknown=13, NotChecked=450, Total=2450 [2024-11-19 06:52:15,278 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 37 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 33 states have internal predecessors, (96), 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) [2024-11-19 06:52:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:16,172 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-11-19 06:52:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:52:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 33 states have internal predecessors, (96), 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 53 [2024-11-19 06:52:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:16,174 INFO L225 Difference]: With dead ends: 109 [2024-11-19 06:52:16,174 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 06:52:16,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=278, Invalid=2591, Unknown=13, NotChecked=540, Total=3422 [2024-11-19 06:52:16,175 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:16,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1032 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:52:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 06:52:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-19 06:52:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 103 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) [2024-11-19 06:52:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2024-11-19 06:52:16,179 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 53 [2024-11-19 06:52:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:16,179 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2024-11-19 06:52:16,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 33 states have internal predecessors, (96), 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) [2024-11-19 06:52:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2024-11-19 06:52:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:52:16,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:16,180 INFO L215 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, 1] [2024-11-19 06:52:16,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 06:52:16,385 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,SelfDestructingSolverStorable24 [2024-11-19 06:52:16,386 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:16,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash 648567190, now seen corresponding path program 1 times [2024-11-19 06:52:16,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313829477] [2024-11-19 06:52:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:52:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313829477] [2024-11-19 06:52:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313829477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601583076] [2024-11-19 06:52:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:17,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:17,034 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) [2024-11-19 06:52:17,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 06:52:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:17,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:52:17,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:17,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:17,326 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 [2024-11-19 06:52:17,346 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 [2024-11-19 06:52:17,384 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:17,384 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 [2024-11-19 06:52:17,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:17,426 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 [2024-11-19 06:52:17,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:17,472 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 [2024-11-19 06:52:17,480 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 [2024-11-19 06:52:17,493 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 [2024-11-19 06:52:17,511 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:52:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:52:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2024-11-19 06:52:17,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:17,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (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_2458))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2459)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 06:52:17,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (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_2458))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2459)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 06:52:17,744 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-19 06:52:17,744 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 [2024-11-19 06:52:17,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (Array Int Int)) (v_ArrVal_2457 (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_2457))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2458)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2459)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2024-11-19 06:52:17,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2459 (Array Int Int)) (v_ArrVal_2458 (Array Int Int)) (v_ArrVal_2457 (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 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2457))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2458)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2459)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-19 06:52:17,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:17,768 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 88 treesize of output 59 [2024-11-19 06:52:17,774 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 4062 treesize of output 3528 [2024-11-19 06:52:17,810 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 150 treesize of output 118 [2024-11-19 06:52:17,815 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 118 treesize of output 106 [2024-11-19 06:52:17,819 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 106 treesize of output 82 [2024-11-19 06:52:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:17,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601583076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:52:17,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:52:17,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 33 [2024-11-19 06:52:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053761920] [2024-11-19 06:52:17,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:17,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 06:52:17,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 06:52:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=708, Unknown=18, NotChecked=290, Total=1122 [2024-11-19 06:52:17,909 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 34 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 30 states have internal predecessors, (100), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:52:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:18,388 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-19 06:52:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:52:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 30 states have internal predecessors, (100), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-11-19 06:52:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:18,390 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:52:18,390 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:52:18,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1091, Unknown=18, NotChecked=360, Total=1640 [2024-11-19 06:52:18,391 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:18,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 652 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 574 Invalid, 0 Unknown, 238 Unchecked, 0.3s Time] [2024-11-19 06:52:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:52:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-19 06:52:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 100 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) [2024-11-19 06:52:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-19 06:52:18,394 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 54 [2024-11-19 06:52:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:18,395 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-19 06:52:18,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 30 states have internal predecessors, (100), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:52:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-19 06:52:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:52:18,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:18,396 INFO L215 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, 1] [2024-11-19 06:52:18,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:18,599 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,SelfDestructingSolverStorable25 [2024-11-19 06:52:18,600 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:18,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 648567191, now seen corresponding path program 1 times [2024-11-19 06:52:18,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:18,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958693389] [2024-11-19 06:52:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:18,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958693389] [2024-11-19 06:52:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958693389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969504372] [2024-11-19 06:52:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:19,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:19,489 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) [2024-11-19 06:52:19,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 06:52:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:19,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 06:52:19,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:19,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:19,807 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 [2024-11-19 06:52:19,834 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 [2024-11-19 06:52:19,837 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 [2024-11-19 06:52:19,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:19,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 81 treesize of output 74 [2024-11-19 06:52:19,922 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 49 treesize of output 30 [2024-11-19 06:52:20,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:20,033 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 81 treesize of output 74 [2024-11-19 06:52:20,039 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 49 treesize of output 30 [2024-11-19 06:52:20,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:20,103 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 81 treesize of output 74 [2024-11-19 06:52:20,106 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 49 treesize of output 30 [2024-11-19 06:52:20,124 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 50 treesize of output 26 [2024-11-19 06:52:20,126 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 32 treesize of output 14 [2024-11-19 06:52:20,190 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 [2024-11-19 06:52:20,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:20,214 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 [2024-11-19 06:52:20,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:20,222 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 [2024-11-19 06:52:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-19 06:52:20,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969504372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:20,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-11-19 06:52:20,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26211023] [2024-11-19 06:52:20,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:20,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:52:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:52:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=892, Unknown=1, NotChecked=60, Total=1056 [2024-11-19 06:52:20,357 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 25 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:52:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:21,073 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-11-19 06:52:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:52:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 25 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2024-11-19 06:52:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:21,075 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:52:21,075 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:52:21,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=1582, Unknown=1, NotChecked=82, Total=1892 [2024-11-19 06:52:21,075 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:21,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 869 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 846 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2024-11-19 06:52:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:52:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 06:52:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.2298850574712643) 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) [2024-11-19 06:52:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2024-11-19 06:52:21,078 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 54 [2024-11-19 06:52:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-11-19 06:52:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 25 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:52:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2024-11-19 06:52:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:52:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:21,079 INFO L215 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, 1, 1, 1, 1] [2024-11-19 06:52:21,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 06:52:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:21,283 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash -283768620, now seen corresponding path program 1 times [2024-11-19 06:52:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606132997] [2024-11-19 06:52:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:52:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606132997] [2024-11-19 06:52:21,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606132997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304526743] [2024-11-19 06:52:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:21,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:21,546 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) [2024-11-19 06:52:21,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 06:52:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:21,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:52:21,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:52:22,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:22,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:22,187 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 15 treesize of output 19 [2024-11-19 06:52:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:52:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304526743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:52:22,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:52:22,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2024-11-19 06:52:22,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146065413] [2024-11-19 06:52:22,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:22,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:52:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:22,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:52:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:52:22,265 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 22 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 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) [2024-11-19 06:52:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:22,574 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-19 06:52:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:52:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 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 54 [2024-11-19 06:52:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:22,576 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:52:22,576 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:52:22,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:52:22,577 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:22,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 496 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:52:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2024-11-19 06:52:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 95 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) [2024-11-19 06:52:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-11-19 06:52:22,580 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 54 [2024-11-19 06:52:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:22,580 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-11-19 06:52:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 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) [2024-11-19 06:52:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-11-19 06:52:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 06:52:22,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:22,581 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2024-11-19 06:52:22,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 06:52:22,786 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-19 06:52:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash 275484748, now seen corresponding path program 2 times [2024-11-19 06:52:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417596808] [2024-11-19 06:52:22,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:52:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:22,829 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:52:22,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:52:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:25,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417596808] [2024-11-19 06:52:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417596808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509617025] [2024-11-19 06:52:25,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:52:25,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:25,106 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) [2024-11-19 06:52:25,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 06:52:25,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:52:25,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:52:25,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-19 06:52:25,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:25,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:52:25,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:52:25,769 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 19 treesize of output 18 [2024-11-19 06:52:25,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:52:25,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:52:25,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:52:25,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:52:25,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:52:25,849 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:25,849 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 [2024-11-19 06:52:25,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 06:52:25,878 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 34 treesize of output 36 [2024-11-19 06:52:25,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:25,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:52:25,993 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 84 treesize of output 61 [2024-11-19 06:52:26,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,016 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-19 06:52:26,016 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 51 treesize of output 52 [2024-11-19 06:52:26,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,279 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:52:26,279 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 122 treesize of output 86 [2024-11-19 06:52:26,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,296 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:52:26,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2024-11-19 06:52:26,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,497 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-19 06:52:26,498 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 130 treesize of output 100 [2024-11-19 06:52:26,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:26,531 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2024-11-19 06:52:26,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 61 [2024-11-19 06:52:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:26,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:27,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse1 (+ 20 |c_ULTIMATE.start_create_#t~mem12#1.offset|))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3076 .cse1)) v_ArrVal_3076)) (forall ((v_ArrVal_3075 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3076))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse4 .cse1 v_ArrVal_3075)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)) 0)))) (forall ((v_ArrVal_3076 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3076 .cse1)) v_ArrVal_3076)) (forall ((v_ArrVal_3075 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse4 .cse1 v_ArrVal_3075)))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3076) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) 0)))))) is different from false [2024-11-19 06:52:27,184 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.base| .cse3)) (.cse5 (select |c_#memory_$Pointer$#0.offset| .cse3)) (.cse4 (+ |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_27| Int)) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3076 .cse1)) v_ArrVal_3076)) (forall ((v_ArrVal_3075 Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| .cse3 (store .cse5 .cse1 v_ArrVal_3075)))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3076) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ 4 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)))) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (not (= (store .cse0 .cse7 (select v_ArrVal_3076 .cse7)) v_ArrVal_3076)) (forall ((v_ArrVal_3075 Int)) (= (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse3 v_ArrVal_3076))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ 4 (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 (store .cse5 .cse7 v_ArrVal_3075)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| .cse6))))))) is different from false [2024-11-19 06:52:27,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse8 (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)) (.cse6 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$#0.base| .cse8)) (.cse10 (select |c_#memory_$Pointer$#0.offset| .cse8))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|) (forall ((v_ArrVal_3071 (Array Int Int))) (or (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse8 v_ArrVal_3071))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse8 (store .cse9 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (let ((.cse3 (store .cse1 .cse5 (store (select .cse1 .cse5) .cse7 v_ArrVal_3075)))) (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_3076) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4))) 0)) (not (= (store (select .cse4 .cse5) .cse7 (select v_ArrVal_3076 .cse7)) v_ArrVal_3076))))))))) (not (= (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)) v_ArrVal_3071)))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|) (forall ((v_ArrVal_3071 (Array Int Int))) (or (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse8 v_ArrVal_3071))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#0.base| .cse8 (store .cse9 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse15 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_3076))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6))) (+ (select (select (store .cse11 .cse14 (store (select .cse11 .cse14) .cse15 v_ArrVal_3075)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4)) 0)) (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_3076 .cse15)) v_ArrVal_3076))))))))) (not (= (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)) v_ArrVal_3071)))))))))) is different from false [2024-11-19 06:52:27,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12))) (let ((.cse9 (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|))) (.cse8 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse12 (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|))) (.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse9 .cse10)) (.cse1 (select .cse12 .cse10)) (.cse0 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|) (forall ((v_ArrVal_3071 (Array Int Int))) (or (not (= v_ArrVal_3071 (store .cse1 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))) (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse6 (store .cse12 .cse10 v_ArrVal_3071))) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse4 (store .cse9 .cse10 (store .cse11 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3076))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))) (+ (select (select (store .cse6 .cse5 (store (select .cse6 .cse5) .cse7 v_ArrVal_3075)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)) 0)) (not (= v_ArrVal_3076 (store (select .cse4 .cse5) .cse7 (select v_ArrVal_3076 .cse7)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (or (forall ((v_ArrVal_3071 (Array Int Int))) (or (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse16 (store .cse12 .cse10 v_ArrVal_3071))) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse14 (store .cse9 .cse10 (store .cse11 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse17 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (let ((.cse13 (store .cse16 .cse15 (store (select .cse16 .cse15) .cse17 v_ArrVal_3075)))) (select (select .cse13 (select (select (store .cse14 .cse15 v_ArrVal_3076) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (+ (select (select .cse13 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) 0)) (not (= v_ArrVal_3076 (store (select .cse14 .cse15) .cse17 (select v_ArrVal_3076 .cse17)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))))) (not (= v_ArrVal_3071 (store .cse1 |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))))) (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))))))) is different from false [2024-11-19 06:52:27,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |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|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse4 (+ |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_29| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_29| .cse0) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (let ((.cse13 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_29|))) (let ((.cse10 (store |c_#memory_$Pointer$#0.offset| .cse11 (store .cse14 .cse13 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (forall ((v_ArrVal_3071 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse11 (store .cse12 .cse13 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (or (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_3071))) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse2 (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse6 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse6 v_ArrVal_3075)))) (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_3076) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse1 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0)) (not (= (store (select .cse2 .cse3) .cse6 (select v_ArrVal_3076 .cse6)) v_ArrVal_3076)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))) (not (= v_ArrVal_3071 (store (select .cse10 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))))))) (< (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7) |v_ULTIMATE.start_create_#t~mem10#1.offset_28|))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_29| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_29| .cse0) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (let ((.cse23 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_29|))) (let ((.cse15 (store |c_#memory_$Pointer$#0.offset| .cse11 (store .cse14 .cse23 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (forall ((v_ArrVal_3071 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#0.base| .cse11 (store .cse12 .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse16 (select (select .cse22 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (or (not (= v_ArrVal_3071 (store (select .cse15 .cse16) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))) (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse20 (store .cse15 .cse16 v_ArrVal_3071))) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse18 (store .cse22 .cse16 (store (select .cse22 .cse16) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse21 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (select (let ((.cse17 (store .cse18 .cse19 v_ArrVal_3076))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store .cse20 .cse19 (store (select .cse20 .cse19) .cse21 v_ArrVal_3075)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0)) (not (= (store (select .cse18 .cse19) .cse21 (select v_ArrVal_3076 .cse21)) v_ArrVal_3076)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse20 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))))))) (< (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7) |v_ULTIMATE.start_create_#t~mem10#1.offset_28|))))))))))) is different from false [2024-11-19 06:52:28,299 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 ((.cse6 (+ |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_29| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_29| |c_ULTIMATE.start_create_#t~ret8#1.offset|) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (let ((.cse12 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_29|))) (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_28|) (forall ((v_ArrVal_3071 (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_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse2 (store .cse0 .cse9 v_ArrVal_3071))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse4 (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= 0 (let ((.cse3 (store .cse2 .cse5 (store (select .cse2 .cse5) .cse7 v_ArrVal_3075)))) (select (select .cse3 (select (select (store .cse4 .cse5 v_ArrVal_3076) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4))))) (not (= v_ArrVal_3076 (store (select .cse4 .cse5) .cse7 (select v_ArrVal_3076 .cse7))))))))))) (not (= v_ArrVal_3071 (store (select .cse0 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_28| Int)) (let ((.cse23 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_29|))) (let ((.cse15 (store .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse14 .cse23 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_28|) (forall ((v_ArrVal_3071 (Array Int Int))) (let ((.cse21 (store .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse11 .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (forall ((v_ArrVal_3073 Int) (|v_ULTIMATE.start_create_#t~mem12#1.offset_27| Int)) (let ((.cse19 (store .cse15 .cse22 v_ArrVal_3071))) (or (forall ((v_ArrVal_3076 (Array Int Int))) (let ((.cse17 (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| v_ArrVal_3073)))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse20 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_27| 20))) (or (forall ((v_ArrVal_3075 Int)) (= (select (let ((.cse16 (store .cse17 .cse18 v_ArrVal_3076))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6))) (+ (select (select (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_3075)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4)) 0)) (not (= v_ArrVal_3076 (store (select .cse17 .cse18) .cse20 (select v_ArrVal_3076 .cse20)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_27| (select (select .cse19 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))) (not (= v_ArrVal_3071 (store (select .cse15 .cse22) |v_ULTIMATE.start_create_#t~mem10#1.offset_28| (select v_ArrVal_3071 |v_ULTIMATE.start_create_#t~mem10#1.offset_28|)))))))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_29| |c_ULTIMATE.start_create_#t~ret8#1.offset|))))))) is different from false