./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:38:23,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:38:23,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:38:23,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:38:23,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:38:23,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:38:23,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:38:23,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:38:23,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:38:23,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:38:23,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:38:23,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:38:23,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:38:23,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:38:23,127 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:38:23,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:38:23,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:38:23,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:38:23,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:38:23,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:38:23,129 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:38:23,132 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:38:23,133 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:38:23,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:38:23,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:38:23,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:38:23,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:38:23,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:38:23,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:38:23,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:38:23,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:38:23,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:38:23,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:38:23,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:38:23,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:38:23,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:38:23,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:38:23,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:38:23,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:38:23,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:38:23,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:38:23,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:38:23,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2024-10-24 16:38:23,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:38:23,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:38:23,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:38:23,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:38:23,426 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:38:23,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-10-24 16:38:24,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:38:25,009 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:38:25,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2024-10-24 16:38:25,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79eed954/16be524fc5c1402fa5d5dafa3611762e/FLAGc450d08d1 [2024-10-24 16:38:25,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79eed954/16be524fc5c1402fa5d5dafa3611762e [2024-10-24 16:38:25,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:38:25,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:38:25,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:38:25,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:38:25,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:38:25,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4442eb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25, skipping insertion in model container [2024-10-24 16:38:25,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:38:25,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:38:25,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:38:25,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:38:25,450 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:38:25,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25 WrapperNode [2024-10-24 16:38:25,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:38:25,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:38:25,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:38:25,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:38:25,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,497 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2024-10-24 16:38:25,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:38:25,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:38:25,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:38:25,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:38:25,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,531 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-24 16:38:25,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:38:25,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:38:25,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:38:25,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:38:25,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (1/1) ... [2024-10-24 16:38:25,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:38:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:25,584 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-10-24 16:38:25,588 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-10-24 16:38:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:38:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:38:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:38:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:38:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:38:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:38:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:38:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:38:25,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:38:25,775 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:38:25,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:38:25,969 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-10-24 16:38:25,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:38:26,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:38:26,014 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-24 16:38:26,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:38:26 BoogieIcfgContainer [2024-10-24 16:38:26,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:38:26,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:38:26,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:38:26,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:38:26,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:38:25" (1/3) ... [2024-10-24 16:38:26,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa7f39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:38:26, skipping insertion in model container [2024-10-24 16:38:26,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:38:25" (2/3) ... [2024-10-24 16:38:26,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa7f39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:38:26, skipping insertion in model container [2024-10-24 16:38:26,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:38:26" (3/3) ... [2024-10-24 16:38:26,021 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2024-10-24 16:38:26,035 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:38:26,035 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-10-24 16:38:26,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:38:26,076 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;@520bbf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:38:26,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-24 16:38:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:38:26,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:26,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:38:26,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:26,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 5729997, now seen corresponding path program 1 times [2024-10-24 16:38:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:26,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052387869] [2024-10-24 16:38:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052387869] [2024-10-24 16:38:26,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052387869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:26,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:26,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:38:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055194665] [2024-10-24 16:38:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:26,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:38:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:38:26,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:38:26,385 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:26,461 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-24 16:38:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:38:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:38:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:26,469 INFO L225 Difference]: With dead ends: 48 [2024-10-24 16:38:26,470 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 16:38:26,471 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-10-24 16:38:26,475 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:26,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 16:38:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 16:38:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-10-24 16:38:26,527 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 4 [2024-10-24 16:38:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:26,528 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-10-24 16:38:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-10-24 16:38:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:38:26,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:26,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:38:26,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:38:26,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash 5729998, now seen corresponding path program 1 times [2024-10-24 16:38:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100897175] [2024-10-24 16:38:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100897175] [2024-10-24 16:38:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100897175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:38:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452603156] [2024-10-24 16:38:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:26,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:38:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:38:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:38:26,660 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:26,692 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-24 16:38:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:38:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:38:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:26,693 INFO L225 Difference]: With dead ends: 44 [2024-10-24 16:38:26,693 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 16:38:26,694 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-10-24 16:38:26,695 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:26,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 16:38:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 16:38:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-24 16:38:26,699 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 4 [2024-10-24 16:38:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:26,699 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-24 16:38:26,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-24 16:38:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:38:26,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:26,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:38:26,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:38:26,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:26,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1214179292, now seen corresponding path program 1 times [2024-10-24 16:38:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246603058] [2024-10-24 16:38:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:26,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:26,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246603058] [2024-10-24 16:38:26,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246603058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:26,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:38:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548744022] [2024-10-24 16:38:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:26,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:38:26,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:38:26,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:38:26,732 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:26,768 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-24 16:38:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:38:26,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:38:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:26,770 INFO L225 Difference]: With dead ends: 51 [2024-10-24 16:38:26,771 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:38:26,771 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-10-24 16:38:26,772 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:26,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:38:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-24 16:38:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-10-24 16:38:26,782 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 6 [2024-10-24 16:38:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:26,782 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-10-24 16:38:26,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-10-24 16:38:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:38:26,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:26,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:38:26,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:38:26,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1211564127, now seen corresponding path program 1 times [2024-10-24 16:38:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911145908] [2024-10-24 16:38:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911145908] [2024-10-24 16:38:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911145908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:38:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581833638] [2024-10-24 16:38:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:38:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:26,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:38:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:26,836 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:26,901 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-24 16:38:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:38:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:38:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:26,902 INFO L225 Difference]: With dead ends: 44 [2024-10-24 16:38:26,902 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 16:38:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:26,907 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:26,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 16:38:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 16:38:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.75) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-24 16:38:26,914 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 6 [2024-10-24 16:38:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-24 16:38:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-24 16:38:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:38:26,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:26,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:38:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:38:26,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:26,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1211564128, now seen corresponding path program 1 times [2024-10-24 16:38:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:26,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263389011] [2024-10-24 16:38:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:27,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263389011] [2024-10-24 16:38:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263389011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:38:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561070763] [2024-10-24 16:38:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:27,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:38:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:38:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:27,048 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:27,112 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-24 16:38:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:38:27,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:38:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:27,113 INFO L225 Difference]: With dead ends: 43 [2024-10-24 16:38:27,113 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 16:38:27,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:27,114 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:27,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 16:38:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-24 16:38:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-24 16:38:27,123 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 6 [2024-10-24 16:38:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:27,123 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-24 16:38:27,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-24 16:38:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:38:27,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:27,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:27,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:38:27,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:27,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash -797009581, now seen corresponding path program 1 times [2024-10-24 16:38:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841272105] [2024-10-24 16:38:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:27,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841272105] [2024-10-24 16:38:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841272105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:27,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170932681] [2024-10-24 16:38:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:27,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:27,192 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-10-24 16:38:27,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:38:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:27,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:38:27,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:27,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170932681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:27,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-24 16:38:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192584311] [2024-10-24 16:38:27,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:27,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:38:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:27,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:38:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:38:27,358 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:27,434 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-10-24 16:38:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:38:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 16:38:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:27,435 INFO L225 Difference]: With dead ends: 48 [2024-10-24 16:38:27,435 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 16:38:27,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:38:27,435 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:27,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 16:38:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 16:38:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-10-24 16:38:27,442 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2024-10-24 16:38:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:27,442 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-10-24 16:38:27,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-10-24 16:38:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:38:27,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:27,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:27,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:38:27,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 16:38:27,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:27,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1486240316, now seen corresponding path program 2 times [2024-10-24 16:38:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:27,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625446868] [2024-10-24 16:38:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:38:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:27,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625446868] [2024-10-24 16:38:27,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625446868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:38:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235134202] [2024-10-24 16:38:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:27,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:38:27,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:27,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:38:27,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:38:27,774 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:27,859 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-10-24 16:38:27,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:38:27,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 16:38:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:27,860 INFO L225 Difference]: With dead ends: 51 [2024-10-24 16:38:27,860 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:38:27,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:38:27,861 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:27,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:38:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:38:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-10-24 16:38:27,867 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2024-10-24 16:38:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:27,867 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-10-24 16:38:27,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-10-24 16:38:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:38:27,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:27,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:27,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:38:27,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:27,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1486240317, now seen corresponding path program 1 times [2024-10-24 16:38:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187437236] [2024-10-24 16:38:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187437236] [2024-10-24 16:38:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187437236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:38:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277780621] [2024-10-24 16:38:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:28,062 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:28,180 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-24 16:38:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:38:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 16:38:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:28,182 INFO L225 Difference]: With dead ends: 51 [2024-10-24 16:38:28,182 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:38:28,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:38:28,183 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:28,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 136 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:38:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:38:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-10-24 16:38:28,191 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2024-10-24 16:38:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:28,191 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-10-24 16:38:28,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-10-24 16:38:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:38:28,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:28,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:28,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:38:28,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1948397950, now seen corresponding path program 1 times [2024-10-24 16:38:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366985709] [2024-10-24 16:38:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:28,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:28,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366985709] [2024-10-24 16:38:28,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366985709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:28,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:38:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888223226] [2024-10-24 16:38:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:28,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:38:28,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:28,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:38:28,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:28,260 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:28,290 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-10-24 16:38:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:38:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 16:38:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:28,292 INFO L225 Difference]: With dead ends: 74 [2024-10-24 16:38:28,292 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 16:38:28,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:28,293 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:28,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 16:38:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2024-10-24 16:38:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-24 16:38:28,297 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2024-10-24 16:38:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:28,297 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-24 16:38:28,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-10-24 16:38:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:38:28,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:28,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:38:28,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:28,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1947015230, now seen corresponding path program 1 times [2024-10-24 16:38:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957421927] [2024-10-24 16:38:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957421927] [2024-10-24 16:38:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957421927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:28,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:38:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486223845] [2024-10-24 16:38:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:28,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:38:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:38:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:28,348 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:28,381 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-24 16:38:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:38:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 16:38:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:28,381 INFO L225 Difference]: With dead ends: 66 [2024-10-24 16:38:28,382 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 16:38:28,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:38:28,382 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:28,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 16:38:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-10-24 16:38:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-10-24 16:38:28,385 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 18 [2024-10-24 16:38:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:28,385 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-10-24 16:38:28,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-10-24 16:38:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:38:28,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:28,386 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:28,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:38:28,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:28,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1579950657, now seen corresponding path program 1 times [2024-10-24 16:38:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076265420] [2024-10-24 16:38:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076265420] [2024-10-24 16:38:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076265420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:38:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179124079] [2024-10-24 16:38:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:28,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:38:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:38:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:38:28,469 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:28,527 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-10-24 16:38:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:38:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 16:38:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:28,528 INFO L225 Difference]: With dead ends: 58 [2024-10-24 16:38:28,528 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 16:38:28,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:28,529 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:28,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 16:38:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-24 16:38:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 56 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-10-24 16:38:28,532 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 21 [2024-10-24 16:38:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:28,532 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-10-24 16:38:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-10-24 16:38:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:38:28,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:28,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:38:28,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1579950656, now seen corresponding path program 1 times [2024-10-24 16:38:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102516566] [2024-10-24 16:38:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:28,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102516566] [2024-10-24 16:38:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102516566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359461011] [2024-10-24 16:38:28,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:28,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:28,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:28,616 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-10-24 16:38:28,618 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-10-24 16:38:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:28,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:38:28,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:28,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359461011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:28,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-24 16:38:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271699950] [2024-10-24 16:38:28,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:28,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:38:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:38:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:38:28,905 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:28,945 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-10-24 16:38:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:38:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 16:38:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:28,946 INFO L225 Difference]: With dead ends: 74 [2024-10-24 16:38:28,946 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 16:38:28,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:38:28,946 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:28,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 121 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 16:38:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2024-10-24 16:38:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2024-10-24 16:38:28,949 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 21 [2024-10-24 16:38:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:28,949 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2024-10-24 16:38:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2024-10-24 16:38:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:38:28,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:28,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:28,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:38:29,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 16:38:29,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:29,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1578567937, now seen corresponding path program 1 times [2024-10-24 16:38:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:29,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213849010] [2024-10-24 16:38:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213849010] [2024-10-24 16:38:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213849010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78835518] [2024-10-24 16:38:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:29,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:29,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:29,598 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-10-24 16:38:29,599 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-10-24 16:38:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:29,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 16:38:29,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:29,734 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:38:29,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:38:29,777 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-10-24 16:38:29,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:29,850 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-10-24 16:38:29,881 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 21 treesize of output 9 [2024-10-24 16:38:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:29,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:29,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1) (not (= v_ArrVal_465 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_465 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2024-10-24 16:38:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-10-24 16:38:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78835518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:30,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2024-10-24 16:38:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734363776] [2024-10-24 16:38:30,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:30,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:38:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:38:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2024-10-24 16:38:30,062 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:30,592 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2024-10-24 16:38:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:38:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 16:38:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:30,594 INFO L225 Difference]: With dead ends: 109 [2024-10-24 16:38:30,594 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 16:38:30,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=674, Unknown=1, NotChecked=54, Total=870 [2024-10-24 16:38:30,596 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:30,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 314 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 70 Unchecked, 0.3s Time] [2024-10-24 16:38:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 16:38:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2024-10-24 16:38:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 73 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-10-24 16:38:30,603 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 21 [2024-10-24 16:38:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:30,603 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-10-24 16:38:30,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2024-10-24 16:38:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:38:30,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:30,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:30,619 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-10-24 16:38:30,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:30,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:30,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1578567936, now seen corresponding path program 1 times [2024-10-24 16:38:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304385629] [2024-10-24 16:38:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304385629] [2024-10-24 16:38:31,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304385629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951462706] [2024-10-24 16:38:31,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:31,370 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-10-24 16:38:31,371 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-10-24 16:38:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:31,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-24 16:38:31,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:31,477 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-10-24 16:38:31,550 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:38:31,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:38:31,563 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:31,564 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-10-24 16:38:31,619 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-10-24 16:38:31,625 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-10-24 16:38:31,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:31,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 16:38:31,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:31,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 37 treesize of output 19 [2024-10-24 16:38:31,810 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-10-24 16:38:31,814 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-10-24 16:38:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:31,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:31,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_563 (Array Int Int))) (or (forall ((v_ArrVal_564 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (not (= v_ArrVal_564 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_564 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (not (= v_ArrVal_563 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_563 (Array Int Int))) (or (not (= v_ArrVal_563 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)))))) is different from false [2024-10-24 16:38:32,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:32,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-10-24 16:38:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-10-24 16:38:32,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951462706] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:32,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2024-10-24 16:38:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945096479] [2024-10-24 16:38:32,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:32,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 16:38:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:32,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 16:38:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=786, Unknown=1, NotChecked=56, Total=930 [2024-10-24 16:38:32,257 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:32,854 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2024-10-24 16:38:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:38:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 16:38:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:32,855 INFO L225 Difference]: With dead ends: 118 [2024-10-24 16:38:32,855 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 16:38:32,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1234, Unknown=1, NotChecked=72, Total=1482 [2024-10-24 16:38:32,856 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 73 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:32,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 509 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 649 Invalid, 0 Unknown, 69 Unchecked, 0.3s Time] [2024-10-24 16:38:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 16:38:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 79. [2024-10-24 16:38:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.640625) internal successors, (105), 78 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 105 transitions. [2024-10-24 16:38:32,859 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 105 transitions. Word has length 21 [2024-10-24 16:38:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 105 transitions. [2024-10-24 16:38:32,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-10-24 16:38:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:38:32,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:32,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 16:38:32,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 16:38:33,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:33,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash -880181307, now seen corresponding path program 2 times [2024-10-24 16:38:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140051430] [2024-10-24 16:38:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:33,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:33,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140051430] [2024-10-24 16:38:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140051430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:33,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074099442] [2024-10-24 16:38:33,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:38:33,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:33,137 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-10-24 16:38:33,138 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-10-24 16:38:33,240 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:38:33,240 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:38:33,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:38:33,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:38:33,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:38:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074099442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:33,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-10-24 16:38:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258263108] [2024-10-24 16:38:33,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:33,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:33,302 INFO L87 Difference]: Start difference. First operand 79 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:33,364 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-10-24 16:38:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:38:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-24 16:38:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:33,365 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:38:33,365 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:38:33,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:38:33,365 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 73 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:33,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 93 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:38:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2024-10-24 16:38:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-24 16:38:33,367 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 23 [2024-10-24 16:38:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:33,368 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-24 16:38:33,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-24 16:38:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:38:33,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:33,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:33,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 16:38:33,572 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,SelfDestructingSolverStorable14 [2024-10-24 16:38:33,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:33,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1191913827, now seen corresponding path program 2 times [2024-10-24 16:38:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858884801] [2024-10-24 16:38:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858884801] [2024-10-24 16:38:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858884801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32520701] [2024-10-24 16:38:33,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:38:33,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:33,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:33,668 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-10-24 16:38:33,670 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-10-24 16:38:33,801 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:38:33,801 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:38:33,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:38:33,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:33,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:38:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32520701] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:33,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-10-24 16:38:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311870474] [2024-10-24 16:38:33,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:38:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:38:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:38:33,829 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:33,875 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-10-24 16:38:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:38:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-24 16:38:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:33,875 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:38:33,876 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:38:33,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:33,876 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:33,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:38:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-10-24 16:38:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-10-24 16:38:33,878 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 24 [2024-10-24 16:38:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:33,878 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-10-24 16:38:33,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-10-24 16:38:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:38:33,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:33,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:33,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:38:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 16:38:34,080 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2006426333, now seen corresponding path program 1 times [2024-10-24 16:38:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485423657] [2024-10-24 16:38:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:38:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485423657] [2024-10-24 16:38:34,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485423657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:34,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:34,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:38:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414185624] [2024-10-24 16:38:34,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:34,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:34,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:34,200 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:34,299 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-10-24 16:38:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:38:34,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-24 16:38:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:34,300 INFO L225 Difference]: With dead ends: 66 [2024-10-24 16:38:34,300 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 16:38:34,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:38:34,300 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:34,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 16:38:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 16:38:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-10-24 16:38:34,302 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 26 [2024-10-24 16:38:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:34,302 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-10-24 16:38:34,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-10-24 16:38:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:38:34,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:34,303 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-24 16:38:34,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:38:34,303 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:34,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2007809052, now seen corresponding path program 3 times [2024-10-24 16:38:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:34,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146492058] [2024-10-24 16:38:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:34,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146492058] [2024-10-24 16:38:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146492058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861711944] [2024-10-24 16:38:34,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:38:34,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:34,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:34,370 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-10-24 16:38:34,371 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-10-24 16:38:34,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 16:38:34,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:38:34,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:38:34,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:34,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861711944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:34,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-24 16:38:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958322732] [2024-10-24 16:38:34,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:38:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:38:34,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:38:34,575 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:34,641 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-10-24 16:38:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:38:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-24 16:38:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:34,642 INFO L225 Difference]: With dead ends: 68 [2024-10-24 16:38:34,642 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 16:38:34,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:38:34,643 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:34,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 176 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 16:38:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-10-24 16:38:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.42) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-10-24 16:38:34,645 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 26 [2024-10-24 16:38:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:34,645 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-10-24 16:38:34,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-10-24 16:38:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:38:34,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:34,646 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] [2024-10-24 16:38:34,658 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-10-24 16:38:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:34,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash -264491744, now seen corresponding path program 1 times [2024-10-24 16:38:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013127691] [2024-10-24 16:38:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:34,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:34,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013127691] [2024-10-24 16:38:34,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013127691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:34,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:34,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:38:34,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660648325] [2024-10-24 16:38:34,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:34,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:38:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:38:34,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:38:34,897 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:34,926 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-24 16:38:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:38:34,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-24 16:38:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:34,927 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:38:34,927 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:38:34,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:38:34,928 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:34,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:38:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-10-24 16:38:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-10-24 16:38:34,929 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2024-10-24 16:38:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:34,930 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-10-24 16:38:34,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-10-24 16:38:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:38:34,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:34,930 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] [2024-10-24 16:38:34,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:38:34,930 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 389190025, now seen corresponding path program 1 times [2024-10-24 16:38:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:34,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722698006] [2024-10-24 16:38:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:35,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:35,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722698006] [2024-10-24 16:38:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722698006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:35,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693388759] [2024-10-24 16:38:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:35,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:35,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:35,431 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-10-24 16:38:35,432 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-10-24 16:38:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:35,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-24 16:38:35,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:35,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:35,598 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-10-24 16:38:35,690 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-10-24 16:38:35,832 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-10-24 16:38:35,836 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 26 treesize of output 14 [2024-10-24 16:38:35,906 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 20 treesize of output 8 [2024-10-24 16:38:35,936 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 16 treesize of output 11 [2024-10-24 16:38:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:36,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:36,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1077) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-10-24 16:38:36,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:36,133 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 27 treesize of output 28 [2024-10-24 16:38:36,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:36,142 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 48 treesize of output 51 [2024-10-24 16:38:36,146 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 18 treesize of output 16 [2024-10-24 16:38:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:38:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693388759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:36,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:36,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2024-10-24 16:38:36,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678009954] [2024-10-24 16:38:36,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:36,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-24 16:38:36,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:36,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-24 16:38:36,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1337, Unknown=19, NotChecked=74, Total=1560 [2024-10-24 16:38:36,319 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 40 states, 40 states have (on average 1.95) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:36,816 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-24 16:38:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:38:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-24 16:38:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:36,817 INFO L225 Difference]: With dead ends: 61 [2024-10-24 16:38:36,817 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 16:38:36,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=294, Invalid=2447, Unknown=19, NotChecked=102, Total=2862 [2024-10-24 16:38:36,819 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 106 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:36,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 459 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 491 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2024-10-24 16:38:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 16:38:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-10-24 16:38:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2024-10-24 16:38:36,824 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2024-10-24 16:38:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:36,825 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2024-10-24 16:38:36,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-10-24 16:38:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:38:36,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:36,825 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] [2024-10-24 16:38:36,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 16:38:37,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:37,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:37,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:37,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1811458245, now seen corresponding path program 1 times [2024-10-24 16:38:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:37,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519108390] [2024-10-24 16:38:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:37,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519108390] [2024-10-24 16:38:38,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519108390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176444009] [2024-10-24 16:38:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:38,269 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-10-24 16:38:38,270 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-10-24 16:38:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:38,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-24 16:38:38,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:38,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:38,463 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-10-24 16:38:38,516 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-10-24 16:38:38,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:38,596 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 26 treesize of output 14 [2024-10-24 16:38:38,683 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-24 16:38:38,683 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-10-24 16:38:38,776 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-10-24 16:38:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:38:38,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:38,854 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-24 16:38:38,854 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 20 [2024-10-24 16:38:38,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1184) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-10-24 16:38:38,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1184) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-10-24 16:38:38,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1183)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1184) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1183 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1183)))) is different from false [2024-10-24 16:38:38,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select v_ArrVal_1183 .cse1))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1183) .cse0 v_ArrVal_1184) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (not (= v_ArrVal_1183 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| (select v_ArrVal_1183 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) is different from false [2024-10-24 16:38:38,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| (select v_ArrVal_1183 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|)) v_ArrVal_1183)) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select v_ArrVal_1183 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1183) .cse0 v_ArrVal_1184) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse0))))) is different from false [2024-10-24 16:38:38,989 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 44 treesize of output 42 [2024-10-24 16:38:38,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:38,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:38,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-10-24 16:38:38,997 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 28 treesize of output 16 [2024-10-24 16:38:38,999 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-10-24 16:38:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-10-24 16:38:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176444009] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:39,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 13] total 39 [2024-10-24 16:38:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029891488] [2024-10-24 16:38:39,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:39,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-24 16:38:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-24 16:38:39,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1095, Unknown=14, NotChecked=350, Total=1560 [2024-10-24 16:38:39,028 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:39,737 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-24 16:38:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 16:38:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-24 16:38:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:39,738 INFO L225 Difference]: With dead ends: 64 [2024-10-24 16:38:39,738 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 16:38:39,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=2190, Unknown=14, NotChecked=500, Total=2970 [2024-10-24 16:38:39,739 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 188 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:39,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 578 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 733 Invalid, 0 Unknown, 256 Unchecked, 0.3s Time] [2024-10-24 16:38:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 16:38:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-24 16:38:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.346938775510204) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-10-24 16:38:39,741 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 32 [2024-10-24 16:38:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-10-24 16:38:39,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-10-24 16:38:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:38:39,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:39,742 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] [2024-10-24 16:38:39,755 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-10-24 16:38:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:39,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:39,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1811458246, now seen corresponding path program 1 times [2024-10-24 16:38:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599546151] [2024-10-24 16:38:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:41,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:41,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599546151] [2024-10-24 16:38:41,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599546151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570002114] [2024-10-24 16:38:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:41,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:41,159 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-10-24 16:38:41,161 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-10-24 16:38:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:41,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-24 16:38:41,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:41,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:41,328 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-10-24 16:38:41,385 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-10-24 16:38:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:41,457 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 26 treesize of output 14 [2024-10-24 16:38:41,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-24 16:38:41,531 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 70 treesize of output 65 [2024-10-24 16:38:41,534 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-10-24 16:38:41,701 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 39 treesize of output 21 [2024-10-24 16:38:41,708 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-10-24 16:38:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:38:41,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:41,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:41,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-10-24 16:38:42,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:42,054 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 127 treesize of output 108 [2024-10-24 16:38:42,058 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 89 treesize of output 85 [2024-10-24 16:38:42,063 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 85 treesize of output 81 [2024-10-24 16:38:42,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1290 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_1290 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1290 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2024-10-24 16:38:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2024-10-24 16:38:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570002114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:42,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 35 [2024-10-24 16:38:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513639154] [2024-10-24 16:38:42,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-24 16:38:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-24 16:38:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1100, Unknown=1, NotChecked=66, Total=1260 [2024-10-24 16:38:42,208 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 36 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:42,939 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-10-24 16:38:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:38:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 36 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-24 16:38:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:42,940 INFO L225 Difference]: With dead ends: 64 [2024-10-24 16:38:42,940 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 16:38:42,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=2383, Unknown=1, NotChecked=100, Total=2756 [2024-10-24 16:38:42,942 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 129 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:42,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 549 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 750 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2024-10-24 16:38:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 16:38:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-10-24 16:38:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-10-24 16:38:42,943 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 32 [2024-10-24 16:38:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-10-24 16:38:42,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 36 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-10-24 16:38:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:38:42,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:42,944 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] [2024-10-24 16:38:42,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-24 16:38:43,148 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,SelfDestructingSolverStorable21 [2024-10-24 16:38:43,149 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1811458301, now seen corresponding path program 1 times [2024-10-24 16:38:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138094923] [2024-10-24 16:38:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138094923] [2024-10-24 16:38:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138094923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5507443] [2024-10-24 16:38:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:43,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:43,224 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-10-24 16:38:43,228 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-10-24 16:38:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:43,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:38:43,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:43,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5507443] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:43,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-10-24 16:38:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351909561] [2024-10-24 16:38:43,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:43,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:43,399 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:43,446 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-10-24 16:38:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:38:43,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-24 16:38:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:43,447 INFO L225 Difference]: With dead ends: 51 [2024-10-24 16:38:43,447 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:38:43,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:38:43,448 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:43,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:38:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:38:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-10-24 16:38:43,449 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 32 [2024-10-24 16:38:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:43,449 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-10-24 16:38:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-10-24 16:38:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:38:43,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:43,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:43,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-24 16:38:43,649 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,SelfDestructingSolverStorable22 [2024-10-24 16:38:43,650 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:43,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash 319130244, now seen corresponding path program 1 times [2024-10-24 16:38:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737996742] [2024-10-24 16:38:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737996742] [2024-10-24 16:38:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737996742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890373807] [2024-10-24 16:38:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:43,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:43,724 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-10-24 16:38:43,729 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-10-24 16:38:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:43,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:38:43,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:43,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:38:43,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890373807] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:43,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-10-24 16:38:43,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774026977] [2024-10-24 16:38:43,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:43,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:38:43,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:43,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:38:43,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:38:43,899 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:43,941 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-10-24 16:38:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:38:43,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-24 16:38:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:43,942 INFO L225 Difference]: With dead ends: 51 [2024-10-24 16:38:43,942 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:38:43,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:43,943 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:43,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 106 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:38:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:38:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-10-24 16:38:43,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 33 [2024-10-24 16:38:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:43,944 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-10-24 16:38:43,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-10-24 16:38:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:38:43,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:43,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:43,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-24 16:38:44,145 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,SelfDestructingSolverStorable23 [2024-10-24 16:38:44,145 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:44,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1109305600, now seen corresponding path program 1 times [2024-10-24 16:38:44,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:44,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239753630] [2024-10-24 16:38:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239753630] [2024-10-24 16:38:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239753630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491150122] [2024-10-24 16:38:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:45,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:45,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:45,158 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-10-24 16:38:45,159 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-10-24 16:38:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:45,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-24 16:38:45,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:45,401 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:45,401 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-10-24 16:38:45,460 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-10-24 16:38:45,462 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-10-24 16:38:45,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:45,585 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 26 treesize of output 14 [2024-10-24 16:38:45,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:45,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 16:38:45,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-24 16:38:45,742 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 80 treesize of output 73 [2024-10-24 16:38:45,745 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 29 treesize of output 19 [2024-10-24 16:38:45,747 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-10-24 16:38:45,988 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 39 treesize of output 21 [2024-10-24 16:38:45,995 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-10-24 16:38:46,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:46,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:46,072 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 15 treesize of output 10 [2024-10-24 16:38:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:38:46,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:46,435 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 59 treesize of output 46 [2024-10-24 16:38:46,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse5)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse5)) (.cse4 (forall ((v_ArrVal_1612 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)))) (and (forall ((v_ArrVal_1612 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse0 (+ .cse1 1)) (< .cse0 0)))) (or (< .cse1 1) .cse4) (or (forall ((v_ArrVal_1611 (Array Int Int))) (= .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1611) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) .cse4) (or (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) .cse4))))) is different from false [2024-10-24 16:38:46,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1608 (Array Int Int))) (or (not (= v_ArrVal_1608 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1608 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1609 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1609))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1612 (Array Int Int))) (< (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1609 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1609))))))) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (or (not (= v_ArrVal_1608 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1608 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1609) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1609 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1609))))) (forall ((v_ArrVal_1608 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1608))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_1608 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1608 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1609) .cse4 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1609 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1609)))) (forall ((v_ArrVal_1611 (Array Int Int))) (= (select (select (store .cse5 .cse4 v_ArrVal_1611) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse4)))))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (not (= v_ArrVal_1608 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1608 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1609 (Array Int Int))) (or (forall ((v_ArrVal_1612 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1609))) (let ((.cse6 (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse6 0) (< .cse6 (+ (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))))) (not (= (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1609 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1609)))))))) is different from false [2024-10-24 16:38:47,015 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse5 (select .cse0 .cse2)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1608 .cse2))) (or (not (= v_ArrVal_1608 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1608 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1609) .cse1 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (not (= v_ArrVal_1609 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))))) (forall ((v_ArrVal_1611 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1608) .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1609) .cse5 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse4 0) (not (= v_ArrVal_1609 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (< .cse4 (+ 1 (select v_ArrVal_1609 .cse2)))))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1609) .cse5 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (not (= v_ArrVal_1609 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1609) .cse5 v_ArrVal_1612) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0) (not (= v_ArrVal_1609 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (< (select v_ArrVal_1609 .cse2) 1)))))) is different from false [2024-10-24 16:38:47,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse5 (select .cse3 .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1608 .cse1))) (or (forall ((v_ArrVal_1611 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1608) .cse0 v_ArrVal_1611) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse0)) (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (or (not (= v_ArrVal_1609 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1609) .cse0 v_ArrVal_1612) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1608 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)) v_ArrVal_1608))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1609) .cse5 v_ArrVal_1612) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (or (< .cse4 0) (not (= v_ArrVal_1609 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< .cse4 (+ (select v_ArrVal_1609 .cse1) 1)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1609 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1609) .cse5 v_ArrVal_1612) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0) (not (= v_ArrVal_1609 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| (select v_ArrVal_1609 |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) (< (select v_ArrVal_1609 .cse1) 1) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))))) is different from false [2024-10-24 16:38:47,110 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 205 treesize of output 199 [2024-10-24 16:38:47,115 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 177 treesize of output 175 [2024-10-24 16:38:47,166 INFO L349 Elim1Store]: treesize reduction 48, result has 59.3 percent of original size [2024-10-24 16:38:47,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 248 [2024-10-24 16:38:47,193 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-24 16:38:47,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 123 [2024-10-24 16:38:47,202 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 99 treesize of output 95 [2024-10-24 16:38:47,212 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 95 treesize of output 91 [2024-10-24 16:38:47,224 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 91 treesize of output 87 [2024-10-24 16:38:47,235 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 87 treesize of output 79 [2024-10-24 16:38:47,295 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 8 treesize of output 6 [2024-10-24 16:38:47,310 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 8 treesize of output 6 [2024-10-24 16:38:47,335 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 8 treesize of output 6 [2024-10-24 16:38:47,362 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 8 treesize of output 6 [2024-10-24 16:38:47,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-10-24 16:38:47,415 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 8 treesize of output 6 [2024-10-24 16:38:47,430 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 8 treesize of output 6 [2024-10-24 16:38:47,441 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 8 treesize of output 6 [2024-10-24 16:38:47,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2024-10-24 16:38:47,806 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-10-24 16:38:47,807 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 3 case distinctions, treesize of input 1691 treesize of output 1603 [2024-10-24 16:38:47,911 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 114 treesize of output 94 [2024-10-24 16:38:48,046 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:38:48,047 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 13 treesize of output 12 [2024-10-24 16:38:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-24 16:38:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491150122] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:48,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 55 [2024-10-24 16:38:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805099743] [2024-10-24 16:38:48,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:48,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-24 16:38:48,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-24 16:38:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2373, Unknown=36, NotChecked=404, Total=2970 [2024-10-24 16:38:48,111 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 55 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:49,697 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-10-24 16:38:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:38:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-24 16:38:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:49,701 INFO L225 Difference]: With dead ends: 52 [2024-10-24 16:38:49,701 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 16:38:49,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=416, Invalid=4799, Unknown=57, NotChecked=580, Total=5852 [2024-10-24 16:38:49,703 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:49,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 704 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 978 Invalid, 0 Unknown, 155 Unchecked, 0.5s Time] [2024-10-24 16:38:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 16:38:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-10-24 16:38:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-10-24 16:38:49,709 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 35 [2024-10-24 16:38:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:49,709 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-10-24 16:38:49,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-10-24 16:38:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:38:49,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:49,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:49,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 16:38:49,910 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,SelfDestructingSolverStorable24 [2024-10-24 16:38:49,912 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:49,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -904760233, now seen corresponding path program 1 times [2024-10-24 16:38:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51704115] [2024-10-24 16:38:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 16:38:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51704115] [2024-10-24 16:38:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51704115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218283611] [2024-10-24 16:38:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:50,111 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-10-24 16:38:50,112 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-10-24 16:38:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:50,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:38:50,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 16:38:50,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:38:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218283611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:38:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-10-24 16:38:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233459333] [2024-10-24 16:38:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:38:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:38:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:38:50,305 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:50,354 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-10-24 16:38:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:38:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-24 16:38:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:50,354 INFO L225 Difference]: With dead ends: 49 [2024-10-24 16:38:50,354 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 16:38:50,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-10-24 16:38:50,355 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:50,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:38:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 16:38:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 16:38:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-10-24 16:38:50,356 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 37 [2024-10-24 16:38:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-10-24 16:38:50,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-10-24 16:38:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:38:50,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:50,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:50,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-24 16:38:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:50,557 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash -904760232, now seen corresponding path program 1 times [2024-10-24 16:38:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471505112] [2024-10-24 16:38:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 16:38:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471505112] [2024-10-24 16:38:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471505112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:50,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:38:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181832714] [2024-10-24 16:38:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:50,703 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:50,783 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-10-24 16:38:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:38:50,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-24 16:38:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:50,786 INFO L225 Difference]: With dead ends: 50 [2024-10-24 16:38:50,786 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 16:38:50,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:38:50,787 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:50,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 16:38:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-24 16:38:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-10-24 16:38:50,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 37 [2024-10-24 16:38:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:50,790 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-24 16:38:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-10-24 16:38:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 16:38:50,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:50,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:50,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 16:38:50,791 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:50,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:50,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2017202449, now seen corresponding path program 1 times [2024-10-24 16:38:50,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:50,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808091082] [2024-10-24 16:38:50,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 16:38:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808091082] [2024-10-24 16:38:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808091082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:38:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340094415] [2024-10-24 16:38:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:50,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:50,885 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:50,955 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-10-24 16:38:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:38:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-24 16:38:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:50,956 INFO L225 Difference]: With dead ends: 52 [2024-10-24 16:38:50,956 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 16:38:50,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:38:50,957 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:50,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 16:38:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-10-24 16:38:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-10-24 16:38:50,958 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 38 [2024-10-24 16:38:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:50,959 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-10-24 16:38:50,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-10-24 16:38:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:38:50,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:50,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:50,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 16:38:50,960 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:50,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1891149474, now seen corresponding path program 1 times [2024-10-24 16:38:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:50,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010407237] [2024-10-24 16:38:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 16:38:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010407237] [2024-10-24 16:38:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010407237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:38:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:38:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:38:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440515305] [2024-10-24 16:38:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:38:51,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:38:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:51,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:38:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:38:51,109 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:51,174 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-10-24 16:38:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:38:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-24 16:38:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:51,175 INFO L225 Difference]: With dead ends: 51 [2024-10-24 16:38:51,175 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 16:38:51,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:38:51,175 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:51,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:38:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 16:38:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 16:38:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-10-24 16:38:51,177 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 39 [2024-10-24 16:38:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:51,177 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-10-24 16:38:51,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-10-24 16:38:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:38:51,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:51,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:51,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 16:38:51,178 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:51,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2147170536, now seen corresponding path program 1 times [2024-10-24 16:38:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:51,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499983158] [2024-10-24 16:38:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499983158] [2024-10-24 16:38:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499983158] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64760177] [2024-10-24 16:38:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:51,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:51,734 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-10-24 16:38:51,735 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-10-24 16:38:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:51,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-24 16:38:51,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:51,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:51,920 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-10-24 16:38:51,951 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-10-24 16:38:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:52,003 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 24 treesize of output 12 [2024-10-24 16:38:52,059 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:38:52,059 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-10-24 16:38:52,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:52,152 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 27 treesize of output 21 [2024-10-24 16:38:52,228 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:38:52,228 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 18 treesize of output 13 [2024-10-24 16:38:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:52,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:52,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:52,365 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 31 treesize of output 35 [2024-10-24 16:38:52,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1981 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select .cse0 4))) (not (= v_ArrVal_1981 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1981 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1981 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= v_ArrVal_1981 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1981 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-10-24 16:38:52,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-24 16:38:52,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-10-24 16:38:52,639 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 13 treesize of output 11 [2024-10-24 16:38:52,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 3 not checked. [2024-10-24 16:38:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64760177] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:52,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 32 [2024-10-24 16:38:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223055384] [2024-10-24 16:38:52,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:52,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-24 16:38:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-24 16:38:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=881, Unknown=1, NotChecked=60, Total=1056 [2024-10-24 16:38:52,668 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 33 states, 32 states have (on average 2.625) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:53,066 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-10-24 16:38:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:38:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-24 16:38:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:53,067 INFO L225 Difference]: With dead ends: 58 [2024-10-24 16:38:53,067 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 16:38:53,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1305, Unknown=1, NotChecked=74, Total=1560 [2024-10-24 16:38:53,068 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:53,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 220 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 616 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2024-10-24 16:38:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 16:38:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-10-24 16:38:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.163265306122449) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-24 16:38:53,070 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2024-10-24 16:38:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:53,070 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-24 16:38:53,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-24 16:38:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:38:53,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:53,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:53,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-24 16:38:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:53,276 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2147170537, now seen corresponding path program 1 times [2024-10-24 16:38:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027166329] [2024-10-24 16:38:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:54,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027166329] [2024-10-24 16:38:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027166329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204177573] [2024-10-24 16:38:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:54,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:54,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:54,631 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-10-24 16:38:54,632 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-10-24 16:38:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:54,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-24 16:38:54,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:54,813 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-10-24 16:38:54,901 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:38:54,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:38:54,913 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:54,913 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-10-24 16:38:54,989 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-10-24 16:38:54,994 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-10-24 16:38:55,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:55,133 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-10-24 16:38:55,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:55,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-24 16:38:55,260 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:38:55,261 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 50 treesize of output 45 [2024-10-24 16:38:55,263 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 24 treesize of output 11 [2024-10-24 16:38:55,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:55,393 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-10-24 16:38:55,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:55,398 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 27 treesize of output 21 [2024-10-24 16:38:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:55,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:55,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2098 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2099 (Array Int Int)) (v_ArrVal_2098 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2099) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2024-10-24 16:38:55,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2096 (Array Int Int))) (or (forall ((v_ArrVal_2097 (Array Int Int))) (or (not (= v_ArrVal_2097 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2097 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_2099 (Array Int Int)) (v_ArrVal_2098 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2096))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2097) .cse1 v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2099) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) (not (= (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2096 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2096)))) (forall ((v_ArrVal_2096 (Array Int Int))) (or (not (= (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2096 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2096)) (forall ((v_ArrVal_2097 (Array Int Int))) (or (not (= v_ArrVal_2097 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2097 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_2098 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2097) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2096) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))))))) is different from false [2024-10-24 16:38:56,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_2096 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2096 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)) v_ArrVal_2096)) (forall ((v_ArrVal_2097 (Array Int Int))) (or (forall ((v_ArrVal_2099 (Array Int Int)) (v_ArrVal_2098 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2096 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2097) .cse1 v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2096) .cse1 v_ArrVal_2099) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2097 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)) v_ArrVal_2097)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2097 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)) v_ArrVal_2097)) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2097) (select .cse0 .cse2) v_ArrVal_2098) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-10-24 16:38:56,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (not (= v_ArrVal_2097 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2097 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2097) (select .cse1 .cse2) v_ArrVal_2098) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_2096 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2096 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)) v_ArrVal_2096)) (forall ((v_ArrVal_2097 (Array Int Int))) (or (not (= v_ArrVal_2097 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2097 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))) (forall ((v_ArrVal_2099 (Array Int Int)) (v_ArrVal_2098 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2096 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2097) .cse3 v_ArrVal_2098) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2096) .cse3 v_ArrVal_2099) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))))))))) is different from false [2024-10-24 16:38:56,089 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 80 treesize of output 78 [2024-10-24 16:38:56,092 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 114 treesize of output 112 [2024-10-24 16:38:56,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:56,101 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 89 treesize of output 87 [2024-10-24 16:38:56,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-24 16:38:56,107 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 9 treesize of output 7 [2024-10-24 16:38:56,116 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 133 treesize of output 131 [2024-10-24 16:38:56,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:56,142 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 22 treesize of output 20 [2024-10-24 16:38:56,146 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:56,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:56,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-10-24 16:38:56,155 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 14 treesize of output 10 [2024-10-24 16:38:56,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:56,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-10-24 16:38:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-10-24 16:38:56,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204177573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:56,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:56,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 17] total 54 [2024-10-24 16:38:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209360849] [2024-10-24 16:38:56,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:56,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-24 16:38:56,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-24 16:38:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2339, Unknown=66, NotChecked=404, Total=2970 [2024-10-24 16:38:56,437 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 55 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:38:57,902 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-10-24 16:38:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:38:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-24 16:38:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:38:57,902 INFO L225 Difference]: With dead ends: 59 [2024-10-24 16:38:57,903 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 16:38:57,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=378, Invalid=4124, Unknown=70, NotChecked=540, Total=5112 [2024-10-24 16:38:57,904 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:38:57,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 382 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1178 Invalid, 0 Unknown, 195 Unchecked, 0.6s Time] [2024-10-24 16:38:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 16:38:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-24 16:38:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-10-24 16:38:57,905 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2024-10-24 16:38:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:38:57,905 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-10-24 16:38:57,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:38:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-10-24 16:38:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 16:38:57,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:38:57,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:38:57,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:38:58,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:58,111 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:38:58,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:38:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2137775776, now seen corresponding path program 1 times [2024-10-24 16:38:58,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:38:58,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802869184] [2024-10-24 16:38:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:38:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:38:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:38:58,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802869184] [2024-10-24 16:38:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802869184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:38:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821882775] [2024-10-24 16:38:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:38:58,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:38:58,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:38:58,937 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:38:58,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-24 16:38:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:38:59,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-24 16:38:59,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:38:59,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:38:59,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:38:59,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:38:59,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:38:59,345 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 32 treesize of output 16 [2024-10-24 16:38:59,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:38:59,488 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 33 treesize of output 32 [2024-10-24 16:38:59,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:59,613 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 26 treesize of output 20 [2024-10-24 16:38:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:38:59,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:38:59,761 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2208) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2024-10-24 16:38:59,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2208) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-10-24 16:38:59,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2207 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2207))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2208)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2207 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2207)))) is different from false [2024-10-24 16:38:59,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_72| Int) (v_ArrVal_2207 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_72|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_72| (select v_ArrVal_2207 |v_ULTIMATE.start_sll_update_at_~head#1.offset_72|)) v_ArrVal_2207)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2207) (select v_ArrVal_2207 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2208) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2024-10-24 16:38:59,795 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_72| Int) (v_ArrVal_2207 (Array Int Int))) (or (not (= v_ArrVal_2207 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_72| (select v_ArrVal_2207 |v_ULTIMATE.start_sll_update_at_~head#1.offset_72|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2207) (select v_ArrVal_2207 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2208) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_72|))) is different from false [2024-10-24 16:38:59,806 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 47 treesize of output 45 [2024-10-24 16:38:59,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:38:59,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:59,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-10-24 16:38:59,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:38:59,823 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 39 treesize of output 33 [2024-10-24 16:38:59,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-24 16:38:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-10-24 16:38:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821882775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:38:59,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:38:59,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 18] total 45 [2024-10-24 16:38:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628889942] [2024-10-24 16:38:59,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:38:59,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-24 16:38:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:38:59,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-24 16:38:59,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1407, Unknown=17, NotChecked=400, Total=1980 [2024-10-24 16:38:59,885 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 45 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:39:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:39:00,615 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2024-10-24 16:39:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:39:00,615 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 45 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-24 16:39:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:39:00,615 INFO L225 Difference]: With dead ends: 61 [2024-10-24 16:39:00,615 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 16:39:00,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=327, Invalid=2756, Unknown=17, NotChecked=560, Total=3660 [2024-10-24 16:39:00,617 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:39:00,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 365 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 716 Invalid, 0 Unknown, 236 Unchecked, 0.3s Time] [2024-10-24 16:39:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 16:39:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-10-24 16:39:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:39:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2024-10-24 16:39:00,622 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 43 [2024-10-24 16:39:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:39:00,622 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2024-10-24 16:39:00,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 45 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:39:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2024-10-24 16:39:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:39:00,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:39:00,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:39:00,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-24 16:39:00,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:39:00,826 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:39:00,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:39:00,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1846623663, now seen corresponding path program 1 times [2024-10-24 16:39:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:39:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447285756] [2024-10-24 16:39:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:39:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:39:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:39:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:39:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:39:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447285756] [2024-10-24 16:39:01,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447285756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:39:01,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807502357] [2024-10-24 16:39:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:39:01,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:39:01,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:39:01,458 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:39:01,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-24 16:39:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:39:01,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-24 16:39:01,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:39:01,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:39:01,741 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-10-24 16:39:01,791 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-10-24 16:39:01,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:39:01,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-24 16:39:01,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:39:01,971 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-10-24 16:39:02,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:02,062 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 27 treesize of output 21 [2024-10-24 16:39:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:39:02,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:39:02,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2317 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2317) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-10-24 16:39:02,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2316 (Array Int Int))) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2316))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2317)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2316 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2316)))) is different from false [2024-10-24 16:39:02,312 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2316 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_76| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_76| (select v_ArrVal_2316 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|)) v_ArrVal_2316)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2316) (select v_ArrVal_2316 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2317) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-10-24 16:39:02,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2316 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_76| Int)) (or (not (= v_ArrVal_2316 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_76| (select v_ArrVal_2316 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|)))) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2316) (select v_ArrVal_2316 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2317) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|))) is different from false [2024-10-24 16:39:02,334 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 44 treesize of output 42 [2024-10-24 16:39:02,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:39:02,342 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 131 treesize of output 127 [2024-10-24 16:39:02,361 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 5 [2024-10-24 16:39:02,416 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:39:02,417 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 13 treesize of output 12 [2024-10-24 16:39:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-10-24 16:39:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807502357] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:39:02,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:39:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 38 [2024-10-24 16:39:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129457693] [2024-10-24 16:39:02,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:39:02,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-24 16:39:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:39:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-24 16:39:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1066, Unknown=26, NotChecked=276, Total=1482 [2024-10-24 16:39:02,436 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 39 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:39:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:39:03,266 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-10-24 16:39:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:39:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 39 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-24 16:39:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:39:03,268 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:39:03,268 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:39:03,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=259, Invalid=2180, Unknown=27, NotChecked=396, Total=2862 [2024-10-24 16:39:03,269 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 72 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:39:03,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 364 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 774 Invalid, 0 Unknown, 184 Unchecked, 0.4s Time] [2024-10-24 16:39:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:39:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-10-24 16:39:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:39:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-10-24 16:39:03,270 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 44 [2024-10-24 16:39:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:39:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-10-24 16:39:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 39 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:39:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-10-24 16:39:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 16:39:03,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:39:03,271 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:39:03,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-24 16:39:03,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:39:03,471 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:39:03,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:39:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1470388489, now seen corresponding path program 2 times [2024-10-24 16:39:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:39:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626068910] [2024-10-24 16:39:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:39:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:39:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:39:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:39:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:39:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626068910] [2024-10-24 16:39:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626068910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:39:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092946755] [2024-10-24 16:39:04,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:39:04,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:39:04,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:39:04,493 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:39:04,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-24 16:39:04,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:39:04,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:39:04,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-24 16:39:04,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:39:04,723 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-10-24 16:39:04,726 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-10-24 16:39:04,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:39:04,758 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-10-24 16:39:04,802 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 16 treesize of output 11 [2024-10-24 16:39:04,808 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 16 treesize of output 11 [2024-10-24 16:39:04,817 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 16 treesize of output 11 [2024-10-24 16:39:04,821 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 16 treesize of output 11 [2024-10-24 16:39:04,854 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-10-24 16:39:04,860 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-10-24 16:39:04,989 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-24 16:39:04,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2024-10-24 16:39:05,008 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-10-24 16:39:05,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-24 16:39:05,345 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2024-10-24 16:39:05,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2024-10-24 16:39:05,439 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2024-10-24 16:39:05,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 [2024-10-24 16:39:26,278 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-10-24 16:39:26,278 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2024-10-24 16:39:26,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:26,284 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 1 case distinctions, treesize of input 24 treesize of output 18 [2024-10-24 16:39:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:39:26,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:39:44,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (forall ((v_ArrVal_2436 (Array Int Int))) (or (forall ((v_ArrVal_2437 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (or (forall ((v_ArrVal_2438 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2437)) (.cse1 (select v_ArrVal_2436 4))) (or (not (= v_ArrVal_2438 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2438 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (forall ((v_ArrVal_2439 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2436))) (or (not (= v_ArrVal_2439 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (= (select (select (store .cse0 .cse1 v_ArrVal_2438) (select (select (store .cse2 .cse1 v_ArrVal_2439) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0))))))) (< (select v_ArrVal_2437 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))) (not (= v_ArrVal_2437 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2437 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)))))) (not (= (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2436 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)) v_ArrVal_2436)))))) (forall ((v_ArrVal_2439 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2436)) (.cse7 (select v_ArrVal_2436 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (not (= (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2436 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)) v_ArrVal_2436)) (= (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2439))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0) (< (select .cse3 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|) (not (= v_ArrVal_2439 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))))))))) is different from false [2024-10-24 16:39:44,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (forall ((v_ArrVal_2436 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2436 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)) v_ArrVal_2436)) (forall ((v_ArrVal_2437 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (or (forall ((v_ArrVal_2438 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2437)) (.cse2 (select v_ArrVal_2436 4))) (or (not (= v_ArrVal_2438 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2438 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (forall ((v_ArrVal_2439 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2436))) (or (= (select (select (store .cse1 .cse2 v_ArrVal_2438) (select (select (store .cse3 .cse2 v_ArrVal_2439) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2439 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))))))))) (< (select v_ArrVal_2437 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))) (not (= v_ArrVal_2437 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2437 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)))))))))) (forall ((v_ArrVal_2439 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2436)) (.cse6 (select v_ArrVal_2436 4))) (or (< (select .cse4 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2436 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)) v_ArrVal_2436)) (not (= v_ArrVal_2439 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (= (select (let ((.cse7 (store .cse5 .cse6 v_ArrVal_2439))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)))))) is different from false [2024-10-24 16:39:45,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (store .cse10 .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2437)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2436)) (.cse2 (select v_ArrVal_2436 4)) (.cse6 (select v_ArrVal_2437 .cse0))) (or (= .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (= (select (select (store .cse1 .cse2 v_ArrVal_2438) (select (select (store .cse3 .cse2 v_ArrVal_2439) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2436 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2436 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)))) (not (= (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2438 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2438)) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (not (= v_ArrVal_2439 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (not (= v_ArrVal_2437 (store (store .cse5 .cse0 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2437 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)))) (< (select v_ArrVal_2437 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| .cse6)))) (forall ((v_ArrVal_2433 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2433) (forall ((v_ArrVal_2439 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2436)) (.cse9 (select v_ArrVal_2436 4))) (or (not (= v_ArrVal_2436 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| (select v_ArrVal_2436 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|)))) (= (select (let ((.cse7 (store .cse8 .cse9 v_ArrVal_2439))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select (store .cse5 .cse0 v_ArrVal_2433) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|) (not (= v_ArrVal_2439 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))))))))) (or (< 0 .cse0) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2437)) (.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2436)) (.cse12 (select v_ArrVal_2436 4))) (or (not (= v_ArrVal_2436 (store .cse10 .cse0 (select v_ArrVal_2436 .cse0)))) (= (select (select (store .cse11 .cse12 v_ArrVal_2438) (select (select (store .cse13 .cse12 v_ArrVal_2439) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= (store (select .cse11 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2438 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2438)) (not (= v_ArrVal_2439 (store (select .cse13 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (not (= v_ArrVal_2437 (store .cse5 .cse0 (select v_ArrVal_2437 .cse0)))) (< (select v_ArrVal_2437 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))))))) is different from false [2024-10-24 16:39:45,261 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 18 treesize of output 16 [2024-10-24 16:39:45,358 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-24 16:39:45,358 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 1 case distinctions, treesize of input 14 treesize of output 15 [2024-10-24 16:39:45,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-10-24 16:39:45,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:45,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-10-24 16:39:45,695 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 1 [2024-10-24 16:39:45,708 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 1 [2024-10-24 16:39:45,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse3 (< 0 .cse4))) (and (or (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2436)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2437)) (.cse1 (select v_ArrVal_2436 4))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_2438) (select (select (store .cse2 .cse1 v_ArrVal_2439) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2439)) (not (= v_ArrVal_2438 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2438 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (< (select v_ArrVal_2437 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) .cse3) (or (and (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2436)) (.cse7 (select v_ArrVal_2436 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2436 .cse4))) (= (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2439))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2439))))) (or (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2436)) (.cse10 (select v_ArrVal_2436 4))) (or (= (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_2439))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2439))))) .cse3)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (or (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2436 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2436)) (.cse13 (select v_ArrVal_2436 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2436 .cse4))) (= (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2439))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse12 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2439))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))) (or (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2436)) (.cse16 (select v_ArrVal_2436 4))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|) (= (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_2439))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse15 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2439))))) .cse3) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_80| Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2436)) (.cse17 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2437)) (.cse18 (select v_ArrVal_2436 4))) (or (= (select (select (store .cse17 .cse18 v_ArrVal_2438) (select (select (store .cse19 .cse18 v_ArrVal_2439) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2437 .cse4)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2436 .cse4))) (not (= (store (select .cse19 .cse18) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2439 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)) v_ArrVal_2439)) (not (= v_ArrVal_2438 (store (select .cse17 .cse18) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80| (select v_ArrVal_2438 |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|)))) (< (select v_ArrVal_2437 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_80|))))))) is different from false [2024-10-24 16:39:46,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:46,854 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 212 treesize of output 203 [2024-10-24 16:39:46,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:46,872 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 192 treesize of output 153 [2024-10-24 16:39:46,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:46,978 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 463 treesize of output 481 [2024-10-24 16:39:47,109 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-10-24 16:39:47,109 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 265 [2024-10-24 16:39:47,343 INFO L349 Elim1Store]: treesize reduction 22, result has 67.2 percent of original size [2024-10-24 16:39:47,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 638 treesize of output 656 [2024-10-24 16:39:47,464 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-10-24 16:39:47,464 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 429 treesize of output 405 [2024-10-24 16:39:47,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:47,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 328 treesize of output 346 [2024-10-24 16:39:47,698 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-10-24 16:39:47,698 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 322 [2024-10-24 16:39:48,315 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 8 treesize of output 4 [2024-10-24 16:39:49,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:49,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 129 treesize of output 133 [2024-10-24 16:39:49,507 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-24 16:39:49,507 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 78 [2024-10-24 16:39:49,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:49,771 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 37 [2024-10-24 16:39:49,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:49,878 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 37 [2024-10-24 16:39:49,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:49,926 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 61 [2024-10-24 16:39:50,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:50,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2024-10-24 16:39:50,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:50,076 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 50 treesize of output 50 [2024-10-24 16:39:50,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:39:50,209 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 23 [2024-10-24 16:39:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-10-24 16:39:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092946755] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:39:50,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:39:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2024-10-24 16:39:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255609471] [2024-10-24 16:39:50,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:39:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-24 16:39:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:39:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-24 16:39:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1810, Unknown=10, NotChecked=356, Total=2352 [2024-10-24 16:39:50,305 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 49 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 48 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)