./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:12:26,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:12:26,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:12:26,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:12:26,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:12:26,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:12:26,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:12:26,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:12:26,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:12:26,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:12:26,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:12:26,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:12:26,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:12:26,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:12:26,147 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:12:26,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:12:26,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:12:26,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:12:26,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:12:26,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:12:26,148 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:12:26,150 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:12:26,150 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:12:26,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:12:26,151 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:12:26,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:12:26,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:12:26,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:12:26,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:12:26,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:12:26,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:12:26,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:12:26,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:12:26,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:12:26,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:12:26,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:12:26,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:12:26,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:12:26,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:12:26,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:12:26,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:12:26,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:12:26,155 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-clean/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-clean/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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2024-10-11 18:12:26,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:12:26,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:12:26,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:12:26,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:12:26,383 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:12:26,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2024-10-11 18:12:27,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:12:27,815 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:12:27,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2024-10-11 18:12:27,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd786ef2a/37c09fe12f0d4ba8906ec8b1cdf6e181/FLAG249343dc8 [2024-10-11 18:12:27,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd786ef2a/37c09fe12f0d4ba8906ec8b1cdf6e181 [2024-10-11 18:12:27,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:12:27,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:12:27,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:12:27,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:12:27,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:12:27,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:27" (1/1) ... [2024-10-11 18:12:27,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f8799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:27, skipping insertion in model container [2024-10-11 18:12:27,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:27" (1/1) ... [2024-10-11 18:12:27,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:12:28,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:12:28,173 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:12:28,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:12:28,241 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:12:28,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28 WrapperNode [2024-10-11 18:12:28,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:12:28,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:12:28,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:12:28,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:12:28,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,293 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 126 [2024-10-11 18:12:28,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:12:28,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:12:28,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:12:28,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:12:28,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,328 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-10-11 18:12:28,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:12:28,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:12:28,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:12:28,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:12:28,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (1/1) ... [2024-10-11 18:12:28,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:12:28,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:28,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:12:28,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 18:12:28,407 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:12:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:12:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:12:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:12:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:12:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:12:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:12:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:12:28,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:12:28,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:12:28,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:12:28,741 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 18:12:28,742 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:12:28,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:12:28,786 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 18:12:28,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:28 BoogieIcfgContainer [2024-10-11 18:12:28,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:12:28,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:12:28,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:12:28,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:12:28,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:27" (1/3) ... [2024-10-11 18:12:28,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517faa6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:28, skipping insertion in model container [2024-10-11 18:12:28,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:28" (2/3) ... [2024-10-11 18:12:28,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517faa6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:28, skipping insertion in model container [2024-10-11 18:12:28,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:28" (3/3) ... [2024-10-11 18:12:28,796 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2024-10-11 18:12:28,809 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:12:28,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2024-10-11 18:12:28,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:12:28,853 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;@78b07744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:12:28,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-10-11 18:12:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 55 states have (on average 2.327272727272727) internal successors, (128), 106 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:12:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:12:28,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:28,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:12:28,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:28,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 8724, now seen corresponding path program 1 times [2024-10-11 18:12:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564804093] [2024-10-11 18:12:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:29,063 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-11 18:12:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564804093] [2024-10-11 18:12:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564804093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031426099] [2024-10-11 18:12:29,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:29,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:29,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:29,105 INFO L87 Difference]: Start difference. First operand has 112 states, 55 states have (on average 2.327272727272727) internal successors, (128), 106 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-11 18:12:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:29,239 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-10-11 18:12:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:29,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 18:12:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:29,247 INFO L225 Difference]: With dead ends: 102 [2024-10-11 18:12:29,247 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:12:29,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 18:12:29,252 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:29,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 65 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:12:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:12:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 99 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-10-11 18:12:29,335 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 2 [2024-10-11 18:12:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:29,335 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-10-11 18:12:29,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-11 18:12:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-10-11 18:12:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:12:29,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:29,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:12:29,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:12:29,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:29,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash 8725, now seen corresponding path program 1 times [2024-10-11 18:12:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559933317] [2024-10-11 18:12:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:29,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:29,421 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-11 18:12:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559933317] [2024-10-11 18:12:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559933317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:29,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:29,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410055621] [2024-10-11 18:12:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:29,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:29,425 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-11 18:12:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:29,532 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-10-11 18:12:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-11 18:12:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:29,534 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:12:29,535 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:12:29,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 18:12:29,536 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:29,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 77 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:12:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:12:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 102 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-10-11 18:12:29,550 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 2 [2024-10-11 18:12:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:29,550 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-10-11 18:12:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-11 18:12:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-10-11 18:12:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:12:29,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:29,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:12:29,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:12:29,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:29,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash -526560367, now seen corresponding path program 1 times [2024-10-11 18:12:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318808581] [2024-10-11 18:12:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:29,727 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-11 18:12:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318808581] [2024-10-11 18:12:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318808581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161702265] [2024-10-11 18:12:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:29,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:29,731 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-11 18:12:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:29,870 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-10-11 18:12:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-11 18:12:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:29,874 INFO L225 Difference]: With dead ends: 95 [2024-10-11 18:12:29,874 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 18:12:29,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:29,876 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 93 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:29,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 56 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 18:12:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 18:12:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 93 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-10-11 18:12:29,888 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 6 [2024-10-11 18:12:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:29,888 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-10-11 18:12:29,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-11 18:12:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-10-11 18:12:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:12:29,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:29,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:12:29,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:12:29,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:29,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash -526560366, now seen corresponding path program 1 times [2024-10-11 18:12:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323128669] [2024-10-11 18:12:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:30,058 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-11 18:12:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323128669] [2024-10-11 18:12:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323128669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:30,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:30,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081543455] [2024-10-11 18:12:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:12:30,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:12:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:12:30,060 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-11 18:12:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:30,194 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-10-11 18:12:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:12:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-11 18:12:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:30,195 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:12:30,195 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:12:30,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:30,196 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 133 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:30,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 143 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:12:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-11 18:12:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 97 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-11 18:12:30,201 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 6 [2024-10-11 18:12:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:30,201 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-11 18:12:30,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-11 18:12:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-11 18:12:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:12:30,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:30,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:30,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:12:30,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:30,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:30,202 INFO L85 PathProgramCache]: Analyzing trace with hash 781842551, now seen corresponding path program 1 times [2024-10-11 18:12:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504396384] [2024-10-11 18:12:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:30,274 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-11 18:12:30,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:30,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504396384] [2024-10-11 18:12:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504396384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158350923] [2024-10-11 18:12:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:30,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:30,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:30,276 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:30,390 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2024-10-11 18:12:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:12:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:12:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:30,391 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:12:30,391 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:12:30,391 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-11 18:12:30,392 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:30,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 161 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:12:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 18:12:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 96 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2024-10-11 18:12:30,401 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2024-10-11 18:12:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:30,401 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2024-10-11 18:12:30,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2024-10-11 18:12:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:12:30,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:30,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:12:30,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:30,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 781842552, now seen corresponding path program 1 times [2024-10-11 18:12:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960088977] [2024-10-11 18:12:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:30,592 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-11 18:12:30,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960088977] [2024-10-11 18:12:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960088977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:30,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:30,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901183747] [2024-10-11 18:12:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:30,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:30,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:30,594 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:30,721 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-10-11 18:12:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:12:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:12:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:30,725 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:12:30,725 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:12:30,725 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-11 18:12:30,726 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:30,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 203 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:12:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-10-11 18:12:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.619047619047619) internal successors, (102), 91 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-10-11 18:12:30,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 8 [2024-10-11 18:12:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:30,739 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-10-11 18:12:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-10-11 18:12:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:12:30,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:30,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:30,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:12:30,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:30,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1539873346, now seen corresponding path program 1 times [2024-10-11 18:12:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:30,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956807579] [2024-10-11 18:12:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:30,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:30,812 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-11 18:12:30,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956807579] [2024-10-11 18:12:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956807579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:30,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:30,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96198863] [2024-10-11 18:12:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:30,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:30,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:30,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:30,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:30,815 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:30,926 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2024-10-11 18:12:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:12:30,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 18:12:30,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:30,927 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:12:30,927 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:12:30,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 18:12:30,930 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:30,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 84 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:12:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-11 18:12:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 93 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-11 18:12:30,937 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 9 [2024-10-11 18:12:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:30,937 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-11 18:12:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-11 18:12:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:12:30,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:30,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:30,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:12:30,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:30,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -491415113, now seen corresponding path program 1 times [2024-10-11 18:12:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:30,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236011960] [2024-10-11 18:12:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:30,965 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-11 18:12:30,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:30,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236011960] [2024-10-11 18:12:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236011960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:12:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103431646] [2024-10-11 18:12:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:30,967 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:31,036 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-10-11 18:12:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:12:31,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:12:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:31,037 INFO L225 Difference]: With dead ends: 103 [2024-10-11 18:12:31,038 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:12:31,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:31,038 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 109 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:31,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 109 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:12:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2024-10-11 18:12:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-10-11 18:12:31,047 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 10 [2024-10-11 18:12:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:31,047 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-10-11 18:12:31,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-10-11 18:12:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:12:31,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:31,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:31,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:12:31,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:31,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1250274021, now seen corresponding path program 1 times [2024-10-11 18:12:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518076773] [2024-10-11 18:12:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,140 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-11 18:12:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518076773] [2024-10-11 18:12:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518076773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:12:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733763784] [2024-10-11 18:12:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:12:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:12:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:12:31,142 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:31,290 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-10-11 18:12:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:12:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:12:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:31,292 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:12:31,292 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:12:31,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:12:31,293 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 105 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:31,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 213 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:12:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2024-10-11 18:12:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-10-11 18:12:31,295 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 13 [2024-10-11 18:12:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:31,295 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-10-11 18:12:31,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-10-11 18:12:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:12:31,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:31,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:31,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:12:31,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:31,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1868570485, now seen corresponding path program 1 times [2024-10-11 18:12:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128369640] [2024-10-11 18:12:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,382 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-11 18:12:31,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128369640] [2024-10-11 18:12:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128369640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:31,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:31,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112767492] [2024-10-11 18:12:31,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:31,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:31,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:31,384 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-11 18:12:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:31,477 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-10-11 18:12:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13 [2024-10-11 18:12:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:31,478 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:12:31,478 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:12:31,479 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-11 18:12:31,479 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:31,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 153 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:12:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 18:12:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 98 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2024-10-11 18:12:31,481 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 13 [2024-10-11 18:12:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:31,482 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2024-10-11 18:12:31,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-11 18:12:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2024-10-11 18:12:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:12:31,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:31,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:31,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:12:31,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:31,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1868570486, now seen corresponding path program 1 times [2024-10-11 18:12:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:31,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708901375] [2024-10-11 18:12:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,612 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-11 18:12:31,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:31,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708901375] [2024-10-11 18:12:31,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708901375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:31,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714558784] [2024-10-11 18:12:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:31,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:31,614 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-11 18:12:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:31,695 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-10-11 18:12:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13 [2024-10-11 18:12:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:31,696 INFO L225 Difference]: With dead ends: 97 [2024-10-11 18:12:31,696 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 18:12:31,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:31,697 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:31,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 18:12:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-10-11 18:12:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.434782608695652) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2024-10-11 18:12:31,699 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 13 [2024-10-11 18:12:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-10-11 18:12:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-11 18:12:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2024-10-11 18:12:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:12:31,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:31,701 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:31,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:12:31,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -604088942, now seen corresponding path program 1 times [2024-10-11 18:12:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:31,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992176380] [2024-10-11 18:12:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992176380] [2024-10-11 18:12:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992176380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938555681] [2024-10-11 18:12:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:31,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:31,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:31,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:12:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:12:31,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:31,969 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-11 18:12:31,975 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-11 18:12:32,008 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-11 18:12:32,017 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-11 18:12:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:32,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:32,348 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 10 treesize of output 8 [2024-10-11 18:12:32,354 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 12 [2024-10-11 18:12:32,365 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 10 treesize of output 8 [2024-10-11 18:12:32,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938555681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:32,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 18:12:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574657319] [2024-10-11 18:12:32,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:12:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:12:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:12:32,380 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 18:12:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:32,627 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2024-10-11 18:12:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:12:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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 17 [2024-10-11 18:12:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:32,628 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:12:32,628 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:12:32,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:12:32,629 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 92 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:32,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 295 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:12:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2024-10-11 18:12:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 116 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2024-10-11 18:12:32,632 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 17 [2024-10-11 18:12:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:32,632 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2024-10-11 18:12:32,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 18:12:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2024-10-11 18:12:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:12:32,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:32,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:32,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:12:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 18:12:32,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:32,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1970753248, now seen corresponding path program 1 times [2024-10-11 18:12:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796816557] [2024-10-11 18:12:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:32,884 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-11 18:12:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796816557] [2024-10-11 18:12:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796816557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:12:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877295517] [2024-10-11 18:12:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:32,886 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:32,988 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2024-10-11 18:12:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 18:12:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:32,990 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:12:32,990 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:12:32,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11 18:12:32,990 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:32,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:12:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 18:12:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.434782608695652) internal successors, (132), 113 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2024-10-11 18:12:32,995 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 19 [2024-10-11 18:12:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:32,995 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2024-10-11 18:12:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2024-10-11 18:12:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:12:32,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:32,997 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:32,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:12:32,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:32,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1944889465, now seen corresponding path program 1 times [2024-10-11 18:12:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826198667] [2024-10-11 18:12:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826198667] [2024-10-11 18:12:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826198667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140780709] [2024-10-11 18:12:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:33,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:33,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:12:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:33,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:12:33,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:33,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:33,337 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-11 18:12:33,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:33,388 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-11 18:12:33,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:33,404 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-11 18:12:33,408 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-11 18:12:33,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:12:33,430 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-11 18:12:33,443 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-11 18:12:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:33,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:33,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2024-10-11 18:12:33,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_328) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2024-10-11 18:12:33,515 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_324 (Array Int Int))) (or (not (= v_ArrVal_324 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_328) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1))) is different from false [2024-10-11 18:12:33,561 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 40 treesize of output 38 [2024-10-11 18:12:33,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:33,570 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-11 18:12:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140780709] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:33,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2024-10-11 18:12:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265860024] [2024-10-11 18:12:33,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:33,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:12:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:12:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=165, Unknown=4, NotChecked=84, Total=306 [2024-10-11 18:12:33,583 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:34,095 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2024-10-11 18:12:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:12:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 18:12:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:34,096 INFO L225 Difference]: With dead ends: 165 [2024-10-11 18:12:34,096 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 18:12:34,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=464, Unknown=4, NotChecked=150, Total=812 [2024-10-11 18:12:34,097 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 191 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:34,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 326 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 493 Invalid, 3 Unknown, 410 Unchecked, 0.3s Time] [2024-10-11 18:12:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 18:12:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 127. [2024-10-11 18:12:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 125 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2024-10-11 18:12:34,100 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 20 [2024-10-11 18:12:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:34,101 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2024-10-11 18:12:34,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2024-10-11 18:12:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:12:34,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:34,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:34,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:12:34,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:34,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash 96503046, now seen corresponding path program 1 times [2024-10-11 18:12:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:34,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532218279] [2024-10-11 18:12:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532218279] [2024-10-11 18:12:34,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532218279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:34,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:34,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953544247] [2024-10-11 18:12:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:34,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:34,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:34,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:34,323 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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-11 18:12:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:34,361 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2024-10-11 18:12:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-11 18:12:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:34,361 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:12:34,361 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:12:34,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 18:12:34,362 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:34,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:12:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:12:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 18:12:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 129 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2024-10-11 18:12:34,364 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 22 [2024-10-11 18:12:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:34,365 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2024-10-11 18:12:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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-11 18:12:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2024-10-11 18:12:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:12:34,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:34,365 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:34,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:12:34,365 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1854495767, now seen corresponding path program 1 times [2024-10-11 18:12:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817395532] [2024-10-11 18:12:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:34,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817395532] [2024-10-11 18:12:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817395532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:34,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461868181] [2024-10-11 18:12:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:34,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:34,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:34,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:12:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:34,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 18:12:34,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:34,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:34,894 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-11 18:12:34,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:34,944 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-11 18:12:34,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:34,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:12:34,983 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-11 18:12:35,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:12:35,013 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-11 18:12:35,028 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-11 18:12:35,048 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 11 treesize of output 7 [2024-10-11 18:12:35,055 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-11 18:12:35,078 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 7 treesize of output 3 [2024-10-11 18:12:35,107 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:12:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:12:35,140 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 18:12:35,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-10-11 18:12:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:35,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:35,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:12:35,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_115| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 4)) 1)) (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~end~0#1.base_115| v_arrayElimArr_1) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1))) is different from false [2024-10-11 18:12:35,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_115| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_#t~malloc6#1.offset| 4)) 1)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_459) |v_ULTIMATE.start_main_~end~0#1.base_115| v_arrayElimArr_1) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1))) is different from false [2024-10-11 18:12:35,271 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_115| Int) (v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_459) |v_ULTIMATE.start_main_~end~0#1.base_115| v_arrayElimArr_1) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1) (not (= (select v_arrayElimArr_1 4) 1)))) is different from false [2024-10-11 18:12:35,321 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_453 (Array Int Int))) (or (not (= v_ArrVal_453 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_453 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~list~0#1.base|) 4) 1)))) is different from false [2024-10-11 18:12:35,335 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) 0))))) (and (or (forall ((v_ArrVal_453 (Array Int Int))) (or (not (= v_ArrVal_453 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_453 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~list~0#1.base|) 4) 1))) .cse0) (or (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) is different from false [2024-10-11 18:12:35,355 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 45 treesize of output 43 [2024-10-11 18:12:35,358 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:35,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,363 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-10-11 18:12:35,385 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-11 18:12:35,388 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-11 18:12:35,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2024-10-11 18:12:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:12:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461868181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:35,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-10-11 18:12:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537619656] [2024-10-11 18:12:35,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:35,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 18:12:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 18:12:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=522, Unknown=8, NotChecked=260, Total=930 [2024-10-11 18:12:35,468 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 30 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:36,173 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2024-10-11 18:12:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 18:12:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 30 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:12:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:36,174 INFO L225 Difference]: With dead ends: 191 [2024-10-11 18:12:36,174 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 18:12:36,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=415, Invalid=1403, Unknown=8, NotChecked=430, Total=2256 [2024-10-11 18:12:36,175 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 199 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 746 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:36,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 449 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 698 Invalid, 0 Unknown, 746 Unchecked, 0.4s Time] [2024-10-11 18:12:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 18:12:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 142. [2024-10-11 18:12:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 140 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2024-10-11 18:12:36,179 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 24 [2024-10-11 18:12:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:36,179 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2024-10-11 18:12:36,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 30 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2024-10-11 18:12:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:12:36,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:36,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:36,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:12:36,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:36,384 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:36,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1921991623, now seen corresponding path program 1 times [2024-10-11 18:12:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186176897] [2024-10-11 18:12:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:36,449 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-11 18:12:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186176897] [2024-10-11 18:12:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186176897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240646992] [2024-10-11 18:12:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:36,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:36,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:36,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:12:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:36,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:12:36,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:36,526 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-11 18:12:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:36,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:12:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240646992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:12:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-10-11 18:12:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354314567] [2024-10-11 18:12:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:12:36,558 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:36,614 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2024-10-11 18:12:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:12:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:12:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:36,615 INFO L225 Difference]: With dead ends: 136 [2024-10-11 18:12:36,615 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 18:12:36,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:12:36,616 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:36,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 161 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:12:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 18:12:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 18:12:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 113 states have (on average 1.345132743362832) internal successors, (152), 134 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2024-10-11 18:12:36,618 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 24 [2024-10-11 18:12:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:36,620 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2024-10-11 18:12:36,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2024-10-11 18:12:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:12:36,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:36,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:36,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:12:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:12:36,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:36,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 264298804, now seen corresponding path program 1 times [2024-10-11 18:12:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342469658] [2024-10-11 18:12:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:37,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342469658] [2024-10-11 18:12:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342469658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490785605] [2024-10-11 18:12:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:37,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:37,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:12:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:37,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:12:37,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:37,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:37,172 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:12:37,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:12:37,212 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-11 18:12:37,268 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:12:37,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:12:37,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:12:37,301 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-11 18:12:37,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:12:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:37,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:37,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:37,584 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 20 treesize of output 21 [2024-10-11 18:12:37,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:37,591 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 34 treesize of output 37 [2024-10-11 18:12:37,594 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-11 18:12:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490785605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:38,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2024-10-11 18:12:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149749177] [2024-10-11 18:12:38,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:12:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:38,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:12:38,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=579, Unknown=5, NotChecked=0, Total=702 [2024-10-11 18:12:38,011 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 18:12:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:38,810 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2024-10-11 18:12:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:12:38,811 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 18:12:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:38,811 INFO L225 Difference]: With dead ends: 201 [2024-10-11 18:12:38,812 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 18:12:38,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=908, Unknown=5, NotChecked=0, Total=1122 [2024-10-11 18:12:38,813 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 432 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:38,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 482 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:12:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 18:12:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2024-10-11 18:12:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 128 states have (on average 1.328125) internal successors, (170), 149 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2024-10-11 18:12:38,815 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 24 [2024-10-11 18:12:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:38,816 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2024-10-11 18:12:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 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-11 18:12:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2024-10-11 18:12:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:12:38,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:38,816 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:38,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:12:39,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:12:39,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:39,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash 264298805, now seen corresponding path program 1 times [2024-10-11 18:12:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568585014] [2024-10-11 18:12:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568585014] [2024-10-11 18:12:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568585014] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069914278] [2024-10-11 18:12:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:39,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:39,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:39,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:39,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:12:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:39,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 18:12:39,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:39,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:39,479 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-11 18:12:39,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:39,489 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-11 18:12:39,520 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-11 18:12:39,529 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-11 18:12:39,586 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:12:39,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:12:39,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:39,594 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-11 18:12:39,615 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:12:39,616 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-11 18:12:39,620 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-11 18:12:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:12:39,725 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 7 treesize of output 3 [2024-10-11 18:12:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:39,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:40,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:40,102 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 37 treesize of output 38 [2024-10-11 18:12:40,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:40,107 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 29 treesize of output 30 [2024-10-11 18:12:40,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:40,125 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 52 treesize of output 55 [2024-10-11 18:12:40,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:40,136 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 82 treesize of output 81 [2024-10-11 18:12:40,148 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 15 treesize of output 13 [2024-10-11 18:12:40,152 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 13 treesize of output 11 [2024-10-11 18:12:40,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:40,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-11 18:12:40,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:40,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:40,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:40,198 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 18:12:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069914278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:40,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2024-10-11 18:12:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037978005] [2024-10-11 18:12:40,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:40,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 18:12:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 18:12:40,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=660, Unknown=11, NotChecked=0, Total=756 [2024-10-11 18:12:40,349 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 18:12:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:41,240 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2024-10-11 18:12:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:12:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 18:12:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:41,241 INFO L225 Difference]: With dead ends: 188 [2024-10-11 18:12:41,241 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 18:12:41,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1235, Unknown=11, NotChecked=0, Total=1482 [2024-10-11 18:12:41,242 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 308 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:41,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 490 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:12:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 18:12:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 173. [2024-10-11 18:12:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 207 transitions. [2024-10-11 18:12:41,245 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 207 transitions. Word has length 24 [2024-10-11 18:12:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:41,245 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 207 transitions. [2024-10-11 18:12:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 18:12:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 207 transitions. [2024-10-11 18:12:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:12:41,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:41,245 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:41,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:12:41,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:41,446 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:41,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1589370392, now seen corresponding path program 1 times [2024-10-11 18:12:41,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:41,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483305877] [2024-10-11 18:12:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483305877] [2024-10-11 18:12:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483305877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471590831] [2024-10-11 18:12:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:41,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:41,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:12:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:41,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:12:41,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:41,624 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-11 18:12:41,627 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-11 18:12:41,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:12:41,634 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 11 [2024-10-11 18:12:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:41,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471590831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:41,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-10-11 18:12:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668594192] [2024-10-11 18:12:41,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:12:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:12:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:41,750 INFO L87 Difference]: Start difference. First operand 173 states and 207 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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-11 18:12:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:41,886 INFO L93 Difference]: Finished difference Result 195 states and 234 transitions. [2024-10-11 18:12:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:12:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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 25 [2024-10-11 18:12:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:41,887 INFO L225 Difference]: With dead ends: 195 [2024-10-11 18:12:41,887 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 18:12:41,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:12:41,888 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:41,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 195 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 18:12:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 179. [2024-10-11 18:12:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 177 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 212 transitions. [2024-10-11 18:12:41,891 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 212 transitions. Word has length 25 [2024-10-11 18:12:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 212 transitions. [2024-10-11 18:12:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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-11 18:12:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 212 transitions. [2024-10-11 18:12:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:12:41,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:41,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:41,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:12:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:42,096 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2025841473, now seen corresponding path program 1 times [2024-10-11 18:12:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717340034] [2024-10-11 18:12:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717340034] [2024-10-11 18:12:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717340034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636797883] [2024-10-11 18:12:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:42,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:42,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:42,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:12:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:42,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:12:42,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:12:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:42,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:12:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636797883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:42,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-10-11 18:12:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993477001] [2024-10-11 18:12:42,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:42,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:42,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:42,287 INFO L87 Difference]: Start difference. First operand 179 states and 212 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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-11 18:12:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:42,367 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2024-10-11 18:12:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:12:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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 26 [2024-10-11 18:12:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:42,368 INFO L225 Difference]: With dead ends: 186 [2024-10-11 18:12:42,368 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 18:12:42,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:42,368 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:42,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 18:12:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-11 18:12:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 163 states have internal predecessors, (194), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2024-10-11 18:12:42,371 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 26 [2024-10-11 18:12:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:42,371 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2024-10-11 18:12:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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-11 18:12:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2024-10-11 18:12:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:12:42,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:42,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:42,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:12:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:12:42,573 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:12:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -536662890, now seen corresponding path program 1 times [2024-10-11 18:12:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644960442] [2024-10-11 18:12:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644960442] [2024-10-11 18:12:42,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644960442] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657113949] [2024-10-11 18:12:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:42,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:42,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:42,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:12:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:43,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:12:43,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:43,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:43,068 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:12:43,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:12:43,101 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-11 18:12:43,153 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:12:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:12:43,177 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:12:43,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:12:43,203 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-10-11 18:12:43,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-10-11 18:12:43,248 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-11 18:12:43,248 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 1 case distinctions, treesize of input 52 treesize of output 28 [2024-10-11 18:12:43,335 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-11 18:12:43,335 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 78 treesize of output 55 [2024-10-11 18:12:43,367 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 18:12:43,368 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 64 [2024-10-11 18:12:43,583 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:12:43,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2024-10-11 18:12:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:43,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:43,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:43,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:12:44,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:44,005 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 30 treesize of output 31 [2024-10-11 18:12:44,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:44,014 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 190 treesize of output 189 [2024-10-11 18:12:44,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:44,024 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 88 treesize of output 80 [2024-10-11 18:12:44,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-11 18:12:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657113949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:55,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 35 [2024-10-11 18:12:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170446752] [2024-10-11 18:12:55,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 18:12:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 18:12:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1071, Unknown=11, NotChecked=0, Total=1260 [2024-10-11 18:12:55,017 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 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-11 18:13:00,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:13:05,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:13:09,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:13:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:10,512 INFO L93 Difference]: Finished difference Result 262 states and 302 transitions. [2024-10-11 18:13:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 18:13:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:13:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:10,514 INFO L225 Difference]: With dead ends: 262 [2024-10-11 18:13:10,514 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 18:13:10,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=418, Invalid=2021, Unknown=11, NotChecked=0, Total=2450 [2024-10-11 18:13:10,514 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 605 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 93 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:10,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 838 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1915 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2024-10-11 18:13:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 18:13:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 177. [2024-10-11 18:13:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 175 states have internal predecessors, (208), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 211 transitions. [2024-10-11 18:13:10,518 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 211 transitions. Word has length 28 [2024-10-11 18:13:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 211 transitions. [2024-10-11 18:13:10,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 36 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-11 18:13:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2024-10-11 18:13:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:13:10,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:10,519 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:10,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:13:10,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:10,720 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:13:10,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -536662889, now seen corresponding path program 1 times [2024-10-11 18:13:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:10,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370811487] [2024-10-11 18:13:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370811487] [2024-10-11 18:13:11,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370811487] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191875] [2024-10-11 18:13:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:11,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:11,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:11,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:13:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:11,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 18:13:11,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:11,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:13:11,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:13:11,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:13:11,683 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 8 treesize of output 1 [2024-10-11 18:13:11,739 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-11 18:13:11,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 15 treesize of output 1 [2024-10-11 18:13:11,896 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:11,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:13:11,926 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:13:11,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2024-10-11 18:13:12,015 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:13:12,041 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:13:12,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2024-10-11 18:13:12,063 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:13:12,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:13:12,090 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 18:13:12,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 18:13:12,159 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-11 18:13:12,159 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 1 case distinctions, treesize of input 52 treesize of output 28 [2024-10-11 18:13:12,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:13:12,319 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-11 18:13:12,319 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 76 treesize of output 57 [2024-10-11 18:13:12,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:13:12,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:13:12,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-10-11 18:13:12,448 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 18:13:12,448 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 96 [2024-10-11 18:13:12,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2024-10-11 18:13:12,809 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:13:12,809 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2024-10-11 18:13:12,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 18:13:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:12,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:13,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (forall ((v_ArrVal_958 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|) 5)) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store .cse0 .cse1 (select v_ArrVal_958 .cse1)))))) (forall ((v_ArrVal_958 (Array Int Int))) (or (forall ((v_ArrVal_957 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store .cse0 .cse1 (select v_ArrVal_958 .cse1)))))))) is different from false [2024-10-11 18:13:13,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (forall ((v_ArrVal_958 (Array Int Int))) (or (forall ((v_ArrVal_957 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store .cse0 .cse1 (select v_ArrVal_958 .cse1)))))) (forall ((v_ArrVal_958 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|) 5)) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store .cse0 .cse1 (select v_ArrVal_958 .cse1)))))))) is different from false [2024-10-11 18:13:13,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3 0)) (.cse2 (+ .cse3 4))) (and (forall ((v_ArrVal_958 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store .cse1 .cse2 (select v_ArrVal_958 .cse2)))))) (forall ((v_ArrVal_958 (Array Int Int))) (or (forall ((v_ArrVal_957 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_957) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store .cse1 .cse2 (select v_ArrVal_958 .cse2))))))))) is different from false [2024-10-11 18:13:13,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~malloc6#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.offset|)))) (or (forall ((v_ArrVal_957 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< (+ 7 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= v_ArrVal_958 (store (store (select .cse0 |c_ULTIMATE.start_main_#t~malloc6#1.base|) |c_ULTIMATE.start_main_#t~malloc6#1.offset| 0) .cse1 (select v_ArrVal_958 .cse1))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.offset|)))) (or (not (= v_ArrVal_958 (store (store (select .cse3 |c_ULTIMATE.start_main_#t~malloc6#1.base|) |c_ULTIMATE.start_main_#t~malloc6#1.offset| 0) .cse1 (select v_ArrVal_958 .cse1)))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (or (< 0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|) 5)) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|)))))))) is different from false [2024-10-11 18:13:13,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:13,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2024-10-11 18:13:13,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:13,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 118 treesize of output 133 [2024-10-11 18:13:13,430 INFO L349 Elim1Store]: treesize reduction 11, result has 35.3 percent of original size [2024-10-11 18:13:13,431 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 19 treesize of output 11 [2024-10-11 18:13:13,507 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 45 treesize of output 39 [2024-10-11 18:13:13,539 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 v_prenex_6))) (or (not (= 0 (select |c_#valid| .cse0))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_951 Int) (v_ArrVal_957 (Array Int Int)) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_10))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_8) (not (= v_prenex_7 (store (store (select .cse1 .cse0) 0 0) 4 (select v_prenex_7 4)))) (< (+ 7 (select (select (store .cse1 .cse0 v_prenex_7) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_8)) (select (store |c_#length| .cse0 v_ArrVal_951) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_957) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_8))) (< v_prenex_8 0)))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_DerPreprocessor_8 Int)) (not (= (select (store (store v_arrayElimArr_10 v_prenex_6 v_DerPreprocessor_8) |ULTIMATE.start_main_~end~0#1.offset| 0) v_prenex_6) v_DerPreprocessor_8))) (not (= (select v_arrayElimArr_10 v_prenex_6) 0))))))) (forall ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~end~0#1.offset| Int) (v_arrayElimCell_100 Int) (v_ArrVal_958 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_128| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_11))) (or (not (= (select |c_#valid| v_arrayElimCell_100) 0)) (not (= v_ArrVal_958 (store (store (select .cse2 v_arrayElimCell_100) 0 0) 4 (select v_ArrVal_958 4)))) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (not (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~end~0#1.offset|) 0)) (< 0 (+ 5 (select (select (store .cse2 v_arrayElimCell_100 v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|))))) is different from false [2024-10-11 18:13:13,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_958 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_128| Int) (v_subst_2 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_arrayElimArr_11))) (or (< 0 (+ 5 (select (select (store .cse0 v_arrayElimCell_100 v_ArrVal_958) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_128|))) (not (= (select |c_#valid| v_arrayElimCell_100) 0)) (< |v_ULTIMATE.start_main_~end~0#1.offset_128| 0) (not (= (select v_arrayElimArr_11 v_subst_2) 0)) (not (= v_ArrVal_958 (store (store (select .cse0 v_arrayElimCell_100) 0 0) 4 (select v_ArrVal_958 4)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_128|)))) (forall ((v_prenex_6 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_9 v_prenex_6))) (or (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_DerPreprocessor_8 Int) (v_subst_1 Int)) (not (= (select (store (store v_arrayElimArr_10 v_prenex_6 v_DerPreprocessor_8) v_subst_1 0) v_prenex_6) v_DerPreprocessor_8))) (forall ((v_ArrVal_951 Int) (v_ArrVal_957 (Array Int Int)) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse1 v_arrayElimArr_10))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_8) (not (= v_prenex_7 (store (store (select .cse2 .cse3) 0 0) 4 (select v_prenex_7 4)))) (< (+ 7 (select (select (store .cse2 .cse3 v_prenex_7) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_8)) (select (store |c_#length| .cse3 v_ArrVal_951) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_9) .cse3 v_ArrVal_957) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_8))) (< v_prenex_8 0)))) (not (= (select v_arrayElimArr_10 v_prenex_6) 0)))) (not (= 0 (select |c_#valid| .cse3)))))))) is different from false [2024-10-11 18:13:13,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:13,774 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 49 treesize of output 41 [2024-10-11 18:13:13,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:13:13,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:13,797 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 2 case distinctions, treesize of input 104 treesize of output 114 [2024-10-11 18:13:13,876 INFO L349 Elim1Store]: treesize reduction 56, result has 46.7 percent of original size [2024-10-11 18:13:13,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 105 [2024-10-11 18:13:13,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 18:13:13,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:13,959 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-11 18:13:14,138 INFO L349 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2024-10-11 18:13:14,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 119 [2024-10-11 18:13:14,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:14,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 135 [2024-10-11 18:13:14,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:14,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 143 treesize of output 171 [2024-10-11 18:13:15,198 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 0 case distinctions, treesize of input 71 treesize of output 63 [2024-10-11 18:13:15,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:15,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 214 treesize of output 236 [2024-10-11 18:13:17,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:17,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 1 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 104 case distinctions, treesize of input 463 treesize of output 1251 [2024-10-11 18:13:39,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:39,540 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 80 treesize of output 72 [2024-10-11 18:13:39,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:39,555 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 44 treesize of output 45 [2024-10-11 18:13:39,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:39,585 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 302 treesize of output 301 [2024-10-11 18:13:39,617 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:13:39,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:39,642 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 2 case distinctions, treesize of input 492 treesize of output 496 [2024-10-11 18:13:39,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:39,669 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 152 treesize of output 138 [2024-10-11 18:13:39,797 INFO L349 Elim1Store]: treesize reduction 56, result has 46.7 percent of original size [2024-10-11 18:13:39,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 129 [2024-10-11 18:13:39,816 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 42 treesize of output 38 [2024-10-11 18:13:39,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 18:13:39,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:39,873 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-11 18:13:40,148 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-10-11 18:13:40,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 149 [2024-10-11 18:13:40,398 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-10-11 18:13:40,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 125 treesize of output 139 [2024-10-11 18:13:40,663 INFO L349 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2024-10-11 18:13:40,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 255 treesize of output 287 [2024-10-11 18:13:42,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:42,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-11 18:13:42,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-11 18:13:42,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:42,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2024-10-11 18:13:42,270 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 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:13:42,301 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 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:13:42,477 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 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:13:42,502 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 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:13:42,546 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 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:13:42,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:42,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-11 18:13:42,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:42,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-11 18:13:42,769 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-10-11 18:13:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 101 [2024-10-11 18:13:43,046 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-10-11 18:13:43,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 76 [2024-10-11 18:13:43,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:43,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 618 treesize of output 598 [2024-10-11 18:13:45,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:45,904 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 518 treesize of output 531 [2024-10-11 18:13:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:13:49,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:13:49,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2024-10-11 18:13:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579295907] [2024-10-11 18:13:49,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:13:49,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 18:13:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:13:49,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 18:13:49,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=864, Unknown=6, NotChecked=390, Total=1406 [2024-10-11 18:13:49,888 INFO L87 Difference]: Start difference. First operand 177 states and 211 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 38 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-11 18:13:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:54,650 INFO L93 Difference]: Finished difference Result 242 states and 278 transitions. [2024-10-11 18:13:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 18:13:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:13:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:54,651 INFO L225 Difference]: With dead ends: 242 [2024-10-11 18:13:54,651 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 18:13:54,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=460, Invalid=2314, Unknown=6, NotChecked=642, Total=3422 [2024-10-11 18:13:54,652 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 456 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 3124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1264 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:54,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 728 Invalid, 3124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1810 Invalid, 0 Unknown, 1264 Unchecked, 2.3s Time] [2024-10-11 18:13:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 18:13:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 165. [2024-10-11 18:13:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 163 states have internal predecessors, (194), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2024-10-11 18:13:54,655 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 28 [2024-10-11 18:13:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:54,655 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2024-10-11 18:13:54,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 38 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-11 18:13:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2024-10-11 18:13:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:13:54,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:54,655 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:54,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:13:54,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:13:54,856 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-10-11 18:13:54,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1786338364, now seen corresponding path program 2 times [2024-10-11 18:13:54,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:54,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232151445] [2024-10-11 18:13:54,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:54,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232151445] [2024-10-11 18:13:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232151445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650585043] [2024-10-11 18:13:55,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:13:55,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:55,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:55,270 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:55,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:13:55,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:13:55,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:13:55,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:13:55,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:55,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:13:55,430 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:13:55,430 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-11 18:13:55,465 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-11 18:13:55,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:13:55,548 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-11 18:13:55,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-10-11 18:13:55,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:13:55,623 INFO L349 Elim1Store]: treesize reduction 63, result has 10.0 percent of original size [2024-10-11 18:13:55,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 90 [2024-10-11 18:13:55,641 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-10-11 18:13:55,641 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-10-11 18:13:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:55,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:56,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (forall ((v_ArrVal_1036 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1036 .cse1)) v_ArrVal_1036)) (forall ((v_ArrVal_1037 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_136| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_136| 0) (= 0 (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 .cse1 v_ArrVal_1037)))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)) (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_136|))))) (forall ((v_ArrVal_1036 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1036 .cse1)) v_ArrVal_1036)) (forall ((v_ArrVal_1037 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_136| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_136| 0) (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1036))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 .cse1 v_ArrVal_1037)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)) 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_136|))))))) is different from false [2024-10-11 18:13:56,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) (.cse3 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (forall ((v_ArrVal_1036 (Array Int Int))) (or (forall ((v_ArrVal_1037 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_136| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_136| 0) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1036))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 .cse2 v_ArrVal_1037)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)) 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_136|))) (not (= (store .cse3 .cse2 (select v_ArrVal_1036 .cse2)) v_ArrVal_1036)))) (forall ((v_ArrVal_1036 (Array Int Int))) (or (forall ((v_ArrVal_1037 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_136| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_136| 0) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 .cse2 v_ArrVal_1037)))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)) (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|))) 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_136|))) (not (= (store .cse3 .cse2 (select v_ArrVal_1036 .cse2)) v_ArrVal_1036)))))) is different from false [2024-10-11 18:13:56,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse4 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse6 0)) (.cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse6 0)) (.cse3 (+ .cse6 4))) (and (forall ((v_ArrVal_1036 (Array Int Int))) (or (forall ((v_ArrVal_1037 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_136| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_136| 0) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 (store .cse2 .cse3 v_ArrVal_1037)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1036) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|))) 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_136|))) (not (= v_ArrVal_1036 (store .cse4 .cse3 (select v_ArrVal_1036 .cse3)))))) (forall ((v_ArrVal_1036 (Array Int Int))) (or (not (= v_ArrVal_1036 (store .cse4 .cse3 (select v_ArrVal_1036 .cse3)))) (forall ((v_ArrVal_1037 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_136| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_136| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_136|) (= (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1036))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 (store .cse2 .cse3 v_ArrVal_1037)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_136|)) 0)))))))) is different from false [2024-10-11 18:13:56,316 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 410 treesize of output 406 [2024-10-11 18:13:56,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:56,325 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 322 treesize of output 226 [2024-10-11 18:13:56,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:56,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 622 treesize of output 628 [2024-10-11 18:13:56,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 18:13:57,444 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 5 treesize of output 3 [2024-10-11 18:13:58,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 236 treesize of output 306