./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:24:55,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:24:55,177 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:24:55,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:24:55,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:24:55,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:24:55,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:24:55,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:24:55,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:24:55,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:24:55,236 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:24:55,237 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:24:55,237 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:24:55,237 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:24:55,237 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:24:55,237 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:24:55,237 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:24:55,238 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:24:55,239 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:24:55,239 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:24:55,239 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:24:55,240 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:24:55,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:24:55,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:24:55,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:24:55,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:24:55,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:24:55,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:24:55,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:24:55,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:24:55,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:24:55,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:24:55,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:24:55,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:24:55,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:24:55,245 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:24:55,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:24:55,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:24:55,245 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:24:55,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:24:55,246 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2024-11-14 05:24:55,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:24:55,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:24:55,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:24:55,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:24:55,679 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:24:55,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i Unable to find full path for "g++" [2024-11-14 05:24:57,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:24:58,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:24:58,383 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2024-11-14 05:24:58,412 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/data/6c902c526/56b510fafb1d4247a5f9d4343769577f/FLAG2b4dec285 [2024-11-14 05:24:58,440 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/data/6c902c526/56b510fafb1d4247a5f9d4343769577f [2024-11-14 05:24:58,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:24:58,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:24:58,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:24:58,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:24:58,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:24:58,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:58" (1/1) ... [2024-11-14 05:24:58,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7fd0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:58, skipping insertion in model container [2024-11-14 05:24:58,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:58" (1/1) ... [2024-11-14 05:24:58,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:24:58,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:24:59,010 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:24:59,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:24:59,141 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:24:59,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59 WrapperNode [2024-11-14 05:24:59,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:24:59,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:24:59,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:24:59,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:24:59,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,211 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2024-11-14 05:24:59,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:24:59,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:24:59,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:24:59,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:24:59,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:24:59,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:24:59,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:24:59,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:24:59,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (1/1) ... [2024-11-14 05:24:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:24:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:24:59,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:24:59,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:24:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:24:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:24:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:24:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:24:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:24:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:24:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:24:59,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:24:59,524 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:24:59,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:25:00,035 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-14 05:25:00,036 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:25:00,121 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:25:00,121 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 05:25:00,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:00 BoogieIcfgContainer [2024-11-14 05:25:00,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:25:00,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:25:00,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:25:00,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:25:00,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:24:58" (1/3) ... [2024-11-14 05:25:00,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f29224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:00, skipping insertion in model container [2024-11-14 05:25:00,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:59" (2/3) ... [2024-11-14 05:25:00,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f29224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:00, skipping insertion in model container [2024-11-14 05:25:00,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:00" (3/3) ... [2024-11-14 05:25:00,136 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2024-11-14 05:25:00,159 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:25:00,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_extends_pointer.i that has 1 procedures, 52 locations, 1 initial locations, 2 loop locations, and 27 error locations. [2024-11-14 05:25:00,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:25:00,250 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=FINITE_AUTOMATA, 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;@7acdea80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:25:00,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-14 05:25:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:25:00,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:00,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:25:00,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:00,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 3755, now seen corresponding path program 1 times [2024-11-14 05:25:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:00,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235634053] [2024-11-14 05:25:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:00,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235634053] [2024-11-14 05:25:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235634053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:25:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128157109] [2024-11-14 05:25:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:00,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:25:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:25:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:00,602 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-11-14 05:25:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:00,806 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-14 05:25:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:25:00,809 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-11-14 05:25:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:00,819 INFO L225 Difference]: With dead ends: 49 [2024-11-14 05:25:00,819 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 05:25:00,822 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-11-14 05:25:00,828 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:00,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:25:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 05:25:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-14 05:25:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-14 05:25:00,877 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 2 [2024-11-14 05:25:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-14 05:25:00,881 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-11-14 05:25:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-14 05:25:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:25:00,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:00,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:25:00,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:25:00,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 3756, now seen corresponding path program 1 times [2024-11-14 05:25:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825868204] [2024-11-14 05:25:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:01,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-11-14 05:25:01,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825868204] [2024-11-14 05:25:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825868204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:25:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940659705] [2024-11-14 05:25:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:25:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:25:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:01,062 INFO L87 Difference]: Start difference. First operand 47 states and 52 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-11-14 05:25:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:01,186 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-14 05:25:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:25:01,187 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-11-14 05:25:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:01,188 INFO L225 Difference]: With dead ends: 43 [2024-11-14 05:25:01,188 INFO L226 Difference]: Without dead ends: 43 [2024-11-14 05:25:01,189 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-11-14 05:25:01,190 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:01,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-14 05:25:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-14 05:25:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 41 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-11-14 05:25:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-14 05:25:01,196 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 2 [2024-11-14 05:25:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:01,196 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-14 05:25:01,196 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-11-14 05:25:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-14 05:25:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:25:01,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:01,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:01,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:25:01,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:01,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash -947642886, now seen corresponding path program 1 times [2024-11-14 05:25:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032286859] [2024-11-14 05:25:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:01,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032286859] [2024-11-14 05:25:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032286859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:25:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113794362] [2024-11-14 05:25:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:01,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:25:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:01,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:25:01,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:25:01,394 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-11-14 05:25:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:01,561 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-11-14 05:25:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:25:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-11-14 05:25:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:01,564 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:25:01,564 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:25:01,564 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-11-14 05:25:01,565 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:01,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:25:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2024-11-14 05:25:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-14 05:25:01,572 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 8 [2024-11-14 05:25:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:01,572 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-14 05:25:01,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-11-14 05:25:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-14 05:25:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:25:01,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:01,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:01,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:25:01,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:01,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -947644282, now seen corresponding path program 1 times [2024-11-14 05:25:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825235911] [2024-11-14 05:25:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:01,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825235911] [2024-11-14 05:25:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825235911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:01,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:25:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960400016] [2024-11-14 05:25:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:01,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:25:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:25:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:25:01,688 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-11-14 05:25:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:01,842 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-11-14 05:25:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:25:01,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-11-14 05:25:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:01,844 INFO L225 Difference]: With dead ends: 46 [2024-11-14 05:25:01,844 INFO L226 Difference]: Without dead ends: 46 [2024-11-14 05:25:01,845 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-11-14 05:25:01,846 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:01,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 25 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-14 05:25:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-11-14 05:25:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.7) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-14 05:25:01,856 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 8 [2024-11-14 05:25:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:01,857 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-14 05:25:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-11-14 05:25:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-14 05:25:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:25:01,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:01,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:01,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:25:01,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:01,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -947644281, now seen corresponding path program 1 times [2024-11-14 05:25:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:01,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770935290] [2024-11-14 05:25:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:02,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770935290] [2024-11-14 05:25:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770935290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:02,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:02,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:25:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639011005] [2024-11-14 05:25:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:02,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:25:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:25:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:25:02,204 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-14 05:25:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:02,434 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-11-14 05:25:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:25:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-14 05:25:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:02,436 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:25:02,439 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:25:02,439 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-11-14 05:25:02,440 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:02,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:25:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:25:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-14 05:25:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-14 05:25:02,453 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 8 [2024-11-14 05:25:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:02,453 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-14 05:25:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-14 05:25:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-14 05:25:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:25:02,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:02,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:25:02,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash -152100308, now seen corresponding path program 1 times [2024-11-14 05:25:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518728631] [2024-11-14 05:25:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:02,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:02,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518728631] [2024-11-14 05:25:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518728631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:02,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:25:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438454959] [2024-11-14 05:25:02,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:25:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:02,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:25:02,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:25:02,774 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:02,888 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-11-14 05:25:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:25:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-14 05:25:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:02,890 INFO L225 Difference]: With dead ends: 58 [2024-11-14 05:25:02,890 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 05:25:02,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:25:02,891 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:02,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 05:25:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-14 05:25:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 57 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-11-14 05:25:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-11-14 05:25:02,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2024-11-14 05:25:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:02,904 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-11-14 05:25:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-11-14 05:25:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:25:02,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:02,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:02,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:25:02,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1052055715, now seen corresponding path program 1 times [2024-11-14 05:25:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:02,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902629393] [2024-11-14 05:25:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:03,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902629393] [2024-11-14 05:25:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902629393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:25:03,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395222253] [2024-11-14 05:25:03,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:03,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:25:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:03,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:25:03,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:25:03,067 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:03,208 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2024-11-14 05:25:03,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:25:03,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 05:25:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:03,210 INFO L225 Difference]: With dead ends: 72 [2024-11-14 05:25:03,210 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 05:25:03,210 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-11-14 05:25:03,211 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:03,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 40 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 05:25:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-14 05:25:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 66 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-14 05:25:03,217 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 12 [2024-11-14 05:25:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-14 05:25:03,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-14 05:25:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:25:03,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:03,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:03,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:25:03,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1052066700, now seen corresponding path program 1 times [2024-11-14 05:25:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692218614] [2024-11-14 05:25:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:03,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692218614] [2024-11-14 05:25:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692218614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:03,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:25:03,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127150293] [2024-11-14 05:25:03,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:25:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:25:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:25:03,762 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:03,962 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-11-14 05:25:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:25:03,963 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), 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 12 [2024-11-14 05:25:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:03,964 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:25:03,964 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:25:03,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:25:03,965 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:03,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:25:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-14 05:25:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 61 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-11-14 05:25:03,971 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 12 [2024-11-14 05:25:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:03,971 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-11-14 05:25:03,971 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-11-14 05:25:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:25:03,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:03,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:03,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:25:03,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1415336920, now seen corresponding path program 1 times [2024-11-14 05:25:03,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:03,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251116299] [2024-11-14 05:25:03,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:04,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:04,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251116299] [2024-11-14 05:25:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251116299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345429906] [2024-11-14 05:25:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:04,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:04,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:25:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:04,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:25:04,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:04,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:25:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:04,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345429906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:04,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1872239645] [2024-11-14 05:25:04,569 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 05:25:04,571 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:04,576 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:04,581 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:04,582 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:05,613 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:25:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1872239645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:10,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [3, 3, 3] total 15 [2024-11-14 05:25:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684131948] [2024-11-14 05:25:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:25:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:10,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:25:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=206, Unknown=1, NotChecked=0, Total=272 [2024-11-14 05:25:10,446 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:12,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:14,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:17,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:25:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:19,257 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2024-11-14 05:25:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:25:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 15 [2024-11-14 05:25:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:19,259 INFO L225 Difference]: With dead ends: 78 [2024-11-14 05:25:19,259 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 05:25:19,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=65, Invalid=206, Unknown=1, NotChecked=0, Total=272 [2024-11-14 05:25:19,260 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:19,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 4 Unknown, 0 Unchecked, 8.8s Time] [2024-11-14 05:25:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 05:25:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 05:25:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-11-14 05:25:19,277 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 15 [2024-11-14 05:25:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-11-14 05:25:19,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-11-14 05:25:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:25:19,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:19,283 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:19,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:25:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:19,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1090155128, now seen corresponding path program 1 times [2024-11-14 05:25:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890652172] [2024-11-14 05:25:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:19,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890652172] [2024-11-14 05:25:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890652172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:25:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898937929] [2024-11-14 05:25:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:25:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:19,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:25:19,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:25:19,681 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:19,832 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-14 05:25:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:25:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-11-14 05:25:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:19,834 INFO L225 Difference]: With dead ends: 66 [2024-11-14 05:25:19,834 INFO L226 Difference]: Without dead ends: 66 [2024-11-14 05:25:19,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:25:19,835 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:19,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 60 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-14 05:25:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-11-14 05:25:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 59 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-11-14 05:25:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-11-14 05:25:19,847 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 15 [2024-11-14 05:25:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:19,847 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-11-14 05:25:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-11-14 05:25:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:25:19,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:19,848 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:19,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:25:19,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2129147659, now seen corresponding path program 1 times [2024-11-14 05:25:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:19,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985685795] [2024-11-14 05:25:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:20,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985685795] [2024-11-14 05:25:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985685795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:25:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227640556] [2024-11-14 05:25:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:25:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:25:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:25:20,301 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:20,494 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-11-14 05:25:20,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:25:20,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 05:25:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:20,495 INFO L225 Difference]: With dead ends: 65 [2024-11-14 05:25:20,495 INFO L226 Difference]: Without dead ends: 65 [2024-11-14 05:25:20,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:25:20,496 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:20,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-14 05:25:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-11-14 05:25:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4375) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-14 05:25:20,500 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 19 [2024-11-14 05:25:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:20,501 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-14 05:25:20,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-14 05:25:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:25:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:20,502 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-11-14 05:25:20,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:25:20,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:20,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1579067890, now seen corresponding path program 1 times [2024-11-14 05:25:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:20,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907466756] [2024-11-14 05:25:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:21,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:21,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907466756] [2024-11-14 05:25:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907466756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:25:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306093786] [2024-11-14 05:25:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:21,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:25:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:25:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:25:21,053 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:21,395 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-14 05:25:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:25:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-14 05:25:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:21,396 INFO L225 Difference]: With dead ends: 64 [2024-11-14 05:25:21,396 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 05:25:21,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:25:21,397 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:21,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:25:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 05:25:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-14 05:25:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-14 05:25:21,406 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 20 [2024-11-14 05:25:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:21,406 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-14 05:25:21,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2024-11-14 05:25:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:25:21,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:21,407 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] [2024-11-14 05:25:21,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:25:21,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:21,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1706464233, now seen corresponding path program 1 times [2024-11-14 05:25:21,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:21,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881266798] [2024-11-14 05:25:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:22,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881266798] [2024-11-14 05:25:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881266798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:25:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173765839] [2024-11-14 05:25:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:25:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:25:22,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:25:22,016 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:22,191 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-14 05:25:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:25:22,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 05:25:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:22,192 INFO L225 Difference]: With dead ends: 60 [2024-11-14 05:25:22,192 INFO L226 Difference]: Without dead ends: 60 [2024-11-14 05:25:22,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:25:22,193 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:22,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-14 05:25:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-14 05:25:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-11-14 05:25:22,201 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2024-11-14 05:25:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-11-14 05:25:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-14 05:25:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:25:22,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:22,202 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] [2024-11-14 05:25:22,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:25:22,203 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -521203319, now seen corresponding path program 1 times [2024-11-14 05:25:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873281300] [2024-11-14 05:25:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:22,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873281300] [2024-11-14 05:25:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873281300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714463770] [2024-11-14 05:25:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:22,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:22,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:25:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:22,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:25:22,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:22,975 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-11-14 05:25:23,072 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-14 05:25:23,072 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 55 treesize of output 54 [2024-11-14 05:25:23,099 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 36 treesize of output 26 [2024-11-14 05:25:23,231 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 65 treesize of output 52 [2024-11-14 05:25:23,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2024-11-14 05:25:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:24,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:24,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:24,656 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 19 treesize of output 20 [2024-11-14 05:25:24,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:24,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2024-11-14 05:25:24,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 05:25:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:25,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714463770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1503266518] [2024-11-14 05:25:25,111 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:25:25,111 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:25,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:25,112 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:25,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:33,303 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:25:42,097 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1919#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:25:42,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:25:42,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:42,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 30 [2024-11-14 05:25:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572735973] [2024-11-14 05:25:42,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:42,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:25:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:42,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:25:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2199, Unknown=5, NotChecked=0, Total=2450 [2024-11-14 05:25:42,106 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:45,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:25:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:47,081 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2024-11-14 05:25:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 05:25:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:25:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:47,083 INFO L225 Difference]: With dead ends: 105 [2024-11-14 05:25:47,083 INFO L226 Difference]: Without dead ends: 105 [2024-11-14 05:25:47,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=582, Invalid=4667, Unknown=7, NotChecked=0, Total=5256 [2024-11-14 05:25:47,088 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 99 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 32 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:47,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 185 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 659 Invalid, 6 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 05:25:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-14 05:25:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 63. [2024-11-14 05:25:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.392156862745098) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-14 05:25:47,097 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2024-11-14 05:25:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:47,098 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-14 05:25:47,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:25:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-14 05:25:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:25:47,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:47,099 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] [2024-11-14 05:25:47,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:25:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 05:25:47,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:25:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash -521204715, now seen corresponding path program 1 times [2024-11-14 05:25:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798122652] [2024-11-14 05:25:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:47,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798122652] [2024-11-14 05:25:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798122652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588326577] [2024-11-14 05:25:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:47,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:47,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:47,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:25:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:47,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 05:25:47,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:47,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:25:47,893 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:25:47,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:25:47,940 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-11-14 05:25:48,005 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:25:48,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 05:25:48,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-14 05:25:48,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:48,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2024-11-14 05:25:48,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:25:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:48,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:48,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:48,727 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 45 treesize of output 49 [2024-11-14 05:25:48,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:48,922 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 18 treesize of output 19 [2024-11-14 05:25:48,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:25:48,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2024-11-14 05:25:48,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:25:48,977 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:25:48,978 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 19 treesize of output 1 [2024-11-14 05:25:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588326577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1365510958] [2024-11-14 05:25:49,119 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:25:49,119 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:49,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:49,120 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:49,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:56,920 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:15,359 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2301#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_65| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_65|) 1))))' at error location [2024-11-14 05:26:15,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:15,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-14 05:26:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219136728] [2024-11-14 05:26:15,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:15,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 05:26:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:15,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 05:26:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1462, Unknown=9, NotChecked=0, Total=1640 [2024-11-14 05:26:15,362 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:17,021 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-11-14 05:26:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:26:17,022 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:26:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:17,023 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:26:17,023 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 05:26:17,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=406, Invalid=2777, Unknown=9, NotChecked=0, Total=3192 [2024-11-14 05:26:17,024 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:17,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 120 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:26:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 05:26:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-11-14 05:26:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-14 05:26:17,028 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 22 [2024-11-14 05:26:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-14 05:26:17,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-14 05:26:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:26:17,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:17,029 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] [2024-11-14 05:26:17,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:26:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 05:26:17,234 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:26:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash -521204714, now seen corresponding path program 1 times [2024-11-14 05:26:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103969071] [2024-11-14 05:26:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:17,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103969071] [2024-11-14 05:26:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103969071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419810909] [2024-11-14 05:26:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:17,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:17,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:17,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:17,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:26:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:17,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:26:17,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:17,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:26:18,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:26:18,155 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:26:18,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 05:26:18,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:26:18,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:26:18,247 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-11-14 05:26:18,263 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-11-14 05:26:18,355 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:26:18,356 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-11-14 05:26:18,370 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-11-14 05:26:18,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-14 05:26:18,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:26:18,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-14 05:26:18,664 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-11-14 05:26:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:18,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:19,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:19,427 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-11-14 05:26:19,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:19,447 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 34 [2024-11-14 05:26:19,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:26:19,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:19,509 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-11-14 05:26:19,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:19,524 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-11-14 05:26:19,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:19,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:19,535 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 27 treesize of output 19 [2024-11-14 05:26:19,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:26:19,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:19,548 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 20 treesize of output 12 [2024-11-14 05:26:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419810909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1180508260] [2024-11-14 05:26:19,969 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:26:19,969 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:19,970 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:19,970 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:19,970 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:25,770 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:34,776 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2641#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-14 05:26:34,776 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:34,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2024-11-14 05:26:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558582979] [2024-11-14 05:26:34,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:34,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:26:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:34,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:26:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1533, Unknown=8, NotChecked=0, Total=1722 [2024-11-14 05:26:34,779 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:35,889 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-14 05:26:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:26:35,890 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 05:26:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:35,891 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:26:35,891 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:26:35,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=367, Invalid=2381, Unknown=8, NotChecked=0, Total=2756 [2024-11-14 05:26:35,892 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 75 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:35,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 151 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:26:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:26:35,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2024-11-14 05:26:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-14 05:26:35,896 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 22 [2024-11-14 05:26:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:35,897 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-14 05:26:35,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-14 05:26:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:26:35,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:35,899 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] [2024-11-14 05:26:35,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:26:36,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 05:26:36,100 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:26:36,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1033519468, now seen corresponding path program 1 times [2024-11-14 05:26:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:36,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576083008] [2024-11-14 05:26:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:36,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576083008] [2024-11-14 05:26:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576083008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112907104] [2024-11-14 05:26:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:36,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:36,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:36,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:36,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:26:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:36,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:26:36,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:37,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:26:37,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:37,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-14 05:26:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:37,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:26:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112907104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:26:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2024-11-14 05:26:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767047549] [2024-11-14 05:26:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:26:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:26:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:26:37,190 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-11-14 05:26:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:37,515 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-14 05:26:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:26:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-11-14 05:26:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:37,516 INFO L225 Difference]: With dead ends: 76 [2024-11-14 05:26:37,516 INFO L226 Difference]: Without dead ends: 75 [2024-11-14 05:26:37,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:26:37,517 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:37,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 141 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:26:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-14 05:26:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-14 05:26:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2024-11-14 05:26:37,522 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 22 [2024-11-14 05:26:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:37,522 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2024-11-14 05:26:37,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-11-14 05:26:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2024-11-14 05:26:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:26:37,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:37,524 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-11-14 05:26:37,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:26:37,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 05:26:37,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:26:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2042944523, now seen corresponding path program 1 times [2024-11-14 05:26:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344447305] [2024-11-14 05:26:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:38,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344447305] [2024-11-14 05:26:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344447305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:26:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078603081] [2024-11-14 05:26:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:26:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:26:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:26:38,270 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-11-14 05:26:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:38,618 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-14 05:26:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:26:38,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-11-14 05:26:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:38,619 INFO L225 Difference]: With dead ends: 76 [2024-11-14 05:26:38,619 INFO L226 Difference]: Without dead ends: 76 [2024-11-14 05:26:38,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:26:38,620 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:38,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:26:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-14 05:26:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-14 05:26:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-14 05:26:38,626 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 24 [2024-11-14 05:26:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:38,626 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-14 05:26:38,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-11-14 05:26:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-14 05:26:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:26:38,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:38,629 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:38,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:26:38,629 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:26:38,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2112060268, now seen corresponding path program 1 times [2024-11-14 05:26:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018725408] [2024-11-14 05:26:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:38,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018725408] [2024-11-14 05:26:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018725408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275711565] [2024-11-14 05:26:38,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:39,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:39,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:26:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:39,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:26:39,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:26:39,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-14 05:26:39,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:39,527 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 05:26:39,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2024-11-14 05:26:39,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:39,785 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:26:39,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 18 [2024-11-14 05:26:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:39,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:40,225 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 70 treesize of output 66 [2024-11-14 05:26:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:40,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275711565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:40,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515151271] [2024-11-14 05:26:40,402 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:26:40,402 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:40,402 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:40,402 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:40,403 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:46,094 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:48,615 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3419#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_91| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_81| Int)) (and (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~list~0#1.base_91|) |v_ULTIMATE.start_main_~list~0#1.offset_81|)) (<= (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_81|) (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_91|)) (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_91|) 1) (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_81|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~list~0#1.base_91|) |v_ULTIMATE.start_main_~list~0#1.offset_81|) |ULTIMATE.start_main_~list~0#1.offset|))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_108| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_108|) 8) |v_ULTIMATE.start_main_~y~0#1.base_108|) (<= |#StackHeapBarrier| |v_ULTIMATE.start_main_~y~0#1.base_108|) (= (select |#valid| |v_ULTIMATE.start_main_~y~0#1.base_108|) 1) (<= 12 (select |#length| |v_ULTIMATE.start_main_~y~0#1.base_108|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~y~0#1.base_108|) 8) 12))))' at error location [2024-11-14 05:26:48,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:48,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:48,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 19 [2024-11-14 05:26:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281544923] [2024-11-14 05:26:48,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:48,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:26:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:26:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1310, Unknown=2, NotChecked=0, Total=1482 [2024-11-14 05:26:48,616 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:50,864 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-11-14 05:26:50,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 05:26:50,865 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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-11-14 05:26:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:50,865 INFO L225 Difference]: With dead ends: 96 [2024-11-14 05:26:50,866 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 05:26:50,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=481, Invalid=2939, Unknown=2, NotChecked=0, Total=3422 [2024-11-14 05:26:50,867 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:50,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 91 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:26:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 05:26:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2024-11-14 05:26:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 83 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-11-14 05:26:50,871 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 26 [2024-11-14 05:26:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:50,871 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-11-14 05:26:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-11-14 05:26:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:26:50,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:50,873 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:50,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:26:51,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:51,073 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:26:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2112049283, now seen corresponding path program 1 times [2024-11-14 05:26:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793591469] [2024-11-14 05:26:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:52,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793591469] [2024-11-14 05:26:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793591469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640218347] [2024-11-14 05:26:52,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:52,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:52,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:52,244 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:52,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:26:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:52,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:26:52,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:52,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:26:52,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:26:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 05:26:52,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 05:26:52,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:52,661 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 50 [2024-11-14 05:26:52,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:52,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2024-11-14 05:26:52,823 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-14 05:26:52,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 05:26:52,853 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:26:52,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 49 [2024-11-14 05:26:53,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:26:54,119 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-11-14 05:26:54,119 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 116 treesize of output 130 [2024-11-14 05:26:54,367 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-14 05:26:54,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 29 [2024-11-14 05:26:54,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:26:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:54,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:54,756 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 10 treesize of output 8 [2024-11-14 05:27:23,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:27:23,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:23,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 49 [2024-11-14 05:27:23,492 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:27:23,492 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 65 treesize of output 50 [2024-11-14 05:27:23,510 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:27:23,510 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 33 [2024-11-14 05:27:23,517 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 12 treesize of output 10 [2024-11-14 05:27:23,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:27:23,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:23,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:27:23,542 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-14 05:27:23,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2024-11-14 05:27:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640218347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:25,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [422468192] [2024-11-14 05:27:25,635 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 05:27:25,636 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:27:25,636 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:27:25,636 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:27:25,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:27:33,107 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:27:37,088 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3842#(and (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) (+ 8 |ULTIMATE.start_main_~y~0#1.offset|)) 0)) (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1) (<= 0 (+ 8 |ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ 12 |ULTIMATE.start_main_~y~0#1.offset|) (select |#length| |ULTIMATE.start_main_~y~0#1.base|)) (or (not (= |ULTIMATE.start_main_~y~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) (+ 8 |ULTIMATE.start_main_~y~0#1.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) (+ 8 |ULTIMATE.start_main_~y~0#1.offset|)) (+ 12 |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) (+ 8 |ULTIMATE.start_main_~y~0#1.offset|))) (exists ((|v_ULTIMATE.start_main_~list~0#1.offset_94| Int) (|v_ULTIMATE.start_main_~list~0#1.base_104| Int)) (and (<= (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_94|) (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_104|)) (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_94|) (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_104|) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~list~0#1.base_104|) |v_ULTIMATE.start_main_~list~0#1.offset_94|) |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~list~0#1.base_104|) |v_ULTIMATE.start_main_~list~0#1.offset_94|)))))' at error location [2024-11-14 05:27:37,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:27:37,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:27:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 34 [2024-11-14 05:27:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477114497] [2024-11-14 05:27:37,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 05:27:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 05:27:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2705, Unknown=15, NotChecked=0, Total=2970 [2024-11-14 05:27:37,090 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 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-11-14 05:27:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:41,261 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2024-11-14 05:27:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 05:27:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 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 26 [2024-11-14 05:27:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:41,262 INFO L225 Difference]: With dead ends: 130 [2024-11-14 05:27:41,262 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 05:27:41,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=593, Invalid=5398, Unknown=15, NotChecked=0, Total=6006 [2024-11-14 05:27:41,265 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:41,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 284 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 05:27:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 05:27:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2024-11-14 05:27:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 119 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:27:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 148 transitions. [2024-11-14 05:27:41,279 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 148 transitions. Word has length 26 [2024-11-14 05:27:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:41,280 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 148 transitions. [2024-11-14 05:27:41,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 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-11-14 05:27:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2024-11-14 05:27:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:27:41,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:41,281 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] [2024-11-14 05:27:41,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:27:41,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:41,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:27:41,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash -469629704, now seen corresponding path program 1 times [2024-11-14 05:27:41,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:41,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555116274] [2024-11-14 05:27:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:41,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:42,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555116274] [2024-11-14 05:27:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555116274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804250853] [2024-11-14 05:27:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:42,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:42,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:27:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:42,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:27:42,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:42,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:27:42,705 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:27:42,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:27:42,718 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-11-14 05:27:42,755 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:27:42,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 05:27:42,794 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-14 05:27:42,794 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-14 05:27:42,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-14 05:27:43,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:43,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 38 [2024-11-14 05:27:43,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:27:43,171 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 14 treesize of output 13 [2024-11-14 05:27:43,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:27:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:43,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:44,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:44,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 406 treesize of output 456 [2024-11-14 05:27:44,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:44,782 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 18 treesize of output 19 [2024-11-14 05:27:44,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:44,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2024-11-14 05:27:44,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:27:44,847 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:27:44,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 1 [2024-11-14 05:27:44,858 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:27:44,858 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 19 treesize of output 1 [2024-11-14 05:27:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804250853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1071267286] [2024-11-14 05:27:45,051 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:27:45,051 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:27:45,052 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:27:45,052 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:27:45,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:27:52,917 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:28:31,363 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4342#(and (exists ((|v_ULTIMATE.start_main_~list~0#1.base_118| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_118|) 1))) (<= 1 |#StackHeapBarrier|))' at error location [2024-11-14 05:28:31,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:28:31,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:28:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2024-11-14 05:28:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043168400] [2024-11-14 05:28:31,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:28:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 05:28:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:28:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 05:28:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2463, Unknown=23, NotChecked=0, Total=2756 [2024-11-14 05:28:31,366 INFO L87 Difference]: Start difference. First operand 120 states and 148 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:28:35,813 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2024-11-14 05:28:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:28:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 05:28:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:28:35,815 INFO L225 Difference]: With dead ends: 124 [2024-11-14 05:28:35,815 INFO L226 Difference]: Without dead ends: 124 [2024-11-14 05:28:35,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=514, Invalid=3885, Unknown=23, NotChecked=0, Total=4422 [2024-11-14 05:28:35,817 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:28:35,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 143 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-14 05:28:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-14 05:28:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2024-11-14 05:28:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 119 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2024-11-14 05:28:35,823 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 26 [2024-11-14 05:28:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:28:35,823 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2024-11-14 05:28:35,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:28:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2024-11-14 05:28:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:28:35,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:28:35,824 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] [2024-11-14 05:28:35,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:28:36,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:36,029 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:28:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:28:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -469629703, now seen corresponding path program 1 times [2024-11-14 05:28:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:28:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133496396] [2024-11-14 05:28:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:28:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:28:37,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:28:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133496396] [2024-11-14 05:28:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133496396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:28:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357547897] [2024-11-14 05:28:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:28:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:28:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:28:37,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:28:37,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:28:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:28:37,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 05:28:37,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:28:37,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:28:37,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:28:37,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:28:37,969 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-11-14 05:28:37,986 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-11-14 05:28:38,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:28:38,181 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 59 treesize of output 52 [2024-11-14 05:28:38,216 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-11-14 05:28:38,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:28:38,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-14 05:28:38,447 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:28:38,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 05:28:38,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 05:28:38,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:28:38,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:28:38,949 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-11-14 05:28:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:28:39,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:28:40,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:40,750 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 103 treesize of output 107 [2024-11-14 05:28:40,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:40,844 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 93 treesize of output 111 [2024-11-14 05:28:42,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:42,032 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-11-14 05:28:42,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:42,073 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 34 [2024-11-14 05:28:42,085 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-11-14 05:28:42,153 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:28:42,153 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 18 treesize of output 1 [2024-11-14 05:28:42,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:28:42,173 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-11-14 05:28:42,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:28:42,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:28:42,190 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-11-14 05:28:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:28:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357547897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:28:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [423880000] [2024-11-14 05:28:42,863 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:28:42,863 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:28:42,864 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:28:42,864 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:28:42,864 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:28:48,541 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:29:16,565 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4810#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-14 05:29:16,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:29:16,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:29:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2024-11-14 05:29:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662958515] [2024-11-14 05:29:16,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:29:16,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:29:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:29:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:29:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1769, Unknown=19, NotChecked=0, Total=1980 [2024-11-14 05:29:16,567 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand has 27 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:20,851 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2024-11-14 05:29:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:29:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 05:29:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:20,853 INFO L225 Difference]: With dead ends: 125 [2024-11-14 05:29:20,853 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 05:29:20,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=369, Invalid=2582, Unknown=19, NotChecked=0, Total=2970 [2024-11-14 05:29:20,858 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:20,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 235 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:29:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 05:29:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-11-14 05:29:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-14 05:29:20,863 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 26 [2024-11-14 05:29:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:20,863 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-14 05:29:20,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-14 05:29:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:29:20,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:20,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:20,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:29:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:21,065 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:29:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash -883332679, now seen corresponding path program 2 times [2024-11-14 05:29:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:29:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562724436] [2024-11-14 05:29:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:29:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:22,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:29:22,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562724436] [2024-11-14 05:29:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562724436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:22,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398051578] [2024-11-14 05:29:22,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:29:22,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:22,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:22,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:29:22,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:29:22,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:29:22,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:29:22,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 05:29:22,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:23,120 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-14 05:29:23,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-14 05:29:23,318 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-11-14 05:29:23,628 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:29:23,629 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 49 treesize of output 46 [2024-11-14 05:29:23,911 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 44 treesize of output 35 [2024-11-14 05:29:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-11-14 05:29:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:26,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:29:26,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_123| Int)) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_123|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_123|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_main_~list~0#1.offset_123| 0))) is different from false [2024-11-14 05:29:27,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1211 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_123| Int)) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_123|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1211) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_123|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_main_~list~0#1.offset_123| 0))) is different from false [2024-11-14 05:29:27,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:29:27,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 28 treesize of output 29 [2024-11-14 05:29:27,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:29:27,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2024-11-14 05:29:27,166 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 19 treesize of output 17 [2024-11-14 05:29:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398051578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:29:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2028120166] [2024-11-14 05:29:28,926 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:29:28,926 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:29:28,926 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:29:28,926 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:29:28,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:29:34,134 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:29:41,268 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5272#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_12| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_12| |#valid|))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:29:41,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:29:41,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:29:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 28 [2024-11-14 05:29:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70362688] [2024-11-14 05:29:41,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:29:41,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 05:29:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:29:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 05:29:41,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1976, Unknown=4, NotChecked=182, Total=2352 [2024-11-14 05:29:41,270 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:29:46,432 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2024-11-14 05:29:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:29:46,433 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-14 05:29:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:29:46,434 INFO L225 Difference]: With dead ends: 144 [2024-11-14 05:29:46,434 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 05:29:46,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=224, Invalid=2330, Unknown=4, NotChecked=198, Total=2756 [2024-11-14 05:29:46,435 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:29:46,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 289 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 756 Invalid, 0 Unknown, 155 Unchecked, 4.1s Time] [2024-11-14 05:29:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 05:29:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2024-11-14 05:29:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 122 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2024-11-14 05:29:46,440 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 29 [2024-11-14 05:29:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:29:46,440 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2024-11-14 05:29:46,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:29:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2024-11-14 05:29:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:29:46,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:29:46,442 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:29:46,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:29:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-14 05:29:46,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:29:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:29:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -883334075, now seen corresponding path program 2 times [2024-11-14 05:29:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:29:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807463253] [2024-11-14 05:29:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:29:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:29:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:29:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:29:48,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:29:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807463253] [2024-11-14 05:29:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807463253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:29:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056463772] [2024-11-14 05:29:48,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:29:48,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:29:48,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:29:48,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:29:48,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:29:48,827 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:29:48,827 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:29:48,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 05:29:48,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:29:48,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:29:48,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:49,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:29:49,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:29:49,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 05:29:49,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 05:29:49,293 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 26 treesize of output 28 [2024-11-14 05:29:49,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:29:49,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:29:50,008 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 33 treesize of output 38 [2024-11-14 05:29:50,080 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 16 [2024-11-14 05:29:50,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:50,521 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-11-14 05:29:50,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 120 treesize of output 95 [2024-11-14 05:29:50,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:29:50,629 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-11-14 05:29:50,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 33 [2024-11-14 05:29:51,345 INFO L349 Elim1Store]: treesize reduction 90, result has 15.9 percent of original size [2024-11-14 05:29:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 148 treesize of output 102 [2024-11-14 05:29:51,361 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 126 treesize of output 109 [2024-11-14 05:29:56,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:29:56,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 256 treesize of output 356 [2024-11-14 05:29:59,901 INFO L349 Elim1Store]: treesize reduction 226, result has 64.6 percent of original size [2024-11-14 05:29:59,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 3 disjoint index pairs (out of 136 index pairs), introduced 20 new quantified variables, introduced 136 case distinctions, treesize of input 360 treesize of output 599 [2024-11-14 05:32:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:32:55,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:33:09,157 INFO L349 Elim1Store]: treesize reduction 282, result has 28.2 percent of original size [2024-11-14 05:33:09,158 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 1279 treesize of output 488 [2024-11-14 05:33:09,528 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-14 05:33:09,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 319 [2024-11-14 05:33:09,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:33:09,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:33:10,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:33:10,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 118 [2024-11-14 05:33:11,221 INFO L349 Elim1Store]: treesize reduction 1107, result has 11.2 percent of original size [2024-11-14 05:33:11,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 670 treesize of output 701 [2024-11-14 05:33:11,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:33:11,264 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 433 treesize of output 341 [2024-11-14 05:33:11,300 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 313 treesize of output 311 [2024-11-14 05:33:11,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:33:11,529 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 363 treesize of output 371 [2024-11-14 05:33:11,911 INFO L349 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2024-11-14 05:33:11,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 444 treesize of output 216 [2024-11-14 05:33:11,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:33:11,966 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 199 treesize of output 187 [2024-11-14 05:33:11,987 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 151 treesize of output 147 [2024-11-14 05:33:12,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 05:33:12,420 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:33:12,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2024-11-14 05:33:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:33:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056463772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:33:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705003909] [2024-11-14 05:33:12,763 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:33:12,763 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:33:12,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:33:12,764 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:33:12,764 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:33:18,124 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:33:35,799 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5772#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_161| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_161|) 1))))' at error location [2024-11-14 05:33:35,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:33:35,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:33:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-11-14 05:33:35,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122518399] [2024-11-14 05:33:35,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:33:35,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 05:33:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:33:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 05:33:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2516, Unknown=15, NotChecked=0, Total=2756 [2024-11-14 05:33:35,802 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:33:44,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:33:46,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:33:48,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:33:50,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:33:52,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 05:33:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:33:56,063 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2024-11-14 05:33:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 05:33:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-14 05:33:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:33:56,065 INFO L225 Difference]: With dead ends: 148 [2024-11-14 05:33:56,065 INFO L226 Difference]: Without dead ends: 133 [2024-11-14 05:33:56,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=389, Invalid=4424, Unknown=17, NotChecked=0, Total=4830 [2024-11-14 05:33:56,067 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 26 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:33:56,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 385 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 804 Invalid, 25 Unknown, 0 Unchecked, 15.0s Time] [2024-11-14 05:33:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-14 05:33:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-14 05:33:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.226890756302521) internal successors, (146), 130 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:33:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2024-11-14 05:33:56,071 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 29 [2024-11-14 05:33:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:33:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2024-11-14 05:33:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:33:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2024-11-14 05:33:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:33:56,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:33:56,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:33:56,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:33:56,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-14 05:33:56,274 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:33:56,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:33:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -802538634, now seen corresponding path program 1 times [2024-11-14 05:33:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:33:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921107621] [2024-11-14 05:33:56,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:33:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:33:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:00,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:34:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921107621] [2024-11-14 05:34:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921107621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:34:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958384304] [2024-11-14 05:34:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:00,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:34:00,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:34:00,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:34:00,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:34:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:00,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:34:00,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:00,575 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|)))))) is different from false [2024-11-14 05:34:00,582 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|)))))) is different from true [2024-11-14 05:34:00,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:34:00,665 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) is different from false [2024-11-14 05:34:00,673 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) is different from true [2024-11-14 05:34:00,749 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:34:00,749 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 66 treesize of output 59 [2024-11-14 05:34:00,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| .cse0 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= .cse0 .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse2) (= (select |v_#valid_184| .cse1) 1))))) (= (select |c_#valid| .cse0) 1))) is different from false [2024-11-14 05:34:00,819 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| .cse0 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= .cse0 .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse2) (= (select |v_#valid_184| .cse1) 1))))) (= (select |c_#valid| .cse0) 1))) is different from true [2024-11-14 05:34:00,997 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (.cse0 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (not .cse0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse4 (store |v_#valid_184| .cse2 0))) (let ((.cse3 (@diff |v_#valid_184| .cse4))) (and (= (select |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse1)) (= .cse2 .cse3) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse4) (= (select |v_#valid_184| .cse3) 1)))))) (and (exists ((|v_#valid_184| (Array Int Int)) (v_DerPreprocessor_6 Int)) (let ((.cse6 (store |v_#valid_184| .cse2 0))) (let ((.cse5 (@diff |v_#valid_184| .cse6))) (and (= v_DerPreprocessor_6 0) (= .cse2 .cse5) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse1)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse6) (= (select |v_#valid_184| .cse5) 1))))) .cse0)))) is different from false [2024-11-14 05:34:01,005 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (.cse0 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (not .cse0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse4 (store |v_#valid_184| .cse2 0))) (let ((.cse3 (@diff |v_#valid_184| .cse4))) (and (= (select |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse1)) (= .cse2 .cse3) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse4) (= (select |v_#valid_184| .cse3) 1)))))) (and (exists ((|v_#valid_184| (Array Int Int)) (v_DerPreprocessor_6 Int)) (let ((.cse6 (store |v_#valid_184| .cse2 0))) (let ((.cse5 (@diff |v_#valid_184| .cse6))) (and (= v_DerPreprocessor_6 0) (= .cse2 .cse5) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse1)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse6) (= (select |v_#valid_184| .cse5) 1))))) .cse0)))) is different from true [2024-11-14 05:34:01,034 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 170 treesize of output 130 [2024-11-14 05:34:01,164 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse2 (select .cse8 8))) (let ((.cse3 (select |c_#valid| .cse2)) (.cse5 (select .cse8 0)) (.cse0 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 .cse5 0))) (let ((.cse4 (@diff v_prenex_16 .cse1))) (and (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse2 .cse3)) (= (select v_prenex_16 .cse2) 0) (= (select v_prenex_16 .cse4) 1) (= .cse5 .cse4)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse7 (store |v_#valid_184| .cse5 0))) (let ((.cse6 (@diff |v_#valid_184| .cse7))) (and (= |c_#valid| (store |v_#valid_184| .cse2 .cse3)) (= .cse5 .cse6) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7) (= (select |v_#valid_184| .cse6) 1))))) .cse0)))))) is different from false [2024-11-14 05:34:01,173 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse2 (select .cse8 8))) (let ((.cse3 (select |c_#valid| .cse2)) (.cse5 (select .cse8 0)) (.cse0 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 .cse5 0))) (let ((.cse4 (@diff v_prenex_16 .cse1))) (and (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse2 .cse3)) (= (select v_prenex_16 .cse2) 0) (= (select v_prenex_16 .cse4) 1) (= .cse5 .cse4)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse7 (store |v_#valid_184| .cse5 0))) (let ((.cse6 (@diff |v_#valid_184| .cse7))) (and (= |c_#valid| (store |v_#valid_184| .cse2 .cse3)) (= .cse5 .cse6) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7) (= (select |v_#valid_184| .cse6) 1))))) .cse0)))))) is different from true [2024-11-14 05:34:01,323 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse8 8))) (let ((.cse2 (select |c_#valid| .cse1)) (.cse3 (select .cse8 0)) (.cse0 (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 .cse3 0))) (let ((.cse4 (@diff v_prenex_16 .cse5))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse1) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse1 .cse2)) (= .cse3 .cse4) (= (select v_prenex_16 .cse4) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse6 (store |v_#valid_184| .cse3 0))) (let ((.cse7 (@diff |v_#valid_184| .cse6))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse6) (= 1 (select |v_#valid_184| .cse7)) (= .cse3 .cse7) (= |c_#valid| (store |v_#valid_184| .cse1 .cse2)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse0)))))) is different from false [2024-11-14 05:34:01,332 WARN L873 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse8 8))) (let ((.cse2 (select |c_#valid| .cse1)) (.cse3 (select .cse8 0)) (.cse0 (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 .cse3 0))) (let ((.cse4 (@diff v_prenex_16 .cse5))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse1) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse1 .cse2)) (= .cse3 .cse4) (= (select v_prenex_16 .cse4) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse6 (store |v_#valid_184| .cse3 0))) (let ((.cse7 (@diff |v_#valid_184| .cse6))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse6) (= 1 (select |v_#valid_184| .cse7)) (= .cse3 .cse7) (= |c_#valid| (store |v_#valid_184| .cse1 .cse2)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse0)))))) is different from true [2024-11-14 05:34:01,783 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse8 8))) (let ((.cse2 (select |c_#valid| .cse1)) (.cse3 (select .cse8 0)) (.cse0 (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 .cse3 0))) (let ((.cse4 (@diff v_prenex_16 .cse5))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse1) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse1 .cse2)) (= .cse3 .cse4) (= (select v_prenex_16 .cse4) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse6 (store |v_#valid_184| .cse3 0))) (let ((.cse7 (@diff |v_#valid_184| .cse6))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse6) (= 1 (select |v_#valid_184| .cse7)) (= .cse3 .cse7) (= |c_#valid| (store |v_#valid_184| .cse1 .cse2)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse0)))))) is different from false [2024-11-14 05:34:01,791 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse8 8))) (let ((.cse2 (select |c_#valid| .cse1)) (.cse3 (select .cse8 0)) (.cse0 (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 .cse3 0))) (let ((.cse4 (@diff v_prenex_16 .cse5))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse1) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse1 .cse2)) (= .cse3 .cse4) (= (select v_prenex_16 .cse4) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse6 (store |v_#valid_184| .cse3 0))) (let ((.cse7 (@diff |v_#valid_184| .cse6))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse6) (= 1 (select |v_#valid_184| .cse7)) (= .cse3 .cse7) (= |c_#valid| (store |v_#valid_184| .cse1 .cse2)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse0)))))) is different from true [2024-11-14 05:34:01,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse5 (select .cse8 0))) (and (let ((.cse2 (select .cse8 8))) (let ((.cse3 (select |c_#valid| .cse2)) (.cse0 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 .cse5 0))) (let ((.cse4 (@diff v_prenex_16 .cse1))) (and (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse2 .cse3)) (= (select v_prenex_16 .cse2) 0) (= (select v_prenex_16 .cse4) 1) (= .cse5 .cse4)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse7 (store |v_#valid_184| .cse5 0))) (let ((.cse6 (@diff |v_#valid_184| .cse7))) (and (= |c_#valid| (store |v_#valid_184| .cse2 .cse3)) (= .cse5 .cse6) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7) (= (select |v_#valid_184| .cse6) 1))))) .cse0)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5)))) is different from false [2024-11-14 05:34:01,974 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse5 (select .cse8 0))) (and (let ((.cse2 (select .cse8 8))) (let ((.cse3 (select |c_#valid| .cse2)) (.cse0 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2))) (or (and (not .cse0) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 .cse5 0))) (let ((.cse4 (@diff v_prenex_16 .cse1))) (and (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse2 .cse3)) (= (select v_prenex_16 .cse2) 0) (= (select v_prenex_16 .cse4) 1) (= .cse5 .cse4)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse7 (store |v_#valid_184| .cse5 0))) (let ((.cse6 (@diff |v_#valid_184| .cse7))) (and (= |c_#valid| (store |v_#valid_184| .cse2 .cse3)) (= .cse5 .cse6) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7) (= (select |v_#valid_184| .cse6) 1))))) .cse0)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse5)))) is different from true [2024-11-14 05:34:02,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:02,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 119 [2024-11-14 05:34:02,753 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (.cse4 (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|))))) (or .cse3 .cse4)) (and .cse3 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse6 (@diff v_prenex_16 .cse5))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse0) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195))) (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse6) 1) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (and (not .cse4) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff v_prenex_16 .cse7))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~mem11#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= (select v_prenex_16 .cse8) 1) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|))) is different from false [2024-11-14 05:34:02,762 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (.cse4 (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|))))) (or .cse3 .cse4)) (and .cse3 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse6 (@diff v_prenex_16 .cse5))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse0) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195))) (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse6) 1) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (and (not .cse4) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff v_prenex_16 .cse7))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~mem11#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= (select v_prenex_16 .cse8) 1) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|))) is different from true [2024-11-14 05:34:04,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (.cse15 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse6 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse11 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse12 (@diff v_prenex_16 .cse11))) (and (= .cse11 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse12) 1) (= .cse12 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (or (and .cse0 (exists ((|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (let ((.cse3 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse3))) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse2) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select |v_#valid_184| .cse1) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and .cse0 (or (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse4 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse5 (@diff v_prenex_16 .cse4))) (and (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (= |c_#valid| (store (store v_prenex_16 v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse5) 1) (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|))))) .cse6 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff v_prenex_16 .cse7))) (and (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| v_arrayElimCell_195)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse8) 1) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse10 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse9 (@diff |v_#valid_184| .cse10))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse9) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse9) 1) (= .cse10 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) .cse6))) (and .cse0 (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse14 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse13 (@diff |v_#valid_184| .cse14))) (and (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse2) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse13) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse13) 1) (= .cse14 |c_ULTIMATE.start_main_old_#valid#1|))))) .cse15) (and .cse0 .cse15 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse16 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse17 (@diff v_prenex_16 .cse16))) (and (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse16 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse17) 1) (= .cse17 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) is different from false [2024-11-14 05:34:07,128 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (.cse15 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse6 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse11 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse12 (@diff v_prenex_16 .cse11))) (and (= .cse11 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse12) 1) (= .cse12 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (or (and .cse0 (exists ((|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (let ((.cse3 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse3))) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse2) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select |v_#valid_184| .cse1) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and .cse0 (or (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse4 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse5 (@diff v_prenex_16 .cse4))) (and (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (= |c_#valid| (store (store v_prenex_16 v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse5) 1) (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|))))) .cse6 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff v_prenex_16 .cse7))) (and (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| v_arrayElimCell_195)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse8) 1) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse10 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse9 (@diff |v_#valid_184| .cse10))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse9) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse9) 1) (= .cse10 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) .cse6))) (and .cse0 (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse14 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse13 (@diff |v_#valid_184| .cse14))) (and (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse2) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse13) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse13) 1) (= .cse14 |c_ULTIMATE.start_main_old_#valid#1|))))) .cse15) (and .cse0 .cse15 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse16 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse17 (@diff v_prenex_16 .cse16))) (and (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse2) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse16 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse17) 1) (= .cse17 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) is different from true [2024-11-14 05:34:07,267 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse2 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse3 (@diff v_prenex_16 .cse2))) (and (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse3) 1) (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) is different from false [2024-11-14 05:34:09,282 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse2 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse3 (@diff v_prenex_16 .cse2))) (and (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse3) 1) (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) is different from true [2024-11-14 05:34:09,631 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse0 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff v_prenex_16 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select v_prenex_16 .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse3 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) is different from false [2024-11-14 05:34:11,640 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse0 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff v_prenex_16 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select v_prenex_16 .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse3 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) is different from true [2024-11-14 05:34:11,778 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select |v_#valid_184| .cse0) 1))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse3 (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse2 (@diff v_prenex_16 .cse3))) (and (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= (select v_prenex_16 .cse2) 1) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0))))))) is different from false [2024-11-14 05:34:13,970 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select |v_#valid_184| .cse0) 1))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse3 (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse2 (@diff v_prenex_16 .cse3))) (and (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= (select v_prenex_16 .cse2) 1) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0))))))) is different from true [2024-11-14 05:34:15,621 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse0 (@diff v_prenex_16 .cse1))) (and (= (select v_prenex_16 .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_177|) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int)) (let ((.cse3 (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse2 |v_ULTIMATE.start_main_~y~0#1.base_177|) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) is different from false [2024-11-14 05:34:15,633 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse0 (@diff v_prenex_16 .cse1))) (and (= (select v_prenex_16 .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_177|) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int)) (let ((.cse3 (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse2 |v_ULTIMATE.start_main_~y~0#1.base_177|) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) is different from true [2024-11-14 05:34:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-14 05:34:15,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:17,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_148| Int)) (or (= (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_148|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_148|) (< |v_ULTIMATE.start_main_~list~0#1.offset_148| 0))) is different from false [2024-11-14 05:34:17,112 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_148| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select (store .cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_148|) 0))) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_148|) (< |v_ULTIMATE.start_main_~list~0#1.offset_148| 0))) is different from false [2024-11-14 05:34:17,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:17,808 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 54 treesize of output 47 [2024-11-14 05:34:17,820 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 78 treesize of output 72 [2024-11-14 05:34:17,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:17,960 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 63 treesize of output 79 [2024-11-14 05:34:18,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:18,023 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 55 treesize of output 58 [2024-11-14 05:34:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958384304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [785782893] [2024-11-14 05:34:31,339 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-14 05:34:31,339 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:34:31,339 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:34:31,339 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:34:31,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:34:36,946 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:35:08,366 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6342#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_13| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_13| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:35:08,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:35:08,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:35:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 45 [2024-11-14 05:35:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661098142] [2024-11-14 05:35:08,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:35:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-14 05:35:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-14 05:35:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2652, Unknown=42, NotChecked=1904, Total=4830 [2024-11-14 05:35:08,369 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:08,997 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-14 05:35:09,006 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from true [2024-11-14 05:35:09,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|))))) (= (store (store |c_#valid| .cse3 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= .cse0 1) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3) (not (= .cse3 |c_ULTIMATE.start_main_~y~0#1.base|)))) is different from false [2024-11-14 05:35:09,026 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|))))) (= (store (store |c_#valid| .cse3 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= .cse0 1) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3) (not (= .cse3 |c_ULTIMATE.start_main_~y~0#1.base|)))) is different from true [2024-11-14 05:35:09,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= .cse1 1) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse3 (store |v_#valid_184| .cse0 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse1)) (= .cse0 .cse2) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= (select |v_#valid_184| .cse2) 1))))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)))) is different from false [2024-11-14 05:35:09,047 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (= .cse1 1) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse3 (store |v_#valid_184| .cse0 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse1)) (= .cse0 .cse2) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= (select |v_#valid_184| .cse2) 1))))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)))) is different from true [2024-11-14 05:35:09,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse1 (not .cse8)) (.cse0 (select .cse2 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse0)) .cse1 (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_148| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| (select (store .cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_148|) 0)) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_148|) (< |v_ULTIMATE.start_main_~list~0#1.offset_148| 0))) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|))) (or (and .cse1 (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse5 (store |v_#valid_184| .cse0 0))) (let ((.cse4 (@diff |v_#valid_184| .cse5))) (and (= (select |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse3)) (= .cse0 .cse4) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5) (= (select |v_#valid_184| .cse4) 1)))))) (and (exists ((|v_#valid_184| (Array Int Int)) (v_DerPreprocessor_6 Int)) (let ((.cse7 (store |v_#valid_184| .cse0 0))) (let ((.cse6 (@diff |v_#valid_184| .cse7))) (and (= v_DerPreprocessor_6 0) (= .cse0 .cse6) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse3)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7) (= (select |v_#valid_184| .cse6) 1))))) .cse8))) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from false [2024-11-14 05:35:09,109 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse1 (not .cse8)) (.cse0 (select .cse2 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse0)) .cse1 (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_148| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| (select (store .cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_148|) 0)) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_148|) (< |v_ULTIMATE.start_main_~list~0#1.offset_148| 0))) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc8#1.base|))) (or (and .cse1 (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse5 (store |v_#valid_184| .cse0 0))) (let ((.cse4 (@diff |v_#valid_184| .cse5))) (and (= (select |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse3)) (= .cse0 .cse4) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse5) (= (select |v_#valid_184| .cse4) 1)))))) (and (exists ((|v_#valid_184| (Array Int Int)) (v_DerPreprocessor_6 Int)) (let ((.cse7 (store |v_#valid_184| .cse0 0))) (let ((.cse6 (@diff |v_#valid_184| .cse7))) (and (= v_DerPreprocessor_6 0) (= .cse0 .cse6) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_#t~malloc8#1.base| .cse3)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7) (= (select |v_#valid_184| .cse6) 1))))) .cse8))) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from true [2024-11-14 05:35:09,347 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse5 (select .cse3 8))) (let ((.cse0 (store |c_#valid| .cse5 0)) (.cse2 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse5)) (.cse1 (select .cse3 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (or (= (store (store .cse0 .cse1 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) .cse2) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_148| Int)) (or (= (store (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse3 |v_ULTIMATE.start_main_~list~0#1.offset_148|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_148|) (< |v_ULTIMATE.start_main_~list~0#1.offset_148| 0))) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (let ((.cse6 (select |c_#valid| .cse5))) (or (and (not .cse2) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse4 (store v_prenex_16 .cse1 0))) (let ((.cse7 (@diff v_prenex_16 .cse4))) (and (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse5 .cse6)) (= (select v_prenex_16 .cse5) 0) (= (select v_prenex_16 .cse7) 1) (= .cse1 .cse7)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse9 (store |v_#valid_184| .cse1 0))) (let ((.cse8 (@diff |v_#valid_184| .cse9))) (and (= |c_#valid| (store |v_#valid_184| .cse5 .cse6)) (= .cse1 .cse8) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse9) (= (select |v_#valid_184| .cse8) 1))))) .cse2))) (not (= .cse1 .cse5)) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)))))) is different from false [2024-11-14 05:35:09,366 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse5 (select .cse3 8))) (let ((.cse0 (store |c_#valid| .cse5 0)) (.cse2 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse5)) (.cse1 (select .cse3 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (or (= (store (store .cse0 .cse1 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) .cse2) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_148| Int)) (or (= (store (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse3 |v_ULTIMATE.start_main_~list~0#1.offset_148|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_148|) (< |v_ULTIMATE.start_main_~list~0#1.offset_148| 0))) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) (let ((.cse6 (select |c_#valid| .cse5))) (or (and (not .cse2) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse4 (store v_prenex_16 .cse1 0))) (let ((.cse7 (@diff v_prenex_16 .cse4))) (and (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse5 .cse6)) (= (select v_prenex_16 .cse5) 0) (= (select v_prenex_16 .cse7) 1) (= .cse1 .cse7)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse9 (store |v_#valid_184| .cse1 0))) (let ((.cse8 (@diff |v_#valid_184| .cse9))) (and (= |c_#valid| (store |v_#valid_184| .cse5 .cse6)) (= .cse1 .cse8) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse9) (= (select |v_#valid_184| .cse8) 1))))) .cse2))) (not (= .cse1 .cse5)) (not (= .cse1 |c_ULTIMATE.start_main_~y~0#1.base|)))))) is different from true [2024-11-14 05:35:09,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse3 (select .cse1 8))) (let ((.cse2 (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (store |c_#valid| .cse3 0)) (.cse5 (select .cse1 0))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (store (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| 0) (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse4 (select |c_#valid| .cse3))) (or (and (not .cse2) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 .cse5 0))) (let ((.cse6 (@diff v_prenex_16 .cse7))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse3) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse3 .cse4)) (= .cse5 .cse6) (= (select v_prenex_16 .cse6) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse8 (store |v_#valid_184| .cse5 0))) (let ((.cse9 (@diff |v_#valid_184| .cse8))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse8) (= 1 (select |v_#valid_184| .cse9)) (= .cse5 .cse9) (= |c_#valid| (store |v_#valid_184| .cse3 .cse4)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse2))) (not (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|)) (or .cse2 (= (store (store .cse0 .cse5 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (not (= .cse5 .cse3)))))) is different from false [2024-11-14 05:35:09,568 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse3 (select .cse1 8))) (let ((.cse2 (= .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (store |c_#valid| .cse3 0)) (.cse5 (select .cse1 0))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (= (store (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| 0) (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse4 (select |c_#valid| .cse3))) (or (and (not .cse2) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 .cse5 0))) (let ((.cse6 (@diff v_prenex_16 .cse7))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse3) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse3 .cse4)) (= .cse5 .cse6) (= (select v_prenex_16 .cse6) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse7)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse8 (store |v_#valid_184| .cse5 0))) (let ((.cse9 (@diff |v_#valid_184| .cse8))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse8) (= 1 (select |v_#valid_184| .cse9)) (= .cse5 .cse9) (= |c_#valid| (store |v_#valid_184| .cse3 .cse4)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse2))) (not (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|)) (or .cse2 (= (store (store .cse0 .cse5 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (not (= .cse5 .cse3)))))) is different from true [2024-11-14 05:35:09,828 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 8))) (let ((.cse2 (store |c_#valid| .cse3 0)) (.cse0 (select .cse12 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (or (and (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) .cse1 (= (store (store .cse2 .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse3)))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse5 (select .cse12 8))) (let ((.cse6 (select |c_#valid| .cse5)) (.cse7 (select .cse12 0)) (.cse4 (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (not .cse4) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse9 (store v_prenex_16 .cse7 0))) (let ((.cse8 (@diff v_prenex_16 .cse9))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse5) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse5 .cse6)) (= .cse7 .cse8) (= (select v_prenex_16 .cse8) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse9)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse10 (store |v_#valid_184| .cse7 0))) (let ((.cse11 (@diff |v_#valid_184| .cse10))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse10) (= 1 (select |v_#valid_184| .cse11)) (= .cse7 .cse11) (= |c_#valid| (store |v_#valid_184| .cse5 .cse6)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse4)))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (store (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|))))) is different from false [2024-11-14 05:35:09,843 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) 8))) (let ((.cse2 (store |c_#valid| .cse3 0)) (.cse0 (select .cse12 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (or (and (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) .cse1 (= (store (store .cse2 .cse0 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse3)))) (<= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse5 (select .cse12 8))) (let ((.cse6 (select |c_#valid| .cse5)) (.cse7 (select .cse12 0)) (.cse4 (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (not .cse4) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse9 (store v_prenex_16 .cse7 0))) (let ((.cse8 (@diff v_prenex_16 .cse9))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select v_prenex_16 .cse5) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) .cse5 .cse6)) (= .cse7 .cse8) (= (select v_prenex_16 .cse8) 1) (= |c_ULTIMATE.start_main_old_#valid#1| .cse9)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse10 (store |v_#valid_184| .cse7 0))) (let ((.cse11 (@diff |v_#valid_184| .cse10))) (and (= |c_ULTIMATE.start_main_old_#valid#1| .cse10) (= 1 (select |v_#valid_184| .cse11)) (= .cse7 .cse11) (= |c_#valid| (store |v_#valid_184| .cse5 .cse6)) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base|) 0))))) .cse4)))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (store (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| 0) .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|))))) is different from true [2024-11-14 05:35:10,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse2 (select .cse10 8))) (let ((.cse0 (store |c_#valid| .cse2 0)) (.cse3 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2)) (.cse7 (select .cse10 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (or (and (= (store (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse1 (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2))) (and .cse1 .cse3))) (= (store (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (let ((.cse5 (select |c_#valid| .cse2))) (or (and (not .cse3) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse4 (store v_prenex_16 .cse7 0))) (let ((.cse6 (@diff v_prenex_16 .cse4))) (and (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse2 .cse5)) (= (select v_prenex_16 .cse2) 0) (= (select v_prenex_16 .cse6) 1) (= .cse7 .cse6)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse9 (store |v_#valid_184| .cse7 0))) (let ((.cse8 (@diff |v_#valid_184| .cse9))) (and (= |c_#valid| (store |v_#valid_184| .cse2 .cse5)) (= .cse7 .cse8) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse9) (= (select |v_#valid_184| .cse8) 1))))) .cse3))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7))))) is different from false [2024-11-14 05:35:10,064 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse2 (select .cse10 8))) (let ((.cse0 (store |c_#valid| .cse2 0)) (.cse3 (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2)) (.cse7 (select .cse10 0))) (and (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (or (and (= (store (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse1 (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2))) (and .cse1 .cse3))) (= (store (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (let ((.cse5 (select |c_#valid| .cse2))) (or (and (not .cse3) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse4 (store v_prenex_16 .cse7 0))) (let ((.cse6 (@diff v_prenex_16 .cse4))) (and (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) .cse2 .cse5)) (= (select v_prenex_16 .cse2) 0) (= (select v_prenex_16 .cse6) 1) (= .cse7 .cse6)))))) (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse9 (store |v_#valid_184| .cse7 0))) (let ((.cse8 (@diff |v_#valid_184| .cse9))) (and (= |c_#valid| (store |v_#valid_184| .cse2 .cse5)) (= .cse7 .cse8) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_ULTIMATE.start_main_old_#valid#1| .cse9) (= (select |v_#valid_184| .cse8) 1))))) .cse3))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse7))))) is different from true [2024-11-14 05:35:10,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (let ((.cse1 (not .cse0)) (.cse9 (not .cse6)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base| 0)) (.cse12 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (and .cse0 (or .cse1 (= (store (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse5 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse4 (@diff |v_#valid_184| .cse5))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse4) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse4) 1) (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|))))) (or .cse1 .cse6)) (and .cse1 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff v_prenex_16 .cse7))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195))) (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse8) 1) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (and .cse9 (exists ((v_prenex_16 (Array Int Int))) (let ((.cse10 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse11 (@diff v_prenex_16 .cse10))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |c_ULTIMATE.start_main_#t~mem11#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (= .cse10 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= (select v_prenex_16 .cse11) 1) (= .cse11 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) .cse12) (or (and (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) .cse6) (and .cse9 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not .cse12)))))) is different from false [2024-11-14 05:35:12,622 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (let ((.cse1 (not .cse0)) (.cse9 (not .cse6)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base| 0)) (.cse12 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (and .cse0 (or .cse1 (= (store (store .cse2 |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (and (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse5 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse4 (@diff |v_#valid_184| .cse5))) (and (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse4) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse4) 1) (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|))))) (or .cse1 .cse6)) (and .cse1 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse7 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse8 (@diff v_prenex_16 .cse7))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195))) (= .cse7 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse8) 1) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (and .cse9 (exists ((v_prenex_16 (Array Int Int))) (let ((.cse10 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse11 (@diff v_prenex_16 .cse10))) (and (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |c_ULTIMATE.start_main_#t~mem11#1.base| (select |c_#valid| |c_ULTIMATE.start_main_#t~mem11#1.base|))) (= .cse10 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem11#1.base|) 0) (= (select v_prenex_16 .cse11) 1) (= .cse11 |c_ULTIMATE.start_main_~list~0#1.base|)))))))) (or (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) .cse12) (or (and (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)) .cse6) (and .cse9 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not .cse12)))))) is different from true [2024-11-14 05:35:12,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (let ((.cse16 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse1 (not .cse0))) (and .cse0 (or (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse7 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse12 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse13 (@diff v_prenex_16 .cse12))) (and (= .cse12 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse13) 1) (= .cse13 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (or (and .cse1 (exists ((|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (let ((.cse4 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse4))) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select |v_#valid_184| .cse2) 1) (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and .cse1 (or (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse6 (@diff v_prenex_16 .cse5))) (and (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (= |c_#valid| (store (store v_prenex_16 v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse6) 1) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|))))) .cse7 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse8 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse9 (@diff v_prenex_16 .cse8))) (and (= .cse8 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| v_arrayElimCell_195)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse9) 1) (= .cse9 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse11 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse10 (@diff |v_#valid_184| .cse11))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse10) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse10) 1) (= .cse11 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) .cse7))) (and .cse1 (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse15 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse14 (@diff |v_#valid_184| .cse15))) (and (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse14) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse14) 1) (= .cse15 |c_ULTIMATE.start_main_old_#valid#1|))))) .cse16) (and .cse1 .cse16 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse17 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse18 (@diff v_prenex_16 .cse17))) (and (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse17 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse18) 1) (= .cse18 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (or (and .cse16 (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (and (= .cse3 0) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (or .cse1 (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))))) is different from false [2024-11-14 05:35:14,834 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1.offset| 0))) (let ((.cse16 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|)) (.cse1 (not .cse0))) (and .cse0 (or (and (not (= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) 0)) (let ((.cse7 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse12 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse13 (@diff v_prenex_16 .cse12))) (and (= .cse12 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse13) 1) (= .cse13 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (or (and .cse1 (exists ((|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (let ((.cse4 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse4))) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select |v_#valid_184| .cse2) 1) (= .cse4 |c_ULTIMATE.start_main_old_#valid#1|)))))) (and .cse1 (or (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse5 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse6 (@diff v_prenex_16 .cse5))) (and (= .cse5 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (= |c_#valid| (store (store v_prenex_16 v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~y~0#1.base| 0)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse6) 1) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|))))) .cse7 (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse8 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse9 (@diff v_prenex_16 .cse8))) (and (= .cse8 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| v_arrayElimCell_195)) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse9) 1) (= .cse9 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse11 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse10 (@diff |v_#valid_184| .cse11))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse10) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse10) 1) (= .cse11 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) .cse7))) (and .cse1 (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse15 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse14 (@diff |v_#valid_184| .cse15))) (and (= |c_#valid| (store (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| .cse3) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse14) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse14) 1) (= .cse15 |c_ULTIMATE.start_main_old_#valid#1|))))) .cse16) (and .cse1 .cse16 (exists ((v_arrayElimCell_195 Int) (v_prenex_16 (Array Int Int))) (let ((.cse17 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse18 (@diff v_prenex_16 .cse17))) (and (= |c_#valid| (store (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse3) v_arrayElimCell_195 (select |c_#valid| v_arrayElimCell_195)) |c_ULTIMATE.start_main_~list~0#1.base| 0)) (= .cse17 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 v_arrayElimCell_195) 0) (not (= v_arrayElimCell_195 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select v_prenex_16 .cse18) 1) (= .cse18 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (or (and .cse16 (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (and (= .cse3 0) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (or .cse1 (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))))) is different from true [2024-11-14 05:35:14,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (and (or (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (and (= .cse0 0) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (or (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse3 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse4 (@diff v_prenex_16 .cse3))) (and (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse0) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse4) 1) (= .cse4 |c_ULTIMATE.start_main_~list~0#1.base|)))))))))) is different from false [2024-11-14 05:35:15,007 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|))) (and (or (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (and (= .cse0 0) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0)))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_~list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (or (exists ((|v_#valid_184| (Array Int Int))) (let ((.cse2 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff |v_#valid_184| .cse2))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select |v_#valid_184| .cse1) 1) (= .cse2 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |c_ULTIMATE.start_main_~y~0#1.base|)) (exists ((v_prenex_16 (Array Int Int))) (let ((.cse3 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse4 (@diff v_prenex_16 .cse3))) (and (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| .cse0) |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0)) (= (select v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 .cse4) 1) (= .cse4 |c_ULTIMATE.start_main_~list~0#1.base|)))))))))) is different from true [2024-11-14 05:35:15,334 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0)) (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse0 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff v_prenex_16 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select v_prenex_16 .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse3 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|))))))) is different from false [2024-11-14 05:35:15,345 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 0)) (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse0 (store v_prenex_16 |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse1 (@diff v_prenex_16 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_old_#valid#1|) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select v_prenex_16 .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse3 (store |v_#valid_184| |c_ULTIMATE.start_main_~list~0#1.base| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|))))))) is different from true [2024-11-14 05:35:15,553 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select |v_#valid_184| .cse0) 1))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse3 (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse2 (@diff v_prenex_16 .cse3))) (and (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= (select v_prenex_16 .cse2) 1) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0)))))))) is different from false [2024-11-14 05:35:15,564 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int))) (let ((.cse1 (store |v_#valid_184| |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse0 (@diff |v_#valid_184| .cse1))) (and (= |c_#valid| (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= (select |v_#valid_184| .cse0) 1))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse3 (store v_prenex_16 |c_ULTIMATE.start_main_~y~0#1.base| 0))) (let ((.cse2 (@diff v_prenex_16 .cse3))) (and (= |c_ULTIMATE.start_main_~y~0#1.base| .cse2) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= (select v_prenex_16 .cse2) 1) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)) (= |c_ULTIMATE.start_main_old_#valid#1| .cse3) (= |c_#valid| (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0)))))))) is different from true [2024-11-14 05:35:15,951 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse0 (@diff v_prenex_16 .cse1))) (and (= (select v_prenex_16 .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_177|) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int)) (let ((.cse3 (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse2 |v_ULTIMATE.start_main_~y~0#1.base_177|) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) (= |c_#valid| |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-14 05:35:15,962 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_23| Int) (v_prenex_16 (Array Int Int))) (let ((.cse1 (store v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse0 (@diff v_prenex_16 .cse1))) (and (= (select v_prenex_16 .cse0) 1) (= .cse1 |c_ULTIMATE.start_main_old_#valid#1|) (= |c_#valid| (store (store (store v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23| 0) |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select v_prenex_16 |v_ULTIMATE.start_main_#t~mem11#1.base_23|) 0) (= (select v_prenex_16 |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse0 |v_ULTIMATE.start_main_~y~0#1.base_177|) (not (= |v_ULTIMATE.start_main_#t~mem11#1.base_23| |v_ULTIMATE.start_main_~y~0#1.base_176|)))))) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_176| Int) (|v_#valid_184| (Array Int Int)) (|v_ULTIMATE.start_main_~y~0#1.base_177| Int)) (let ((.cse3 (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_177| 0))) (let ((.cse2 (@diff |v_#valid_184| .cse3))) (and (= |c_#valid| (store (store |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176| 0) |v_ULTIMATE.start_main_~y~0#1.base_177| 0)) (= (select |v_#valid_184| |v_ULTIMATE.start_main_~y~0#1.base_176|) 0) (= .cse2 |v_ULTIMATE.start_main_~y~0#1.base_177|) (= (select |v_#valid_184| .cse2) 1) (= .cse3 |c_ULTIMATE.start_main_old_#valid#1|)))))) (= |c_#valid| |c_ULTIMATE.start_main_old_#valid#1|)) is different from true [2024-11-14 05:35:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:17,166 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2024-11-14 05:35:17,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:35:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-14 05:35:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:17,167 INFO L225 Difference]: With dead ends: 132 [2024-11-14 05:35:17,167 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 05:35:17,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 30 IntricatePredicates, 1 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=260, Invalid=2652, Unknown=70, NotChecked=3990, Total=6972 [2024-11-14 05:35:17,169 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1858 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:17,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 650 Invalid, 0 Unknown, 1858 Unchecked, 4.1s Time] [2024-11-14 05:35:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 05:35:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-14 05:35:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.26) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2024-11-14 05:35:17,172 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 33 [2024-11-14 05:35:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:17,172 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2024-11-14 05:35:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:35:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2024-11-14 05:35:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:35:17,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:17,173 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:17,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 05:35:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 05:35:17,373 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-14 05:35:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:17,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1552160956, now seen corresponding path program 1 times [2024-11-14 05:35:17,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:17,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937814626] [2024-11-14 05:35:17,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:17,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:19,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937814626] [2024-11-14 05:35:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937814626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566103593] [2024-11-14 05:35:19,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:19,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:19,177 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:19,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e047cf-884c-45f2-b256-d9133e2449cf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:35:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:19,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 05:35:19,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:19,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:35:19,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:35:19,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:35:19,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 05:35:20,023 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-11-14 05:35:20,265 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:35:20,265 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 75 treesize of output 68 [2024-11-14 05:35:20,333 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-14 05:35:20,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-14 05:35:20,570 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 31 treesize of output 26 [2024-11-14 05:35:20,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-14 05:35:21,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-14 05:35:22,208 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:35:22,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2024-11-14 05:35:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:22,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:25,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:25,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 83 treesize of output 84 [2024-11-14 05:35:25,216 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 160 treesize of output 156 [2024-11-14 05:35:25,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:35:25,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:25,289 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 77 treesize of output 81 [2024-11-14 05:35:25,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:35:25,312 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 69 treesize of output 67 [2024-11-14 05:35:34,946 INFO L349 Elim1Store]: treesize reduction 173, result has 42.7 percent of original size [2024-11-14 05:35:34,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 688 treesize of output 538 [2024-11-14 05:35:35,535 INFO L349 Elim1Store]: treesize reduction 107, result has 34.0 percent of original size [2024-11-14 05:35:35,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 605 treesize of output 635 [2024-11-14 05:35:35,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:35,721 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 292 treesize of output 310 [2024-11-14 05:35:36,373 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-14 05:35:36,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 397 treesize of output 411 [2024-11-14 05:35:38,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 05:35:39,374 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 25 treesize of output 19 [2024-11-14 05:35:45,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:45,084 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 251 treesize of output 251 [2024-11-14 05:35:56,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:56,024 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 143 treesize of output 143 [2024-11-14 05:36:02,947 INFO L349 Elim1Store]: treesize reduction 10, result has 97.4 percent of original size [2024-11-14 05:36:02,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 383 treesize of output 691