./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/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_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/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 64bit --witnessprinter.graph.data.programhash d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:53:42,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:53:42,644 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-14 03:53:42,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:53:42,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:53:42,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:53:42,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:53:42,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:53:42,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:53:42,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:53:42,683 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:53:42,684 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:53:42,684 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:53:42,684 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:53:42,684 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:53:42,684 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:53:42,685 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:53:42,685 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:53:42,685 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:53:42,685 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:53:42,685 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:53:42,685 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:53:42,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:53:42,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:53:42,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:53:42,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:53:42,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:53:42,687 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:53:42,687 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:53:42,687 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:53:42,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:53:42,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:53:42,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:53:42,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:53:42,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:53:42,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:53:42,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:53:42,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:53:42,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:42,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:53:42,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:53:42,692 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:53:42,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:53:42,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:53:42,692 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:53:42,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:53:42,692 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_85f82f6f-d83f-4780-8955-91eca5c2fe76/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc [2024-11-14 03:53:43,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:53:43,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:53:43,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:53:43,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:53:43,073 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:53:43,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i Unable to find full path for "g++" [2024-11-14 03:53:45,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:53:46,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:53:46,243 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-14 03:53:46,294 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/data/d05063fd2/a581381eed8d455eb18ed2aa19fa8638/FLAGa8cc2814b [2024-11-14 03:53:46,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/data/d05063fd2/a581381eed8d455eb18ed2aa19fa8638 [2024-11-14 03:53:46,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:53:46,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:53:46,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:46,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:53:46,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:53:46,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:46,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a203221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46, skipping insertion in model container [2024-11-14 03:53:46,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:46,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:53:46,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:46,864 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:53:46,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:46,964 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:53:46,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46 WrapperNode [2024-11-14 03:53:46,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:46,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:46,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:53:46,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:53:46,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:46,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,030 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-11-14 03:53:47,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:47,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:53:47,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:53:47,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:53:47,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:53:47,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:53:47,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:53:47,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:53:47,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (1/1) ... [2024-11-14 03:53:47,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:47,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:47,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:53:47,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:53:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:53:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-14 03:53:47,174 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-14 03:53:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:53:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:53:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:53:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:53:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:53:47,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:53:47,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:53:47,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:53:47,894 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-14 03:53:47,895 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:53:48,022 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:53:48,024 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 03:53:48,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:48 BoogieIcfgContainer [2024-11-14 03:53:48,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:53:48,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:53:48,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:53:48,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:53:48,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:53:46" (1/3) ... [2024-11-14 03:53:48,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28482cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:48, skipping insertion in model container [2024-11-14 03:53:48,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:46" (2/3) ... [2024-11-14 03:53:48,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28482cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:48, skipping insertion in model container [2024-11-14 03:53:48,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:48" (3/3) ... [2024-11-14 03:53:48,042 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2024-11-14 03:53:48,064 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:53:48,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-middle-shared.i that has 2 procedures, 93 locations, 1 initial locations, 3 loop locations, and 50 error locations. [2024-11-14 03:53:48,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:53:48,161 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;@21be5642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:53:48,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-14 03:53:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 39 states have (on average 2.41025641025641) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:53:48,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:48,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:53:48,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 5920723, now seen corresponding path program 1 times [2024-11-14 03:53:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047566432] [2024-11-14 03:53:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:48,475 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 03:53:48,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:48,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047566432] [2024-11-14 03:53:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047566432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:48,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:48,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632324212] [2024-11-14 03:53:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:48,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:48,522 INFO L87 Difference]: Start difference. First operand has 93 states, 39 states have (on average 2.41025641025641) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:48,759 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-14 03:53:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:53:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:48,773 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:53:48,773 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 03:53:48,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:48,783 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:48,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 03:53:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-14 03:53:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-14 03:53:48,837 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 4 [2024-11-14 03:53:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-14 03:53:48,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-14 03:53:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:53:48,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:48,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:53:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:53:48,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 5920724, now seen corresponding path program 1 times [2024-11-14 03:53:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275739385] [2024-11-14 03:53:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:48,960 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 03:53:48,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:48,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275739385] [2024-11-14 03:53:48,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275739385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:48,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:48,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626956706] [2024-11-14 03:53:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:48,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:48,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:48,965 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:49,142 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-14 03:53:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:49,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:53:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:49,145 INFO L225 Difference]: With dead ends: 88 [2024-11-14 03:53:49,146 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 03:53:49,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:49,147 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:49,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 03:53:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-14 03:53:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-14 03:53:49,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 4 [2024-11-14 03:53:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:49,164 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-14 03:53:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-14 03:53:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:53:49,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:49,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:49,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:53:49,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:49,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash 422405233, now seen corresponding path program 1 times [2024-11-14 03:53:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253623382] [2024-11-14 03:53:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:49,415 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 03:53:49,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253623382] [2024-11-14 03:53:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253623382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:49,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120726374] [2024-11-14 03:53:49,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:49,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:49,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:49,418 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:49,545 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-14 03:53:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:49,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-14 03:53:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:49,549 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:53:49,549 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 03:53:49,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:49,551 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:49,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 112 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 03:53:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-14 03:53:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 39 states have (on average 2.230769230769231) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-14 03:53:49,564 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 8 [2024-11-14 03:53:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-14 03:53:49,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-14 03:53:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:53:49,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:49,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:53:49,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:49,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 422405232, now seen corresponding path program 1 times [2024-11-14 03:53:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536680380] [2024-11-14 03:53:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:49,733 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 03:53:49,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536680380] [2024-11-14 03:53:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536680380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873673903] [2024-11-14 03:53:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:49,736 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:49,889 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-11-14 03:53:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-14 03:53:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:49,891 INFO L225 Difference]: With dead ends: 90 [2024-11-14 03:53:49,891 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 03:53:49,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:49,895 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:49,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 03:53:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-14 03:53:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-14 03:53:49,912 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 8 [2024-11-14 03:53:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:49,912 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-14 03:53:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-14 03:53:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:53:49,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:49,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:53:49,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 209664632, now seen corresponding path program 1 times [2024-11-14 03:53:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574701541] [2024-11-14 03:53:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:50,040 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 03:53:50,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574701541] [2024-11-14 03:53:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574701541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123172035] [2024-11-14 03:53:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:50,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:50,043 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:50,174 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2024-11-14 03:53:50,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:50,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-14 03:53:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:50,176 INFO L225 Difference]: With dead ends: 89 [2024-11-14 03:53:50,176 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 03:53:50,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:50,178 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:50,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 03:53:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-14 03:53:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-14 03:53:50,185 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 9 [2024-11-14 03:53:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:50,186 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-14 03:53:50,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-14 03:53:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:53:50,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:50,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:50,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:53:50,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:50,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash 209664633, now seen corresponding path program 1 times [2024-11-14 03:53:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325377689] [2024-11-14 03:53:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:50,458 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 03:53:50,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325377689] [2024-11-14 03:53:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325377689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:50,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:50,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729468252] [2024-11-14 03:53:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:50,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:50,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:50,461 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:50,583 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-11-14 03:53:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:50,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-14 03:53:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:50,585 INFO L225 Difference]: With dead ends: 88 [2024-11-14 03:53:50,586 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 03:53:50,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:50,587 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:50,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 111 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 03:53:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-14 03:53:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-14 03:53:50,595 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 9 [2024-11-14 03:53:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:50,596 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-14 03:53:50,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-14 03:53:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:53:50,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:50,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:50,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:53:50,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2090326637, now seen corresponding path program 1 times [2024-11-14 03:53:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:50,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789563053] [2024-11-14 03:53:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:50,964 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 03:53:50,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789563053] [2024-11-14 03:53:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789563053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:50,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:50,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142620404] [2024-11-14 03:53:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:50,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:50,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:50,968 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:51,246 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-14 03:53:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:53:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 03:53:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:51,248 INFO L225 Difference]: With dead ends: 82 [2024-11-14 03:53:51,249 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 03:53:51,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:51,250 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:51,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 167 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 03:53:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-14 03:53:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 2.0) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-14 03:53:51,257 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 10 [2024-11-14 03:53:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:51,257 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-14 03:53:51,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-14 03:53:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:53:51,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:51,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:51,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:53:51,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2090326636, now seen corresponding path program 1 times [2024-11-14 03:53:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653755452] [2024-11-14 03:53:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:51,784 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 03:53:51,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653755452] [2024-11-14 03:53:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653755452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:51,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:51,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260716754] [2024-11-14 03:53:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:51,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:51,787 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:52,175 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-14 03:53:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:53:52,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 03:53:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:52,176 INFO L225 Difference]: With dead ends: 80 [2024-11-14 03:53:52,177 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 03:53:52,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:52,178 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:52,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:53:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 03:53:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-14 03:53:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-14 03:53:52,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 10 [2024-11-14 03:53:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:52,184 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-14 03:53:52,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-14 03:53:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:53:52,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:52,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:52,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:53:52,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -206173383, now seen corresponding path program 1 times [2024-11-14 03:53:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863347488] [2024-11-14 03:53:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:52,387 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 03:53:52,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863347488] [2024-11-14 03:53:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863347488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:53:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126838465] [2024-11-14 03:53:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:52,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:53:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:53:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:53:52,394 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:52,658 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-14 03:53:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:53:52,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-14 03:53:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:52,659 INFO L225 Difference]: With dead ends: 103 [2024-11-14 03:53:52,660 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:53:52,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:53:52,660 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:52,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:53:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-11-14 03:53:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.962962962962963) internal successors, (106), 86 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2024-11-14 03:53:52,667 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 16 [2024-11-14 03:53:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:52,668 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-11-14 03:53:52,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2024-11-14 03:53:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:53:52,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:52,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:52,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:53:52,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:52,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash -206173382, now seen corresponding path program 1 times [2024-11-14 03:53:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542885363] [2024-11-14 03:53:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:53,026 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 03:53:53,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542885363] [2024-11-14 03:53:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542885363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:53:53,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23876833] [2024-11-14 03:53:53,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:53:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:53:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:53:53,030 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:53,318 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-14 03:53:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:53:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-14 03:53:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:53,320 INFO L225 Difference]: With dead ends: 104 [2024-11-14 03:53:53,320 INFO L226 Difference]: Without dead ends: 104 [2024-11-14 03:53:53,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:53:53,321 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:53,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 315 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-14 03:53:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2024-11-14 03:53:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 91 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2024-11-14 03:53:53,331 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 16 [2024-11-14 03:53:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2024-11-14 03:53:53,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2024-11-14 03:53:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:53:53,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:53,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:53,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:53:53,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2096322349, now seen corresponding path program 1 times [2024-11-14 03:53:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010391232] [2024-11-14 03:53:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:53,502 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 03:53:53,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010391232] [2024-11-14 03:53:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010391232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:53:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62651313] [2024-11-14 03:53:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:53,506 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:53,631 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2024-11-14 03:53:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:53,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-14 03:53:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:53,635 INFO L225 Difference]: With dead ends: 106 [2024-11-14 03:53:53,635 INFO L226 Difference]: Without dead ends: 106 [2024-11-14 03:53:53,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:53,636 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 27 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:53,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 330 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-14 03:53:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-14 03:53:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 93 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2024-11-14 03:53:53,655 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 17 [2024-11-14 03:53:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:53,656 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2024-11-14 03:53:53,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2024-11-14 03:53:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:53:53,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:53,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:53,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:53:53,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash -564121202, now seen corresponding path program 1 times [2024-11-14 03:53:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606001284] [2024-11-14 03:53:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:53,838 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 03:53:53,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606001284] [2024-11-14 03:53:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606001284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:53:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199466597] [2024-11-14 03:53:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:53:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:53:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:53:53,841 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:54,037 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2024-11-14 03:53:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:53:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-14 03:53:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:54,039 INFO L225 Difference]: With dead ends: 105 [2024-11-14 03:53:54,039 INFO L226 Difference]: Without dead ends: 105 [2024-11-14 03:53:54,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:53:54,040 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:54,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-14 03:53:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-14 03:53:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.8656716417910448) internal successors, (125), 99 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2024-11-14 03:53:54,047 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 18 [2024-11-14 03:53:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:54,048 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2024-11-14 03:53:54,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2024-11-14 03:53:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:53:54,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:54,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:53:54,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:54,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash -564121201, now seen corresponding path program 1 times [2024-11-14 03:53:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590385362] [2024-11-14 03:53:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:54,339 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 03:53:54,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590385362] [2024-11-14 03:53:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590385362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:54,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:53:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732896633] [2024-11-14 03:53:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:54,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:53:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:53:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:53:54,343 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:54,571 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2024-11-14 03:53:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:53:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-14 03:53:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:54,573 INFO L225 Difference]: With dead ends: 104 [2024-11-14 03:53:54,573 INFO L226 Difference]: Without dead ends: 104 [2024-11-14 03:53:54,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:53:54,574 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:54,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 334 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-14 03:53:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-14 03:53:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.835820895522388) internal successors, (123), 99 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2024-11-14 03:53:54,585 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 18 [2024-11-14 03:53:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:54,585 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2024-11-14 03:53:54,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2024-11-14 03:53:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:53:54,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:54,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:54,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:53:54,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:54,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1047293887, now seen corresponding path program 1 times [2024-11-14 03:53:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407103736] [2024-11-14 03:53:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:54,831 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 03:53:54,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407103736] [2024-11-14 03:53:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407103736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:54,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199107602] [2024-11-14 03:53:54,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:54,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:54,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:54,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:54,833 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:55,109 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2024-11-14 03:53:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:53:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-14 03:53:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:55,111 INFO L225 Difference]: With dead ends: 104 [2024-11-14 03:53:55,111 INFO L226 Difference]: Without dead ends: 104 [2024-11-14 03:53:55,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:55,112 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:55,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 159 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-14 03:53:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-14 03:53:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 99 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2024-11-14 03:53:55,118 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 19 [2024-11-14 03:53:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:55,118 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2024-11-14 03:53:55,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2024-11-14 03:53:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:53:55,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:55,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:55,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:53:55,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1047293888, now seen corresponding path program 1 times [2024-11-14 03:53:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505506958] [2024-11-14 03:53:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:55,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505506958] [2024-11-14 03:53:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505506958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141071619] [2024-11-14 03:53:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:55,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:55,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:53:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:55,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:53:55,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:55,998 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-14 03:53:56,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:56,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:53:56,129 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:53:56,129 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 03:53:56,162 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 03:53:56,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:53:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141071619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:53:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-14 03:53:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7980828] [2024-11-14 03:53:56,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:56,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-14 03:53:56,169 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:56,496 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2024-11-14 03:53:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-14 03:53:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:56,498 INFO L225 Difference]: With dead ends: 110 [2024-11-14 03:53:56,498 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 03:53:56,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-14 03:53:56,499 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:56,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 157 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 116 Unchecked, 0.3s Time] [2024-11-14 03:53:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 03:53:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2024-11-14 03:53:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 99 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2024-11-14 03:53:56,508 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 19 [2024-11-14 03:53:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-11-14 03:53:56,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:53:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2024-11-14 03:53:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:53:56,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:56,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:56,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:53:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:53:56,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1427199616, now seen corresponding path program 1 times [2024-11-14 03:53:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450837683] [2024-11-14 03:53:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:53:57,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450837683] [2024-11-14 03:53:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450837683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:57,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:57,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104663765] [2024-11-14 03:53:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:57,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:57,009 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:57,315 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2024-11-14 03:53:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-14 03:53:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:57,316 INFO L225 Difference]: With dead ends: 103 [2024-11-14 03:53:57,316 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:53:57,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:53:57,317 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:57,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 210 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:53:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-14 03:53:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-14 03:53:57,326 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2024-11-14 03:53:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:57,327 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-14 03:53:57,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-14 03:53:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:53:57,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:57,328 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:53:57,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:57,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1427199617, now seen corresponding path program 1 times [2024-11-14 03:53:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:57,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627583298] [2024-11-14 03:53:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:53:57,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627583298] [2024-11-14 03:53:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627583298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592612094] [2024-11-14 03:53:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:57,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:57,789 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:58,104 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2024-11-14 03:53:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-14 03:53:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:58,107 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:53:58,107 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 03:53:58,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:53:58,108 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:58,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 03:53:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-14 03:53:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 97 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2024-11-14 03:53:58,113 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 21 [2024-11-14 03:53:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:58,114 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2024-11-14 03:53:58,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:53:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2024-11-14 03:53:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:53:58,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:58,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:58,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:53:58,115 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 474520695, now seen corresponding path program 1 times [2024-11-14 03:53:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978381571] [2024-11-14 03:53:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:58,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:53:58,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978381571] [2024-11-14 03:53:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978381571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:53:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985120835] [2024-11-14 03:53:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:53:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:58,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:53:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:58,265 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:58,552 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2024-11-14 03:53:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:53:58,553 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-14 03:53:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:58,554 INFO L225 Difference]: With dead ends: 120 [2024-11-14 03:53:58,554 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 03:53:58,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:53:58,555 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:58,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 144 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:53:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 03:53:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2024-11-14 03:53:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 106 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:53:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2024-11-14 03:53:58,561 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 21 [2024-11-14 03:53:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:58,561 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2024-11-14 03:53:58,561 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:53:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2024-11-14 03:53:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:53:58,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:58,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:58,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:53:58,563 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:53:58,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash 474520696, now seen corresponding path program 1 times [2024-11-14 03:53:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:58,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632502625] [2024-11-14 03:53:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:58,967 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 03:53:58,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:58,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632502625] [2024-11-14 03:53:58,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632502625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:58,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305273757] [2024-11-14 03:53:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:58,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:58,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:58,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:53:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:59,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:53:59,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:59,376 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 03:53:59,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:53:59,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:53:59,487 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 19 treesize of output 23 [2024-11-14 03:53:59,650 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 03:53:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305273757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:53:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [544925257] [2024-11-14 03:53:59,684 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:53:59,684 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:53:59,690 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:53:59,696 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:53:59,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:54:05,476 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 03:54:05,507 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:54:25,863 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3857#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_destroy_~l#1.base_31| Int)) (and (not (= |v_ULTIMATE.start_destroy_~l#1.base_31| 0)) (<= (select |#length| |v_ULTIMATE.start_destroy_~l#1.base_31|) 7))))' at error location [2024-11-14 03:54:25,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:54:25,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:25,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-11-14 03:54:25,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807398759] [2024-11-14 03:54:25,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:25,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:54:25,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:25,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:54:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1218, Unknown=6, NotChecked=0, Total=1332 [2024-11-14 03:54:25,867 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 18 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:54:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:26,775 INFO L93 Difference]: Finished difference Result 112 states and 135 transitions. [2024-11-14 03:54:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:54:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-14 03:54:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:26,777 INFO L225 Difference]: With dead ends: 112 [2024-11-14 03:54:26,777 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 03:54:26,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=147, Invalid=1487, Unknown=6, NotChecked=0, Total=1640 [2024-11-14 03:54:26,780 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 83 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:26,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 463 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:54:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 03:54:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-11-14 03:54:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 102 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:54:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2024-11-14 03:54:26,786 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 21 [2024-11-14 03:54:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:26,786 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2024-11-14 03:54:26,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:54:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2024-11-14 03:54:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:54:26,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:26,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:26,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:54:26,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:26,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:54:26,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1822601834, now seen corresponding path program 1 times [2024-11-14 03:54:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210923039] [2024-11-14 03:54:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:28,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210923039] [2024-11-14 03:54:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210923039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280958800] [2024-11-14 03:54:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:28,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:28,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:28,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:54:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:28,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 03:54:28,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:28,718 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 03:54:28,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:54:28,786 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 03:54:28,818 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 03:54:28,830 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 03:54:29,026 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 03:54:29,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 03:54:29,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:54:29,160 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 03:54:29,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:54:29,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-14 03:54:29,303 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 03:54:29,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:54:29,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:29,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:54:29,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:54:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 03:54:29,429 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-14 03:54:29,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-14 03:54:29,521 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-11-14 03:54:29,522 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 2 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 03:54:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:30,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:32,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:32,232 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 30 treesize of output 36 [2024-11-14 03:54:32,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:54:32,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:32,257 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 70 [2024-11-14 03:54:32,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-14 03:54:32,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2024-11-14 03:54:32,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:32,544 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 30 treesize of output 36 [2024-11-14 03:54:32,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:32,568 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 70 treesize of output 66 [2024-11-14 03:54:32,581 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 54 treesize of output 46 [2024-11-14 03:54:32,596 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 24 treesize of output 20 [2024-11-14 03:54:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280958800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1066133438] [2024-11-14 03:54:33,090 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 03:54:33,090 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:54:33,090 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:54:33,090 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:54:33,091 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:54:38,174 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 03:54:38,195 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:54:58,714 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4261#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_loop_~l#1.base|) 1) (<= 32 (select |#length| |ULTIMATE.start_loop_~l#1.base|)) (exists ((|v_ULTIMATE.start_loop_~node~0#1.base_30| Int)) (and (or (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0)) (not (= |v_ULTIMATE.start_loop_~node~0#1.base_30| 0))) (not (= 1 (select |#valid| |v_ULTIMATE.start_loop_~node~0#1.base_30|))))) (= |ULTIMATE.start_loop_~l#1.offset| 0))' at error location [2024-11-14 03:54:58,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:54:58,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 32 [2024-11-14 03:54:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81921449] [2024-11-14 03:54:58,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:54:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:54:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2121, Unknown=11, NotChecked=0, Total=2352 [2024-11-14 03:54:58,718 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 32 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:55:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:00,686 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-14 03:55:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:55:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-11-14 03:55:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:00,689 INFO L225 Difference]: With dead ends: 109 [2024-11-14 03:55:00,689 INFO L226 Difference]: Without dead ends: 109 [2024-11-14 03:55:00,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=293, Invalid=2666, Unknown=11, NotChecked=0, Total=2970 [2024-11-14 03:55:00,691 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:00,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 679 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:55:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-14 03:55:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-14 03:55:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 104 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2024-11-14 03:55:00,697 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 22 [2024-11-14 03:55:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:00,697 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2024-11-14 03:55:00,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:55:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2024-11-14 03:55:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:55:00,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:00,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:00,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 03:55:00,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:00,899 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:00,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1825239730, now seen corresponding path program 1 times [2024-11-14 03:55:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:00,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201735235] [2024-11-14 03:55:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:01,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201735235] [2024-11-14 03:55:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201735235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:55:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041925265] [2024-11-14 03:55:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:55:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:55:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:55:01,203 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:01,700 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2024-11-14 03:55:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:55:01,701 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-14 03:55:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:01,702 INFO L225 Difference]: With dead ends: 132 [2024-11-14 03:55:01,702 INFO L226 Difference]: Without dead ends: 132 [2024-11-14 03:55:01,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:55:01,703 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:01,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 282 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:55:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-14 03:55:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2024-11-14 03:55:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.5875) internal successors, (127), 107 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-11-14 03:55:01,715 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 22 [2024-11-14 03:55:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:01,716 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-11-14 03:55:01,716 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2024-11-14 03:55:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:55:01,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:01,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:01,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 03:55:01,717 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1825261129, now seen corresponding path program 1 times [2024-11-14 03:55:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141634631] [2024-11-14 03:55:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:01,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141634631] [2024-11-14 03:55:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141634631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:01,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:01,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:55:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463039051] [2024-11-14 03:55:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:01,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:55:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:01,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:55:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:55:01,889 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:02,179 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2024-11-14 03:55:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:55:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-14 03:55:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:02,181 INFO L225 Difference]: With dead ends: 112 [2024-11-14 03:55:02,181 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 03:55:02,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:55:02,183 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:02,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 281 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:55:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 03:55:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-14 03:55:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 105 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2024-11-14 03:55:02,188 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 22 [2024-11-14 03:55:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2024-11-14 03:55:02,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2024-11-14 03:55:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:55:02,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:02,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:02,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 03:55:02,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:02,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1444380444, now seen corresponding path program 1 times [2024-11-14 03:55:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:02,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435079956] [2024-11-14 03:55:02,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:02,711 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 03:55:02,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:02,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435079956] [2024-11-14 03:55:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435079956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:02,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:55:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739194936] [2024-11-14 03:55:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:02,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:55:02,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:02,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:55:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:55:02,714 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:03,483 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2024-11-14 03:55:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:55:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 03:55:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:03,484 INFO L225 Difference]: With dead ends: 111 [2024-11-14 03:55:03,484 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 03:55:03,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:55:03,485 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:03,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 304 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:55:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 03:55:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-14 03:55:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 105 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2024-11-14 03:55:03,489 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 23 [2024-11-14 03:55:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2024-11-14 03:55:03,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2024-11-14 03:55:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:55:03,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:03,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 03:55:03,493 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:03,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1444380445, now seen corresponding path program 1 times [2024-11-14 03:55:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880361258] [2024-11-14 03:55:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:04,136 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 03:55:04,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880361258] [2024-11-14 03:55:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880361258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:55:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024514912] [2024-11-14 03:55:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:04,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:55:04,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:55:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:55:04,140 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:04,857 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2024-11-14 03:55:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:55:04,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 03:55:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:04,858 INFO L225 Difference]: With dead ends: 110 [2024-11-14 03:55:04,859 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 03:55:04,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:55:04,860 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:04,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 249 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:55:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 03:55:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-14 03:55:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-14 03:55:04,870 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 23 [2024-11-14 03:55:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:04,871 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-14 03:55:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-14 03:55:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:55:04,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:04,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:04,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-14 03:55:04,872 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:04,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 747856919, now seen corresponding path program 1 times [2024-11-14 03:55:04,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:04,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011107570] [2024-11-14 03:55:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:05,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011107570] [2024-11-14 03:55:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011107570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:55:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309731581] [2024-11-14 03:55:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:05,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:55:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:05,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:55:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:55:05,195 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:05,809 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2024-11-14 03:55:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:55:05,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-14 03:55:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:05,810 INFO L225 Difference]: With dead ends: 125 [2024-11-14 03:55:05,810 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 03:55:05,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:55:05,811 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:05,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 219 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:55:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 03:55:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-11-14 03:55:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 106 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2024-11-14 03:55:05,817 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 23 [2024-11-14 03:55:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2024-11-14 03:55:05,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2024-11-14 03:55:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:55:05,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:05,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:05,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-14 03:55:05,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:05,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:05,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1708728148, now seen corresponding path program 1 times [2024-11-14 03:55:05,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:05,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696266710] [2024-11-14 03:55:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:06,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696266710] [2024-11-14 03:55:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696266710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:55:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639361795] [2024-11-14 03:55:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:55:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:55:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:55:06,226 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:06,883 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2024-11-14 03:55:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:55:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-14 03:55:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:06,885 INFO L225 Difference]: With dead ends: 114 [2024-11-14 03:55:06,885 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 03:55:06,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:55:06,886 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:06,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 251 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:55:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 03:55:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-11-14 03:55:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.5) internal successors, (120), 107 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2024-11-14 03:55:06,897 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2024-11-14 03:55:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2024-11-14 03:55:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2024-11-14 03:55:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:55:06,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:06,898 INFO L215 NwaCegarLoop]: trace histogram [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 03:55:06,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 03:55:06,898 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:06,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash 775267972, now seen corresponding path program 1 times [2024-11-14 03:55:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:06,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590483073] [2024-11-14 03:55:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:06,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:07,502 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 03:55:07,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590483073] [2024-11-14 03:55:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590483073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 03:55:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896524791] [2024-11-14 03:55:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:55:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:55:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:55:07,508 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:08,242 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-14 03:55:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:55:08,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-14 03:55:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:08,244 INFO L225 Difference]: With dead ends: 113 [2024-11-14 03:55:08,244 INFO L226 Difference]: Without dead ends: 113 [2024-11-14 03:55:08,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:55:08,245 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:08,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 231 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:55:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-14 03:55:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-14 03:55:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.4875) internal successors, (119), 107 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2024-11-14 03:55:08,251 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 25 [2024-11-14 03:55:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2024-11-14 03:55:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2024-11-14 03:55:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:55:08,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:08,252 INFO L215 NwaCegarLoop]: trace histogram [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 03:55:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-14 03:55:08,252 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:08,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash 775267973, now seen corresponding path program 1 times [2024-11-14 03:55:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:08,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044469702] [2024-11-14 03:55:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:09,081 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 03:55:09,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044469702] [2024-11-14 03:55:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044469702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:55:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646021207] [2024-11-14 03:55:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:09,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:55:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:55:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:55:09,084 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:09,740 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-14 03:55:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:55:09,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-14 03:55:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:09,741 INFO L225 Difference]: With dead ends: 112 [2024-11-14 03:55:09,741 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 03:55:09,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:55:09,742 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:09,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 249 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:55:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 03:55:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-14 03:55:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.475) internal successors, (118), 107 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-14 03:55:09,754 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 25 [2024-11-14 03:55:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:09,754 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-14 03:55:09,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:55:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-14 03:55:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:55:09,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:09,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:09,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 03:55:09,755 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1430965178, now seen corresponding path program 1 times [2024-11-14 03:55:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939787293] [2024-11-14 03:55:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:10,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939787293] [2024-11-14 03:55:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939787293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:10,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:10,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:55:10,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611482086] [2024-11-14 03:55:10,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:55:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:10,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:55:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:55:10,300 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:11,098 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-11-14 03:55:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:55:11,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-14 03:55:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:11,100 INFO L225 Difference]: With dead ends: 119 [2024-11-14 03:55:11,100 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 03:55:11,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:55:11,101 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:11,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 254 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:55:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 03:55:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-11-14 03:55:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 108 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-14 03:55:11,109 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 25 [2024-11-14 03:55:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:11,109 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-14 03:55:11,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-11-14 03:55:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:55:11,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:11,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:11,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-14 03:55:11,114 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:11,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1410247640, now seen corresponding path program 1 times [2024-11-14 03:55:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281457361] [2024-11-14 03:55:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:11,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281457361] [2024-11-14 03:55:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281457361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:55:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690922581] [2024-11-14 03:55:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:11,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:55:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:55:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:55:11,596 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:12,149 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2024-11-14 03:55:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:55:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-14 03:55:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:12,151 INFO L225 Difference]: With dead ends: 121 [2024-11-14 03:55:12,151 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 03:55:12,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:55:12,152 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 31 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:12,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 367 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:55:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 03:55:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2024-11-14 03:55:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 109 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2024-11-14 03:55:12,159 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 26 [2024-11-14 03:55:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:12,160 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2024-11-14 03:55:12,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2024-11-14 03:55:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:55:12,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:12,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-14 03:55:12,162 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 768004026, now seen corresponding path program 1 times [2024-11-14 03:55:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251756423] [2024-11-14 03:55:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:12,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251756423] [2024-11-14 03:55:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251756423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:55:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137164320] [2024-11-14 03:55:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:55:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:12,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:55:12,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:55:12,670 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:13,255 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2024-11-14 03:55:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:55:13,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-14 03:55:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:13,257 INFO L225 Difference]: With dead ends: 120 [2024-11-14 03:55:13,257 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 03:55:13,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:55:13,258 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:13,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 319 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:55:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 03:55:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2024-11-14 03:55:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 110 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-14 03:55:13,264 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 27 [2024-11-14 03:55:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:13,264 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-14 03:55:13,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-14 03:55:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:55:13,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:13,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:13,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-14 03:55:13,265 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:13,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1961678822, now seen corresponding path program 1 times [2024-11-14 03:55:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:13,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293779098] [2024-11-14 03:55:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:14,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293779098] [2024-11-14 03:55:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293779098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:14,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:14,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 03:55:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633336899] [2024-11-14 03:55:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:14,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:55:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:55:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:55:14,093 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 15 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:14,955 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2024-11-14 03:55:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:55:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-14 03:55:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:14,956 INFO L225 Difference]: With dead ends: 116 [2024-11-14 03:55:14,956 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 03:55:14,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:55:14,957 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:14,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 364 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:55:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 03:55:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-14 03:55:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 111 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-11-14 03:55:14,965 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 28 [2024-11-14 03:55:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:14,965 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-11-14 03:55:14,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-11-14 03:55:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:55:14,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:14,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-14 03:55:14,967 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 317300061, now seen corresponding path program 1 times [2024-11-14 03:55:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491765904] [2024-11-14 03:55:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:15,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:15,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491765904] [2024-11-14 03:55:15,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491765904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:55:15,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:55:15,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 03:55:15,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92130165] [2024-11-14 03:55:15,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:55:15,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:55:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:15,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:55:15,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:55:15,665 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:16,417 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-11-14 03:55:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:55:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-14 03:55:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:16,418 INFO L225 Difference]: With dead ends: 119 [2024-11-14 03:55:16,418 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 03:55:16,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:55:16,419 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:16,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 370 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:55:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 03:55:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-14 03:55:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:55:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-11-14 03:55:16,425 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 30 [2024-11-14 03:55:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:16,426 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-11-14 03:55:16,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:55:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-11-14 03:55:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:55:16,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:16,427 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, 1, 1, 1, 1, 1] [2024-11-14 03:55:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-14 03:55:16,427 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:55:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1767002535, now seen corresponding path program 1 times [2024-11-14 03:55:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964564411] [2024-11-14 03:55:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:55:16,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964564411] [2024-11-14 03:55:16,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964564411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:55:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173247357] [2024-11-14 03:55:16,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:16,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:55:16,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:55:16,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:55:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:17,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:55:17,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:55:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:55:17,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:55:17,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:55:17,587 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 19 treesize of output 23 [2024-11-14 03:55:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:55:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173247357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:55:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [312521005] [2024-11-14 03:55:17,818 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 03:55:17,819 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:55:17,819 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:55:17,819 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:55:17,819 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:55:35,924 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 03:55:35,952 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:57:02,652 WARN L286 SmtUtils]: Spent 40.01s on a formula simplification. DAG size of input: 372 DAG size of output: 365 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:57:04,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_#memory_$Pointer$.base_148| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (select |c_#valid| .cse1) 1) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_148| .cse1 (store (select |v_#memory_$Pointer$.base_148| .cse1) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (<= 24 (select |c_#length| .cse1)) (= (store |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse1)) |v_#memory_$Pointer$.base_148|) (= (store |v_#memory_int_124| .cse1 (store (select |v_#memory_int_124| .cse1) 16 (select (select |c_#memory_int| .cse1) 16))) |c_#memory_int|) (= (let ((.cse2 (store |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse2 .cse1 (store (select .cse2 .cse1) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_int_123| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_123| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_124| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_124|)))) (and (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_~now~0#1.offset| 0) (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0) (<= 16 .cse3) (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.base_140| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse4)) |v_#memory_$Pointer$.base_140|) (<= 24 (select |c_#length| .cse4)) (= 1 (select |c_#valid| .cse4)) (= (let ((.cse5 (store |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse5 .cse4 (store (select .cse5 .cse4) 16 0))) |c_#memory_$Pointer$.offset|) (let ((.cse6 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse9 (not (= .cse4 0))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse12 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse13 (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| .cse4 (store (store (select |v_#memory_$Pointer$.base_131| .cse4) 8 0) 16 0)) |v_#memory_$Pointer$.base_139|))) (.cse14 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse15 (exists ((|v_#length_107| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_107| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse16 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse17 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse22 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse23 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse8 (select (select |v_#memory_int_115| .cse4) 16)) (.cse25 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_20| Int)) (and (not (= |v_ULTIMATE.start_create_#t~nondet9#1_20| 0)) (<= |v_ULTIMATE.start_create_#t~nondet9#1_20| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_20| 2147483648))))) (.cse26 (exists ((|v_#valid_128| (Array Int Int))) (let ((.cse36 (store |v_#valid_128| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse35 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse36 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse35 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= 0 (select |v_#valid_128| |c_ULTIMATE.start_create_~dll~0#1.base|))))))) (.cse27 (<= (+ .cse4 1) |c_#StackHeapBarrier|))) (or (and .cse6 (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_int_106| .cse4))) (and (= (store |v_#memory_int_105| .cse4 (store (select |v_#memory_int_105| .cse4) 8 (select .cse7 8))) |v_#memory_int_106|) (= (store |v_#memory_int_106| .cse4 (store .cse7 16 .cse8)) |v_#memory_int_115|)))) .cse9 .cse10 (exists ((|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_135|) (= (let ((.cse11 (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse11 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse11 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_134|))) .cse12 .cse13 .cse14 (exists ((|v_#length_111| (Array Int Int))) (= (store |v_#length_111| .cse4 32) |c_#length|)) .cse15 (exists ((|v_#valid_132| (Array Int Int))) (and (= (select |v_#valid_132| .cse4) 0) (= |c_#valid| (store |v_#valid_132| .cse4 1)))) .cse16 .cse17 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_int_114| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse20 (select (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse21 (select |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse18 (select (select |v_#memory_int_109| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_109| (store |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse18))) (<= 0 (+ .cse18 2147483648)) (= (store |v_#memory_int_114| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse19 16 (select (select |v_#memory_int_107| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_107|) (<= 0 (+ .cse20 2147483648)) (= (store |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse21 24 (select (select |v_#memory_int_BEFORE_CALL_18| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_18|) (<= .cse20 2147483647) (= |v_#memory_int_114| (store |v_#memory_int_113| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_113| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse19 8)))) (= (store |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse20)) |v_#memory_int_108|) (= (store |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse21 0))) |v_#memory_int_110|) (<= .cse18 2147483647)))) .cse22 .cse23 (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| .cse4 (store (store (select |v_#memory_$Pointer$.offset_138| .cse4) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_135|) (= (let ((.cse24 (store |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse24 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse24 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_134|))) .cse25 .cse26 .cse27) (and (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_135|) (= (let ((.cse28 (store |v_#memory_$Pointer$.base_137| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_137| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse28 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse28 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_134|))) .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_135|) (= (let ((.cse29 (store |v_#memory_$Pointer$.offset_137| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_137| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse29 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse29 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_134|))) .cse15 .cse16 .cse17 .cse22 .cse23 (exists ((|v_#length_110| (Array Int Int))) (= (store |v_#length_110| .cse4 32) |c_#length|)) (exists ((|v_#valid_131| (Array Int Int))) (and (= 0 (select |v_#valid_131| .cse4)) (= |c_#valid| (store |v_#valid_131| .cse4 1)))) (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int)))) (let ((.cse30 (select |v_#memory_int_112| .cse4))) (and (= |v_#memory_int_112| (store |v_#memory_int_111| .cse4 (store (select |v_#memory_int_111| .cse4) 8 (select .cse30 8)))) (= (store |v_#memory_int_112| .cse4 (store .cse30 16 .cse8)) |v_#memory_int_115|)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse33 (select (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse34 (select |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse32 (select (select |v_#memory_int_109| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse31 8))) |v_#memory_int_106|) (= |v_#memory_int_109| (store |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse32))) (<= 0 (+ .cse32 2147483648)) (<= 0 (+ .cse33 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_13| (store |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse34 24 (select (select |v_old(#memory_int)_AFTER_CALL_13| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (<= .cse33 2147483647) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse31 16 (select (select |v_#memory_int_107| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_107|) (= (store |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse33)) |v_#memory_int_108|) (= (store |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse34 0))) |v_#memory_int_110|) (<= .cse32 2147483647)))) .cse25 .cse26 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_131| .cse4 (store (store (select |v_#memory_$Pointer$.offset_131| .cse4) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse27))) (= (store |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_116| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_116|) (= (store |v_#memory_$Pointer$.base_140| .cse4 (store (select |v_#memory_$Pointer$.base_140| .cse4) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_116| .cse4 (store (select |v_#memory_int_116| .cse4) 16 (select (select |c_#memory_int| .cse4) 16))) |c_#memory_int|)))))) (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem12#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem12#1.base|))) is different from false [2024-11-14 03:57:06,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse37 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1)) (.cse1 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse3 (<= 1 |c_#StackHeapBarrier|)) (.cse4 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse6 (<= 16 .cse37)) (.cse7 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse18 (exists ((|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_135|) (= (let ((.cse63 (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse63 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse63 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_134|)))) (.cse25 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (let ((.cse60 (select |v_#memory_int_114| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse61 (select (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse62 (select |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse59 (select (select |v_#memory_int_109| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_109| (store |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse59))) (<= 0 (+ .cse59 2147483648)) (= (store |v_#memory_int_114| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse60 16 (select (select |v_#memory_int_107| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_107|) (<= 0 (+ .cse61 2147483648)) (= (store |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse62 24 (select (select |v_#memory_int_BEFORE_CALL_18| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_18|) (<= .cse61 2147483647) (= |v_#memory_int_114| (store |v_#memory_int_113| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_113| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse60 8)))) (= (store |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse61)) |v_#memory_int_108|) (= (store |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse62 0))) |v_#memory_int_110|) (<= .cse59 2147483647))))) (.cse28 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_135|) (= (let ((.cse58 (store |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse58 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse58 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_134|)))) (.cse32 (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_135|) (= (let ((.cse57 (store |v_#memory_$Pointer$.base_137| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_137| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse57 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse57 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_134|)))) (.cse13 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse17 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse19 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse21 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse33 (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_135|) (= (let ((.cse56 (store |v_#memory_$Pointer$.offset_137| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_137| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse56 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse56 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_134|)))) (.cse22 (exists ((|v_#length_107| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_107| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse23 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse26 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse27 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse35 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse54 (select (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse55 (select |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse53 (select (select |v_#memory_int_109| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse52 8))) |v_#memory_int_106|) (= |v_#memory_int_109| (store |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse53))) (<= 0 (+ .cse53 2147483648)) (<= 0 (+ .cse54 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_13| (store |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse55 24 (select (select |v_old(#memory_int)_AFTER_CALL_13| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (<= .cse54 2147483647) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse52 16 (select (select |v_#memory_int_107| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_107|) (= (store |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse54)) |v_#memory_int_108|) (= (store |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse55 0))) |v_#memory_int_110|) (<= .cse53 2147483647))))) (.cse29 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_20| Int)) (and (not (= |v_ULTIMATE.start_create_#t~nondet9#1_20| 0)) (<= |v_ULTIMATE.start_create_#t~nondet9#1_20| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_20| 2147483648))))) (.cse30 (exists ((|v_#valid_128| (Array Int Int))) (let ((.cse51 (store |v_#valid_128| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse50 (store .cse51 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse50 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse51 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse50 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= 0 (select |v_#valid_128| |c_ULTIMATE.start_create_~dll~0#1.base|)))))))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_#memory_$Pointer$.base_140| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse9 (store |v_#memory_$Pointer$.base_140| .cse11 (store (select |v_#memory_$Pointer$.base_140| .cse11) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse12 (let ((.cse36 (store |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse36 .cse11 (store (select .cse36 .cse11) 16 0))))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= 0 .cse8) (= (store .cse9 .cse10 (store (select .cse9 .cse10) .cse8 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_116| .cse11 (store (select |v_#memory_int_116| .cse11) 16 (select (select |v_#memory_int_117| .cse11) 16))) |v_#memory_int_117|) (= (store |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse11)) |v_#memory_$Pointer$.base_140|) (= |c_#memory_$Pointer$.offset| (store .cse12 .cse10 (store (select .cse12 .cse10) .cse8 0))) (<= 24 (select |c_#length| .cse11)) (= (store |v_#memory_int_117| .cse10 (store (select |v_#memory_int_117| .cse10) .cse8 (select (select |c_#memory_int| .cse10) .cse8))) |c_#memory_int|) (= 1 (select |c_#valid| .cse11)) (= (select |c_#valid| .cse10) 1) (let ((.cse16 (not (= .cse11 0))) (.cse20 (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| .cse11 (store (store (select |v_#memory_$Pointer$.base_131| .cse11) 8 0) 16 0)) |v_#memory_$Pointer$.base_139|))) (.cse15 (select (select |v_#memory_int_115| .cse11) 16)) (.cse31 (<= (+ .cse11 1) |c_#StackHeapBarrier|))) (or (and .cse13 (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_int_106| .cse11))) (and (= (store |v_#memory_int_105| .cse11 (store (select |v_#memory_int_105| .cse11) 8 (select .cse14 8))) |v_#memory_int_106|) (= (store |v_#memory_int_106| .cse11 (store .cse14 16 .cse15)) |v_#memory_int_115|)))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_#length_111| (Array Int Int))) (= (store |v_#length_111| .cse11 32) |c_#length|)) .cse22 (exists ((|v_#valid_132| (Array Int Int))) (and (= (select |v_#valid_132| .cse11) 0) (= |c_#valid| (store |v_#valid_132| .cse11 1)))) .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| .cse11 (store (store (select |v_#memory_$Pointer$.offset_138| .cse11) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse28 .cse29 .cse30 .cse31) (and .cse32 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse26 .cse27 (exists ((|v_#length_110| (Array Int Int))) (= (store |v_#length_110| .cse11 32) |c_#length|)) (exists ((|v_#valid_131| (Array Int Int))) (and (= 0 (select |v_#valid_131| .cse11)) (= |c_#valid| (store |v_#valid_131| .cse11 1)))) (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int)))) (let ((.cse34 (select |v_#memory_int_112| .cse11))) (and (= |v_#memory_int_112| (store |v_#memory_int_111| .cse11 (store (select |v_#memory_int_111| .cse11) 8 (select .cse34 8)))) (= (store |v_#memory_int_112| .cse11 (store .cse34 16 .cse15)) |v_#memory_int_115|)))) .cse35 .cse29 .cse30 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_131| .cse11 (store (store (select |v_#memory_$Pointer$.offset_131| .cse11) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse31))) (= (store |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_116| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_116|) (<= (+ 8 .cse8) (select |c_#length| .cse10)))))))) (and .cse2 (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse37) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (let ((.cse38 (select (select |v_#memory_$Pointer$.base_149| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse39 (select (select |v_#memory_$Pointer$.offset_149| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_$Pointer$.offset_149| .cse38 (store (select |v_#memory_$Pointer$.offset_149| .cse38) .cse39 |c_ULTIMATE.start_create_~data1~0#1.offset|)) |c_#memory_$Pointer$.offset|) (or (exists ((|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (let ((.cse40 (select (select |v_#memory_$Pointer$.base_148| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (select |c_#valid| .cse40) 1) (= (let ((.cse41 (store |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse41 .cse40 (store (select .cse41 .cse40) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_149|) (= (store |v_#memory_int_124| .cse40 (store (select |v_#memory_int_124| .cse40) 16 (select (select |v_#memory_int_125| .cse40) 16))) |v_#memory_int_125|) (<= 24 (select |c_#length| .cse40)) (= (store |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse40)) |v_#memory_$Pointer$.base_148|) (= (store |v_#memory_$Pointer$.base_148| .cse40 (store (select |v_#memory_$Pointer$.base_148| .cse40) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_149|) (= (store |v_#memory_int_123| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_123| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_124| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_124|)))) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int)))) (let ((.cse43 (select (select |v_#memory_$Pointer$.base_140| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (let ((.cse42 (store |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse42 .cse43 (store (select .cse42 .cse43) 16 0))) |v_#memory_$Pointer$.offset_149|) (= (store |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse43)) |v_#memory_$Pointer$.base_140|) (= (store |v_#memory_int_116| .cse43 (store (select |v_#memory_int_116| .cse43) 16 (select (select |v_#memory_int_125| .cse43) 16))) |v_#memory_int_125|) (<= 24 (select |c_#length| .cse43)) (= (store |v_#memory_$Pointer$.base_140| .cse43 (store (select |v_#memory_$Pointer$.base_140| .cse43) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_149|) (= 1 (select |c_#valid| .cse43)) (let ((.cse46 (not (= .cse43 0))) (.cse47 (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| .cse43 (store (store (select |v_#memory_$Pointer$.base_131| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.base_139|))) (.cse45 (select (select |v_#memory_int_115| .cse43) 16)) (.cse48 (<= (+ .cse43 1) |c_#StackHeapBarrier|))) (or (and .cse13 (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (let ((.cse44 (select |v_#memory_int_106| .cse43))) (and (= (store |v_#memory_int_105| .cse43 (store (select |v_#memory_int_105| .cse43) 8 (select .cse44 8))) |v_#memory_int_106|) (= (store |v_#memory_int_106| .cse43 (store .cse44 16 .cse45)) |v_#memory_int_115|)))) .cse46 .cse17 .cse18 .cse19 .cse47 .cse21 (exists ((|v_#length_111| (Array Int Int))) (= (store |v_#length_111| .cse43 32) |c_#length|)) .cse22 (exists ((|v_#valid_132| (Array Int Int))) (and (= (select |v_#valid_132| .cse43) 0) (= |c_#valid| (store |v_#valid_132| .cse43 1)))) .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| .cse43 (store (store (select |v_#memory_$Pointer$.offset_138| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse28 .cse29 .cse30 .cse48) (and .cse32 .cse13 .cse46 .cse17 .cse19 .cse47 .cse21 .cse33 .cse22 .cse23 .cse24 .cse26 .cse27 (exists ((|v_#length_110| (Array Int Int))) (= (store |v_#length_110| .cse43 32) |c_#length|)) (exists ((|v_#valid_131| (Array Int Int))) (and (= 0 (select |v_#valid_131| .cse43)) (= |c_#valid| (store |v_#valid_131| .cse43 1)))) (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int)))) (let ((.cse49 (select |v_#memory_int_112| .cse43))) (and (= |v_#memory_int_112| (store |v_#memory_int_111| .cse43 (store (select |v_#memory_int_111| .cse43) 8 (select .cse49 8)))) (= (store |v_#memory_int_112| .cse43 (store .cse49 16 .cse45)) |v_#memory_int_115|)))) .cse35 .cse29 .cse30 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_131| .cse43 (store (store (select |v_#memory_$Pointer$.offset_131| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse48))) (= (store |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_116| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_116|)))))) (<= (+ 8 .cse39) (select |c_#length| .cse38)) (= |c_#memory_int| (store |v_#memory_int_125| .cse38 (store (select |v_#memory_int_125| .cse38) .cse39 (select (select |c_#memory_int| .cse38) .cse39)))) (= (select |c_#valid| .cse38) 1) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_149| .cse38 (store (select |v_#memory_$Pointer$.base_149| .cse38) .cse39 |c_ULTIMATE.start_create_~data1~0#1.base|))) (<= 0 .cse39)))))))))) is different from false [2024-11-14 03:57:08,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.base|) (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.offset|) (let ((.cse2 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse3 (<= 1 |c_#StackHeapBarrier|)) (.cse4 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse6 (<= 16 .cse1)) (.cse7 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse18 (exists ((|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_135|) (= (let ((.cse62 (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse62 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse62 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_134|)))) (.cse25 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (let ((.cse59 (select |v_#memory_int_114| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse60 (select (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse61 (select |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse58 (select (select |v_#memory_int_109| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_109| (store |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse58))) (<= 0 (+ .cse58 2147483648)) (= (store |v_#memory_int_114| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse59 16 (select (select |v_#memory_int_107| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_107|) (<= 0 (+ .cse60 2147483648)) (= (store |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse61 24 (select (select |v_#memory_int_BEFORE_CALL_18| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_18|) (<= .cse60 2147483647) (= |v_#memory_int_114| (store |v_#memory_int_113| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_113| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse59 8)))) (= (store |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse60)) |v_#memory_int_108|) (= (store |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse61 0))) |v_#memory_int_110|) (<= .cse58 2147483647))))) (.cse28 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_135|) (= (let ((.cse57 (store |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse57 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse57 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_134|)))) (.cse32 (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_135|) (= (let ((.cse56 (store |v_#memory_$Pointer$.base_137| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_137| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse56 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse56 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_134|)))) (.cse13 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse17 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse19 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse21 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse33 (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_135|) (= (let ((.cse55 (store |v_#memory_$Pointer$.offset_137| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_137| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse55 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse55 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_134|)))) (.cse22 (exists ((|v_#length_107| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_107| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse23 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse26 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse27 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse35 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse51 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse53 (select (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse54 (select |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse52 (select (select |v_#memory_int_109| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse51 8))) |v_#memory_int_106|) (= |v_#memory_int_109| (store |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_108| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse52))) (<= 0 (+ .cse52 2147483648)) (<= 0 (+ .cse53 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_13| (store |v_#memory_int_110| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse54 24 (select (select |v_old(#memory_int)_AFTER_CALL_13| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (<= .cse53 2147483647) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse51 16 (select (select |v_#memory_int_107| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_107|) (= (store |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse53)) |v_#memory_int_108|) (= (store |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_109| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse54 0))) |v_#memory_int_110|) (<= .cse52 2147483647))))) (.cse29 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_20| Int)) (and (not (= |v_ULTIMATE.start_create_#t~nondet9#1_20| 0)) (<= |v_ULTIMATE.start_create_#t~nondet9#1_20| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_20| 2147483648))))) (.cse30 (exists ((|v_#valid_128| (Array Int Int))) (let ((.cse50 (store |v_#valid_128| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse49 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse50 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse49 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= 0 (select |v_#valid_128| |c_ULTIMATE.start_create_~dll~0#1.base|)))))))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_#memory_$Pointer$.base_140| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse9 (store |v_#memory_$Pointer$.base_140| .cse11 (store (select |v_#memory_$Pointer$.base_140| .cse11) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse12 (let ((.cse36 (store |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse36 .cse11 (store (select .cse36 .cse11) 16 0))))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= 0 .cse8) (= (store .cse9 .cse10 (store (select .cse9 .cse10) .cse8 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_116| .cse11 (store (select |v_#memory_int_116| .cse11) 16 (select (select |v_#memory_int_117| .cse11) 16))) |v_#memory_int_117|) (= (store |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse11)) |v_#memory_$Pointer$.base_140|) (= |c_#memory_$Pointer$.offset| (store .cse12 .cse10 (store (select .cse12 .cse10) .cse8 0))) (<= 24 (select |c_#length| .cse11)) (= (store |v_#memory_int_117| .cse10 (store (select |v_#memory_int_117| .cse10) .cse8 (select (select |c_#memory_int| .cse10) .cse8))) |c_#memory_int|) (= 1 (select |c_#valid| .cse11)) (= (select |c_#valid| .cse10) 1) (let ((.cse16 (not (= .cse11 0))) (.cse20 (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| .cse11 (store (store (select |v_#memory_$Pointer$.base_131| .cse11) 8 0) 16 0)) |v_#memory_$Pointer$.base_139|))) (.cse15 (select (select |v_#memory_int_115| .cse11) 16)) (.cse31 (<= (+ .cse11 1) |c_#StackHeapBarrier|))) (or (and .cse13 (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_int_106| .cse11))) (and (= (store |v_#memory_int_105| .cse11 (store (select |v_#memory_int_105| .cse11) 8 (select .cse14 8))) |v_#memory_int_106|) (= (store |v_#memory_int_106| .cse11 (store .cse14 16 .cse15)) |v_#memory_int_115|)))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_#length_111| (Array Int Int))) (= (store |v_#length_111| .cse11 32) |c_#length|)) .cse22 (exists ((|v_#valid_132| (Array Int Int))) (and (= (select |v_#valid_132| .cse11) 0) (= |c_#valid| (store |v_#valid_132| .cse11 1)))) .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| .cse11 (store (store (select |v_#memory_$Pointer$.offset_138| .cse11) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse28 .cse29 .cse30 .cse31) (and .cse32 .cse13 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse26 .cse27 (exists ((|v_#length_110| (Array Int Int))) (= (store |v_#length_110| .cse11 32) |c_#length|)) (exists ((|v_#valid_131| (Array Int Int))) (and (= 0 (select |v_#valid_131| .cse11)) (= |c_#valid| (store |v_#valid_131| .cse11 1)))) (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int)))) (let ((.cse34 (select |v_#memory_int_112| .cse11))) (and (= |v_#memory_int_112| (store |v_#memory_int_111| .cse11 (store (select |v_#memory_int_111| .cse11) 8 (select .cse34 8)))) (= (store |v_#memory_int_112| .cse11 (store .cse34 16 .cse15)) |v_#memory_int_115|)))) .cse35 .cse29 .cse30 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_131| .cse11 (store (store (select |v_#memory_$Pointer$.offset_131| .cse11) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse31))) (= (store |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_116| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_116|) (<= (+ 8 .cse8) (select |c_#length| .cse10)))))))) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (let ((.cse37 (select (select |v_#memory_$Pointer$.base_149| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse38 (select (select |v_#memory_$Pointer$.offset_149| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_$Pointer$.offset_149| .cse37 (store (select |v_#memory_$Pointer$.offset_149| .cse37) .cse38 |c_ULTIMATE.start_create_~data1~0#1.offset|)) |c_#memory_$Pointer$.offset|) (or (exists ((|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (let ((.cse39 (select (select |v_#memory_$Pointer$.base_148| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (select |c_#valid| .cse39) 1) (= (let ((.cse40 (store |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse40 .cse39 (store (select .cse40 .cse39) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_149|) (= (store |v_#memory_int_124| .cse39 (store (select |v_#memory_int_124| .cse39) 16 (select (select |v_#memory_int_125| .cse39) 16))) |v_#memory_int_125|) (<= 24 (select |c_#length| .cse39)) (= (store |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse39)) |v_#memory_$Pointer$.base_148|) (= (store |v_#memory_$Pointer$.base_148| .cse39 (store (select |v_#memory_$Pointer$.base_148| .cse39) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_149|) (= (store |v_#memory_int_123| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_123| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_124| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_124|)))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_140| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (let ((.cse41 (store |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse41 .cse42 (store (select .cse41 .cse42) 16 0))) |v_#memory_$Pointer$.offset_149|) (= (store |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse42)) |v_#memory_$Pointer$.base_140|) (= (store |v_#memory_int_116| .cse42 (store (select |v_#memory_int_116| .cse42) 16 (select (select |v_#memory_int_125| .cse42) 16))) |v_#memory_int_125|) (<= 24 (select |c_#length| .cse42)) (= (store |v_#memory_$Pointer$.base_140| .cse42 (store (select |v_#memory_$Pointer$.base_140| .cse42) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_149|) (= 1 (select |c_#valid| .cse42)) (let ((.cse45 (not (= .cse42 0))) (.cse46 (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| .cse42 (store (store (select |v_#memory_$Pointer$.base_131| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.base_139|))) (.cse44 (select (select |v_#memory_int_115| .cse42) 16)) (.cse47 (<= (+ .cse42 1) |c_#StackHeapBarrier|))) (or (and .cse13 (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_106| .cse42))) (and (= (store |v_#memory_int_105| .cse42 (store (select |v_#memory_int_105| .cse42) 8 (select .cse43 8))) |v_#memory_int_106|) (= (store |v_#memory_int_106| .cse42 (store .cse43 16 .cse44)) |v_#memory_int_115|)))) .cse45 .cse17 .cse18 .cse19 .cse46 .cse21 (exists ((|v_#length_111| (Array Int Int))) (= (store |v_#length_111| .cse42 32) |c_#length|)) .cse22 (exists ((|v_#valid_132| (Array Int Int))) (and (= (select |v_#valid_132| .cse42) 0) (= |c_#valid| (store |v_#valid_132| .cse42 1)))) .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| .cse42 (store (store (select |v_#memory_$Pointer$.offset_138| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse28 .cse29 .cse30 .cse47) (and .cse32 .cse13 .cse45 .cse17 .cse19 .cse46 .cse21 .cse33 .cse22 .cse23 .cse24 .cse26 .cse27 (exists ((|v_#length_110| (Array Int Int))) (= (store |v_#length_110| .cse42 32) |c_#length|)) (exists ((|v_#valid_131| (Array Int Int))) (and (= 0 (select |v_#valid_131| .cse42)) (= |c_#valid| (store |v_#valid_131| .cse42 1)))) (exists ((|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int)))) (let ((.cse48 (select |v_#memory_int_112| .cse42))) (and (= |v_#memory_int_112| (store |v_#memory_int_111| .cse42 (store (select |v_#memory_int_111| .cse42) 8 (select .cse48 8)))) (= (store |v_#memory_int_112| .cse42 (store .cse48 16 .cse44)) |v_#memory_int_115|)))) .cse35 .cse29 .cse30 (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_131| .cse42 (store (store (select |v_#memory_$Pointer$.offset_131| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.offset_139|)) .cse47))) (= (store |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_116| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_116|)))))) (<= (+ 8 .cse38) (select |c_#length| .cse37)) (= |c_#memory_int| (store |v_#memory_int_125| .cse37 (store (select |v_#memory_int_125| .cse37) .cse38 (select (select |c_#memory_int| .cse37) .cse38)))) (= (select |c_#valid| .cse37) 1) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_149| .cse37 (store (select |v_#memory_$Pointer$.base_149| .cse37) .cse38 |c_ULTIMATE.start_create_~data1~0#1.base|))) (<= 0 .cse38)))))))) is different from false [2024-11-14 03:57:18,247 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7905#(and (or (< |ULTIMATE.start_main_~l~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_loop_~node~0#1.base|) (+ |ULTIMATE.start_main_~l~0#1.offset| 8))) (or (not (= |ULTIMATE.start_loop_~node~0#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))) (= |ULTIMATE.start_loop_~node~0#1.offset| |ULTIMATE.start_main_~l~0#1.offset|) (= |ULTIMATE.start_loop_~node~0#1.base| |ULTIMATE.start_main_~l~0#1.base|) (exists ((|v_ULTIMATE.start_create_~now~0#1.base_48| Int)) (and (<= 8 (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_48|)) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_48|) 1))))' at error location [2024-11-14 03:57:18,247 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:57:18,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:57:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 17 [2024-11-14 03:57:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927966318] [2024-11-14 03:57:18,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:18,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:57:18,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:57:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=12, NotChecked=216, Total=1560 [2024-11-14 03:57:18,249 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 18 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 03:57:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:18,953 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-11-14 03:57:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:57:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-11-14 03:57:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:18,954 INFO L225 Difference]: With dead ends: 121 [2024-11-14 03:57:18,954 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 03:57:18,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 102.8s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=12, NotChecked=222, Total=1640 [2024-11-14 03:57:18,956 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 24 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:18,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 516 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:57:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 03:57:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-14 03:57:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 86 states have (on average 1.430232558139535) internal successors, (123), 113 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:57:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-14 03:57:18,962 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 31 [2024-11-14 03:57:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-14 03:57:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 03:57:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-14 03:57:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:57:18,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:18,963 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, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:18,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:19,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:19,164 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 03:57:19,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1057496239, now seen corresponding path program 1 times [2024-11-14 03:57:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:19,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741039133] [2024-11-14 03:57:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:20,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:20,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741039133] [2024-11-14 03:57:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741039133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:20,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367509785] [2024-11-14 03:57:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:20,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:20,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:20,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:57:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:20,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 03:57:20,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:20,699 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:57:20,699 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 03:57:20,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:57:20,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:57:20,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-14 03:57:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:21,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367509785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188531667] [2024-11-14 03:57:21,472 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 03:57:21,473 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:57:21,473 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:57:21,473 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:57:21,473 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:57:41,139 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 03:57:41,177 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:59:25,921 WARN L286 SmtUtils]: Spent 46.93s on a formula simplification. DAG size of input: 380 DAG size of output: 370 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:01:27,250 WARN L286 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 387 DAG size of output: 376 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:01:29,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.cse5 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse6 (exists ((|v_#valid_140| (Array Int Int))) (let ((.cse62 (store |v_#valid_140| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse61 (store .cse62 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse61 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select (store .cse61 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_140| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse62 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse9 (exists ((|v_#memory_int_139| (Array Int (Array Int Int))) (|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (let ((.cse57 (select |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse59 (select (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse60 (select |v_#memory_int_144| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse58 (select (select |v_#memory_int_141| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse57 0))) |v_#memory_int_142|) (= (store |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse58)) |v_#memory_int_141|) (= (store |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse59)) |v_#memory_int_140|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse57 24 (select (select |v_old(#memory_int)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (<= 0 (+ .cse58 2147483648)) (= (store |v_#memory_int_144| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse60 16 (select (select |v_#memory_int_139| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_139|) (<= .cse59 2147483647) (<= 0 (+ 2147483648 .cse59)) (= (store |v_#memory_int_143| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_143| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse60 8))) |v_#memory_int_144|) (<= .cse58 2147483647))))) (.cse10 (exists ((|v_#memory_$Pointer$.offset_164| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_165| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_167| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_165|) (= (let ((.cse56 (store |v_#memory_$Pointer$.offset_167| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_167| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse56 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse56 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_164|)))) (.cse11 (exists ((|v_#memory_$Pointer$.base_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_165| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_166| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_166|) (= |v_#memory_$Pointer$.base_165| (let ((.cse55 (store |v_#memory_$Pointer$.base_168| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_168| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse55 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse55 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))))) (.cse24 (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_165| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_166| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_166|) (= (let ((.cse54 (store |v_#memory_$Pointer$.base_162| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_162| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse54 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse54 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_165|)))) (.cse8 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse25 (exists ((|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_139| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (let ((.cse50 (select |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse51 (select |v_#memory_int_146| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse53 (select (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse52 (select (select |v_#memory_int_141| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse50 0))) |v_#memory_int_142|) (= (store |v_#memory_int_145| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_145| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse51 8))) |v_#memory_int_146|) (= (store |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse52)) |v_#memory_int_141|) (= (store |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse53)) |v_#memory_int_140|) (<= 0 (+ .cse52 2147483648)) (= (store |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse50 24 (select (select |v_#memory_int_BEFORE_CALL_36| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_36|) (= (store |v_#memory_int_146| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse51 16 (select (select |v_#memory_int_139| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_139|) (<= .cse53 2147483647) (<= 0 (+ 2147483648 .cse53)) (<= .cse52 2147483647))))) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse13 (exists ((|v_#length_120| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_120| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse15 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse17 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse26 (exists ((|v_#valid_144| (Array Int Int))) (let ((.cse49 (store |v_#valid_144| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse48 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse48 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select |v_#valid_144| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse49 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse18 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse19 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse20 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse27 (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_164| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_165| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_165|) (= (let ((.cse47 (store |v_#memory_$Pointer$.offset_161| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_161| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse47 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse47 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_164|)))) (.cse21 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse22 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_26| Int)) (and (not (= |v_ULTIMATE.start_create_#t~nondet9#1_26| 0)) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_26| 2147483648)) (<= |v_ULTIMATE.start_create_#t~nondet9#1_26| 2147483647)))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1)) (.cse30 (<= 1 |c_#StackHeapBarrier|)) (.cse31 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse32 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse33 (<= 16 .cse2)) (.cse34 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0))) (or (and .cse1 (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse2) (exists ((|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_#memory_int_157| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.offset_179| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse3 (select (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_int_157| .cse3 (store (select |v_#memory_int_157| .cse3) .cse4 (select (select |c_#memory_int| .cse3) .cse4))) |c_#memory_int|) (or (and .cse5 (exists ((|v_#memory_$Pointer$.base_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_#memory_$Pointer$.base_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (let ((.cse14 (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (.cse16 (exists ((|v_#memory_int_137| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_138| .cse7))) (and (= |v_#memory_int_147| (store |v_#memory_int_138| .cse7 (store .cse28 16 (select (select |v_#memory_int_147| .cse7) 16)))) (= (store |v_#memory_int_137| .cse7 (store (select |v_#memory_int_137| .cse7) 8 (select .cse28 8))) |v_#memory_int_138|))))) (.cse23 (not (= .cse7 0)))) (or (and .cse6 (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_161| .cse7 (store (store (select |v_#memory_$Pointer$.offset_161| .cse7) 8 0) 16 0)) |v_#memory_$Pointer$.offset_169|)) .cse8 (exists ((|v_#valid_143| (Array Int Int))) (and (= (select |v_#valid_143| .cse7) 0) (= |c_#valid| (store |v_#valid_143| .cse7 1)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_162| .cse7 (store (store (select |v_#memory_$Pointer$.base_162| .cse7) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse23 (exists ((|v_#length_123| (Array Int Int))) (= (store |v_#length_123| .cse7 32) |c_#length|))) (and (exists ((|v_#memory_$Pointer$.base_169| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_169| .cse7 (store (store (select |v_#memory_$Pointer$.base_169| .cse7) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse24 (exists ((|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_169| (store |v_#memory_$Pointer$.offset_168| .cse7 (store (store (select |v_#memory_$Pointer$.offset_168| .cse7) 8 0) 16 0)))) .cse8 .cse25 (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| .cse7 32) |c_#length|)) (exists ((|v_#valid_140| (Array Int Int))) (and (= (select |v_#valid_140| .cse7) 0) (= |c_#valid| (store |v_#valid_140| .cse7 1)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22 .cse23))) (<= 24 (select |c_#length| .cse7)) (= (store |v_#memory_$Pointer$.base_171| .cse7 (store (select |v_#memory_$Pointer$.base_171| .cse7) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_180|) (= (store |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_148| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_148|) (= (select |c_#valid| .cse7) 1) (= |v_#memory_$Pointer$.offset_179| (let ((.cse29 (store |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse29 .cse7 (store (select .cse29 .cse7) 16 0)))) (= (store |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse7)) |v_#memory_$Pointer$.base_171|) (= (store |v_#memory_int_148| .cse7 (store (select |v_#memory_int_148| .cse7) 16 (select (select |v_#memory_int_157| .cse7) 16))) |v_#memory_int_157|)))) .cse30 .cse31 .cse32 .cse33 .cse34) (exists ((|v_#memory_int_155| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_177| (Array Int (Array Int Int)))) (let ((.cse35 (select (select |v_#memory_$Pointer$.base_179| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= 24 (select |c_#length| .cse35)) (= (store |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse35)) |v_#memory_$Pointer$.base_179|) (= (store |v_#memory_$Pointer$.base_179| .cse35 (store (select |v_#memory_$Pointer$.base_179| .cse35) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_180|) (= (store |v_#memory_int_155| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_155| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_156| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_156|) (= (store |v_#memory_int_156| .cse35 (store (select |v_#memory_int_156| .cse35) 16 (select (select |v_#memory_int_157| .cse35) 16))) |v_#memory_int_157|) (= |v_#memory_$Pointer$.offset_179| (let ((.cse36 (store |v_#memory_$Pointer$.offset_177| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_177| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse36 .cse35 (store (select .cse36 .cse35) 16 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (select |c_#valid| .cse35) 1))))) (= (store |v_#memory_$Pointer$.offset_179| .cse3 (store (select |v_#memory_$Pointer$.offset_179| .cse3) .cse4 |c_ULTIMATE.start_create_~data1~0#1.offset|)) |c_#memory_$Pointer$.offset|) (<= 0 .cse4) (= (store |v_#memory_$Pointer$.base_180| .cse3 (store (select |v_#memory_$Pointer$.base_180| .cse3) .cse4 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (<= (+ .cse4 8) (select |c_#length| .cse3)) (= (select |c_#valid| .cse3) 1))))) (and .cse5 (exists ((|v_#memory_$Pointer$.base_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (let ((.cse39 (select (select |v_#memory_$Pointer$.base_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse45 (let ((.cse46 (store |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse46 .cse39 (store (select .cse46 .cse39) 16 0)))) (.cse44 (store |v_#memory_$Pointer$.base_171| .cse39 (store (select |v_#memory_$Pointer$.base_171| .cse39) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse38 (select (select .cse44 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse37 (select (select .cse45 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= (+ .cse37 8) (select |c_#length| .cse38)) (<= 0 .cse37) (= |c_#memory_int| (store |v_#memory_int_149| .cse38 (store (select |v_#memory_int_149| .cse38) .cse37 (select (select |c_#memory_int| .cse38) .cse37)))) (let ((.cse40 (<= (+ .cse39 1) |c_#StackHeapBarrier|)) (.cse41 (exists ((|v_#memory_int_137| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_138| .cse39))) (and (= |v_#memory_int_147| (store |v_#memory_int_138| .cse39 (store .cse43 16 (select (select |v_#memory_int_147| .cse39) 16)))) (= (store |v_#memory_int_137| .cse39 (store (select |v_#memory_int_137| .cse39) 8 (select .cse43 8))) |v_#memory_int_138|))))) (.cse42 (not (= .cse39 0)))) (or (and .cse6 (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_161| .cse39 (store (store (select |v_#memory_$Pointer$.offset_161| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.offset_169|)) .cse8 (exists ((|v_#valid_143| (Array Int Int))) (and (= (select |v_#valid_143| .cse39) 0) (= |c_#valid| (store |v_#valid_143| .cse39 1)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse40 .cse15 .cse41 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_162| .cse39 (store (store (select |v_#memory_$Pointer$.base_162| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse42 (exists ((|v_#length_123| (Array Int Int))) (= (store |v_#length_123| .cse39 32) |c_#length|))) (and (exists ((|v_#memory_$Pointer$.base_169| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_169| .cse39 (store (store (select |v_#memory_$Pointer$.base_169| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse24 (exists ((|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_169| (store |v_#memory_$Pointer$.offset_168| .cse39 (store (store (select |v_#memory_$Pointer$.offset_168| .cse39) 8 0) 16 0)))) .cse8 .cse25 (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| .cse39 32) |c_#length|)) (exists ((|v_#valid_140| (Array Int Int))) (and (= (select |v_#valid_140| .cse39) 0) (= |c_#valid| (store |v_#valid_140| .cse39 1)))) .cse12 .cse13 .cse40 .cse15 .cse41 .cse17 .cse26 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22 .cse42))) (<= 24 (select |c_#length| .cse39)) (= (select |c_#valid| .cse38) 1) (= (store |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_148| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_148|) (= (select |c_#valid| .cse39) 1) (= (store |v_#memory_int_148| .cse39 (store (select |v_#memory_int_148| .cse39) 16 (select (select |v_#memory_int_149| .cse39) 16))) |v_#memory_int_149|) (= (store |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse39)) |v_#memory_$Pointer$.base_171|) (= (store .cse44 .cse38 (store (select .cse44 .cse38) .cse37 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (= (store .cse45 .cse38 (store (select .cse45 .cse38) .cse37 0)) |c_#memory_$Pointer$.offset|)))))) .cse1 .cse30 .cse31 .cse32 .cse33 .cse34)))))) is different from false [2024-11-14 04:01:31,325 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.base|) (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.offset|) (let ((.cse2 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse5 (exists ((|v_#valid_140| (Array Int Int))) (let ((.cse61 (store |v_#valid_140| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse60 (store .cse61 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse60 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select (store .cse60 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_140| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse61 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse8 (exists ((|v_#memory_int_139| (Array Int (Array Int Int))) (|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (let ((.cse56 (select |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse58 (select (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse59 (select |v_#memory_int_144| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse57 (select (select |v_#memory_int_141| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse56 0))) |v_#memory_int_142|) (= (store |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse57)) |v_#memory_int_141|) (= (store |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse58)) |v_#memory_int_140|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse56 24 (select (select |v_old(#memory_int)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (<= 0 (+ .cse57 2147483648)) (= (store |v_#memory_int_144| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse59 16 (select (select |v_#memory_int_139| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_139|) (<= .cse58 2147483647) (<= 0 (+ 2147483648 .cse58)) (= (store |v_#memory_int_143| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_143| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse59 8))) |v_#memory_int_144|) (<= .cse57 2147483647))))) (.cse9 (exists ((|v_#memory_$Pointer$.offset_164| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_165| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_167| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_165|) (= (let ((.cse55 (store |v_#memory_$Pointer$.offset_167| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_167| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse55 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse55 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_164|)))) (.cse10 (exists ((|v_#memory_$Pointer$.base_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_165| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_166| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_166|) (= |v_#memory_$Pointer$.base_165| (let ((.cse54 (store |v_#memory_$Pointer$.base_168| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_168| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse54 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse54 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))))) (.cse23 (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_165| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_166| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_166|) (= (let ((.cse53 (store |v_#memory_$Pointer$.base_162| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_162| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse53 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse53 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_165| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_165|)))) (.cse7 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse24 (exists ((|v_#memory_int_BEFORE_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_139| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (let ((.cse49 (select |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse50 (select |v_#memory_int_146| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse52 (select (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse51 (select (select |v_#memory_int_141| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= (store |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_141| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse49 0))) |v_#memory_int_142|) (= (store |v_#memory_int_145| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_145| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse50 8))) |v_#memory_int_146|) (= (store |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_140| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse51)) |v_#memory_int_141|) (= (store |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_139| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse52)) |v_#memory_int_140|) (<= 0 (+ .cse51 2147483648)) (= (store |v_#memory_int_142| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse49 24 (select (select |v_#memory_int_BEFORE_CALL_36| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_36|) (= (store |v_#memory_int_146| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse50 16 (select (select |v_#memory_int_139| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_139|) (<= .cse52 2147483647) (<= 0 (+ 2147483648 .cse52)) (<= .cse51 2147483647))))) (.cse11 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse12 (exists ((|v_#length_120| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_120| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse14 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse16 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse25 (exists ((|v_#valid_144| (Array Int Int))) (let ((.cse48 (store |v_#valid_144| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse47 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse47 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select |v_#valid_144| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse48 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse17 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse18 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse19 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse26 (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_164| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_165| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_165| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_165|) (= (let ((.cse46 (store |v_#memory_$Pointer$.offset_161| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_161| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse46 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse46 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_164| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_164|)))) (.cse20 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse21 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_26| Int)) (and (not (= |v_ULTIMATE.start_create_#t~nondet9#1_26| 0)) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_26| 2147483648)) (<= |v_ULTIMATE.start_create_#t~nondet9#1_26| 2147483647)))) (.cse31 (<= 1 |c_#StackHeapBarrier|)) (.cse32 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse33 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse34 (<= 16 .cse1)) (.cse35 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0))) (or (and .cse2 (exists ((|v_#memory_$Pointer$.base_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (let ((.cse6 (select (select |v_#memory_$Pointer$.base_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse29 (let ((.cse30 (store |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse30 .cse6 (store (select .cse30 .cse6) 16 0)))) (.cse28 (store |v_#memory_$Pointer$.base_171| .cse6 (store (select |v_#memory_$Pointer$.base_171| .cse6) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse4 (select (select .cse28 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse3 (select (select .cse29 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= (+ .cse3 8) (select |c_#length| .cse4)) (<= 0 .cse3) (= |c_#memory_int| (store |v_#memory_int_149| .cse4 (store (select |v_#memory_int_149| .cse4) .cse3 (select (select |c_#memory_int| .cse4) .cse3)))) (let ((.cse13 (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (.cse15 (exists ((|v_#memory_int_137| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int)))) (let ((.cse27 (select |v_#memory_int_138| .cse6))) (and (= |v_#memory_int_147| (store |v_#memory_int_138| .cse6 (store .cse27 16 (select (select |v_#memory_int_147| .cse6) 16)))) (= (store |v_#memory_int_137| .cse6 (store (select |v_#memory_int_137| .cse6) 8 (select .cse27 8))) |v_#memory_int_138|))))) (.cse22 (not (= .cse6 0)))) (or (and .cse5 (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_161| .cse6 (store (store (select |v_#memory_$Pointer$.offset_161| .cse6) 8 0) 16 0)) |v_#memory_$Pointer$.offset_169|)) .cse7 (exists ((|v_#valid_143| (Array Int Int))) (and (= (select |v_#valid_143| .cse6) 0) (= |c_#valid| (store |v_#valid_143| .cse6 1)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_162| .cse6 (store (store (select |v_#memory_$Pointer$.base_162| .cse6) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse22 (exists ((|v_#length_123| (Array Int Int))) (= (store |v_#length_123| .cse6 32) |c_#length|))) (and (exists ((|v_#memory_$Pointer$.base_169| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_169| .cse6 (store (store (select |v_#memory_$Pointer$.base_169| .cse6) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse23 (exists ((|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_169| (store |v_#memory_$Pointer$.offset_168| .cse6 (store (store (select |v_#memory_$Pointer$.offset_168| .cse6) 8 0) 16 0)))) .cse7 .cse24 (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| .cse6 32) |c_#length|)) (exists ((|v_#valid_140| (Array Int Int))) (and (= (select |v_#valid_140| .cse6) 0) (= |c_#valid| (store |v_#valid_140| .cse6 1)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse21 .cse22))) (<= 24 (select |c_#length| .cse6)) (= (select |c_#valid| .cse4) 1) (= (store |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_148| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_148|) (= (select |c_#valid| .cse6) 1) (= (store |v_#memory_int_148| .cse6 (store (select |v_#memory_int_148| .cse6) 16 (select (select |v_#memory_int_149| .cse6) 16))) |v_#memory_int_149|) (= (store |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse6)) |v_#memory_$Pointer$.base_171|) (= (store .cse28 .cse4 (store (select .cse28 .cse4) .cse3 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (= (store .cse29 .cse4 (store (select .cse29 .cse4) .cse3 0)) |c_#memory_$Pointer$.offset|)))))) .cse31 .cse32 .cse33 .cse34 .cse35) (exists ((|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_#memory_int_157| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int)))) (let ((.cse37 (select (select |v_#memory_$Pointer$.offset_179| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse36 (select (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_int_157| .cse36 (store (select |v_#memory_int_157| .cse36) .cse37 (select (select |c_#memory_int| .cse36) .cse37))) |c_#memory_int|) (or (and .cse2 (exists ((|v_#memory_$Pointer$.base_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (let ((.cse38 (select (select |v_#memory_$Pointer$.base_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (let ((.cse39 (<= (+ .cse38 1) |c_#StackHeapBarrier|)) (.cse40 (exists ((|v_#memory_int_137| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int)))) (let ((.cse42 (select |v_#memory_int_138| .cse38))) (and (= |v_#memory_int_147| (store |v_#memory_int_138| .cse38 (store .cse42 16 (select (select |v_#memory_int_147| .cse38) 16)))) (= (store |v_#memory_int_137| .cse38 (store (select |v_#memory_int_137| .cse38) 8 (select .cse42 8))) |v_#memory_int_138|))))) (.cse41 (not (= .cse38 0)))) (or (and .cse5 (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_161| .cse38 (store (store (select |v_#memory_$Pointer$.offset_161| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.offset_169|)) .cse7 (exists ((|v_#valid_143| (Array Int Int))) (and (= (select |v_#valid_143| .cse38) 0) (= |c_#valid| (store |v_#valid_143| .cse38 1)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse39 .cse14 .cse40 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_162| .cse38 (store (store (select |v_#memory_$Pointer$.base_162| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse41 (exists ((|v_#length_123| (Array Int Int))) (= (store |v_#length_123| .cse38 32) |c_#length|))) (and (exists ((|v_#memory_$Pointer$.base_169| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_169| .cse38 (store (store (select |v_#memory_$Pointer$.base_169| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.base_170|)) .cse23 (exists ((|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_169| (store |v_#memory_$Pointer$.offset_168| .cse38 (store (store (select |v_#memory_$Pointer$.offset_168| .cse38) 8 0) 16 0)))) .cse7 .cse24 (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| .cse38 32) |c_#length|)) (exists ((|v_#valid_140| (Array Int Int))) (and (= (select |v_#valid_140| .cse38) 0) (= |c_#valid| (store |v_#valid_140| .cse38 1)))) .cse11 .cse12 .cse39 .cse14 .cse40 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse21 .cse41))) (<= 24 (select |c_#length| .cse38)) (= (store |v_#memory_$Pointer$.base_171| .cse38 (store (select |v_#memory_$Pointer$.base_171| .cse38) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_180|) (= (store |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_147| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_148| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_148|) (= (select |c_#valid| .cse38) 1) (= |v_#memory_$Pointer$.offset_179| (let ((.cse43 (store |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_169| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse43 .cse38 (store (select .cse43 .cse38) 16 0)))) (= (store |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse38)) |v_#memory_$Pointer$.base_171|) (= (store |v_#memory_int_148| .cse38 (store (select |v_#memory_int_148| .cse38) 16 (select (select |v_#memory_int_157| .cse38) 16))) |v_#memory_int_157|)))) .cse31 .cse32 .cse33 .cse34 .cse35) (exists ((|v_#memory_int_155| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_177| (Array Int (Array Int Int)))) (let ((.cse44 (select (select |v_#memory_$Pointer$.base_179| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= 24 (select |c_#length| .cse44)) (= (store |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse44)) |v_#memory_$Pointer$.base_179|) (= (store |v_#memory_$Pointer$.base_179| .cse44 (store (select |v_#memory_$Pointer$.base_179| .cse44) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_180|) (= (store |v_#memory_int_155| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_155| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_156| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_156|) (= (store |v_#memory_int_156| .cse44 (store (select |v_#memory_int_156| .cse44) 16 (select (select |v_#memory_int_157| .cse44) 16))) |v_#memory_int_157|) (= |v_#memory_$Pointer$.offset_179| (let ((.cse45 (store |v_#memory_$Pointer$.offset_177| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_177| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse45 .cse44 (store (select .cse45 .cse44) 16 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (select |c_#valid| .cse44) 1))))) (= (store |v_#memory_$Pointer$.offset_179| .cse36 (store (select |v_#memory_$Pointer$.offset_179| .cse36) .cse37 |c_ULTIMATE.start_create_~data1~0#1.offset|)) |c_#memory_$Pointer$.offset|) (<= 0 .cse37) (= (store |v_#memory_$Pointer$.base_180| .cse36 (store (select |v_#memory_$Pointer$.base_180| .cse36) .cse37 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (<= (+ .cse37 8) (select |c_#length| .cse36)) (= (select |c_#valid| .cse36) 1)))))))) is different from false [2024-11-14 04:01:53,055 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8334#(and (<= (select |#length| |ULTIMATE.start_main_~l~0#1.base|) (+ |ULTIMATE.start_loop_~node~0#1.offset| 31)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~l~0#1.base|) |ULTIMATE.start_loop_~node~0#1.offset|) |ULTIMATE.start_loop_#t~mem15#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~l~0#1.base|) 1) (<= 0 |ULTIMATE.start_loop_~node~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~l~0#1.base|) |ULTIMATE.start_loop_~node~0#1.offset|) |ULTIMATE.start_loop_#t~mem15#1.base|) (or (not (= |ULTIMATE.start_loop_~node~0#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))) (= |ULTIMATE.start_loop_~node~0#1.offset| |ULTIMATE.start_main_~l~0#1.offset|) (exists ((|v_ULTIMATE.start_create_~now~0#1.base_53| Int)) (and (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_53|) 1) (<= 8 (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_53|)))) (= |ULTIMATE.start_loop_~node~0#1.base| |ULTIMATE.start_main_~l~0#1.base|) (<= (+ |ULTIMATE.start_loop_~node~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~l~0#1.base|)))' at error location [2024-11-14 04:01:53,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:01:53,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:01:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2024-11-14 04:01:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892966245] [2024-11-14 04:01:53,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 04:01:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:01:53,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 04:01:53,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2112, Unknown=32, NotChecked=190, Total=2550 [2024-11-14 04:01:53,057 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 24 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 04:01:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:54,457 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-11-14 04:01:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 04:01:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-14 04:01:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:54,460 INFO L225 Difference]: With dead ends: 123 [2024-11-14 04:01:54,460 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 04:01:54,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 253.5s TimeCoverageRelationStatistics Valid=287, Invalid=2658, Unknown=33, NotChecked=214, Total=3192 [2024-11-14 04:01:54,462 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:54,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 429 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:01:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 04:01:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-11-14 04:01:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 113 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:01:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-11-14 04:01:54,470 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 32 [2024-11-14 04:01:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:54,471 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-11-14 04:01:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 04:01:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-11-14 04:01:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 04:01:54,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:54,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:54,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 04:01:54,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:54,674 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 04:01:54,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -17284354, now seen corresponding path program 1 times [2024-11-14 04:01:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:01:54,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277169874] [2024-11-14 04:01:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:01:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:54,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:01:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277169874] [2024-11-14 04:01:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277169874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:01:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914456930] [2024-11-14 04:01:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:01:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:01:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:01:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:01:54,876 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:01:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:55,213 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2024-11-14 04:01:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:01:55,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-14 04:01:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:55,214 INFO L225 Difference]: With dead ends: 119 [2024-11-14 04:01:55,214 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 04:01:55,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:01:55,215 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 31 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:55,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:01:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 04:01:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-14 04:01:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 114 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:01:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-14 04:01:55,218 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 32 [2024-11-14 04:01:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:55,218 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-14 04:01:55,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:01:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-14 04:01:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 04:01:55,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:55,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-14 04:01:55,219 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 04:01:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1286343118, now seen corresponding path program 1 times [2024-11-14 04:01:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:01:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579927739] [2024-11-14 04:01:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:01:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:01:56,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:01:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579927739] [2024-11-14 04:01:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579927739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317842837] [2024-11-14 04:01:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:56,022 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:56,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:01:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:56,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:01:56,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:56,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:01:56,377 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 04:01:56,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:01:56,593 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:01:56,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 04:01:56,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:01:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 04:01:56,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:01:56,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 04:01:56,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 04:01:56,807 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-14 04:01:56,867 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 04:01:56,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 04:01:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-14 04:01:56,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:56,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317842837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:56,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1083488672] [2024-11-14 04:01:56,979 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 04:01:56,979 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:01:56,979 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:01:56,979 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:01:56,979 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:02:11,262 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 04:02:11,283 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:03:42,383 WARN L286 SmtUtils]: Spent 46.48s on a formula simplification. DAG size of input: 373 DAG size of output: 363 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:05:10,202 WARN L286 SmtUtils]: Spent 51.52s on a formula simplification. DAG size of input: 380 DAG size of output: 369 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:05:12,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse41 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.cse35 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1)) (.cse34 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse36 (<= 1 |c_#StackHeapBarrier|)) (.cse37 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse38 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse39 (<= 16 .cse41)) (.cse40 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse11 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_int_165| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int)))) (let ((.cse70 (select |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse69 (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse68 (select (select |v_#memory_int_169| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse71 (select (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))) (and (<= 0 (+ .cse68 2147483648)) (= (store |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse69 0))) |v_#memory_int_170|) (= (store |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse70 16 (select (select |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_167|) (<= 0 (+ .cse71 2147483648)) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse70 8))) |v_#memory_int_166|) (<= .cse71 2147483647) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse69 24 (select (select |v_old(#memory_int)_AFTER_CALL_34| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (= (store |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse68)) |v_#memory_int_169|) (<= .cse68 2147483647) (= (store |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse71)) |v_#memory_int_168|))))) (.cse22 (exists ((|v_#valid_154| (Array Int Int))) (let ((.cse67 (store |v_#valid_154| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse66 (store .cse67 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select |v_#valid_154| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select (store .cse66 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse66 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select .cse67 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse23 (exists ((|v_#length_133| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_133| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse25 (exists ((|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_193| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_191|) (= (let ((.cse65 (store |v_#memory_$Pointer$.offset_193| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_193| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse65 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse65 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_190|)))) (.cse26 (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_196|) (= (let ((.cse64 (store |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse64 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse64 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_195|)))) (.cse27 (exists ((|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_194| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_191|) (= (let ((.cse63 (store |v_#memory_$Pointer$.offset_194| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_194| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse63 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse63 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_190|)))) (.cse8 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse12 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse13 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_30| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet9#1_30| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_30| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet9#1_30| 0))))) (.cse28 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_int_165| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_54| (Array Int (Array Int Int)))) (let ((.cse60 (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse61 (select |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse59 (select (select |v_#memory_int_169| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse62 (select (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))) (and (<= 0 (+ .cse59 2147483648)) (= (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse60 24 (select (select |v_#memory_int_BEFORE_CALL_54| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_54|) (= (store |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse60 0))) |v_#memory_int_170|) (= (store |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse61 16 (select (select |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_167|) (<= 0 (+ .cse62 2147483648)) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse61 8))) |v_#memory_int_166|) (<= .cse62 2147483647) (= (store |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse59)) |v_#memory_int_169|) (<= .cse59 2147483647) (= (store |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse62)) |v_#memory_int_168|))))) (.cse14 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse16 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse17 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse20 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse21 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse29 (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_196|) (= (let ((.cse58 (store |v_#memory_$Pointer$.base_199| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_199| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse58 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse58 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_195|)))) (.cse30 (exists ((|v_#valid_158| (Array Int Int))) (let ((.cse56 (store |v_#valid_158| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse57 (store .cse56 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse56 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse57 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select |v_#valid_158| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select (store .cse57 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1)))))) (.cse31 (exists ((|v_#length_134| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_134| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|))))) (or (and (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int))) (|v_#memory_int_176| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int))) (|v_#memory_int_175| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_201| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse5 (store |v_#memory_$Pointer$.base_201| .cse3 (store (select |v_#memory_$Pointer$.base_201| .cse3) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse4 (let ((.cse33 (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse33 .cse3 (store (select .cse33 .cse3) 16 0))))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= (+ .cse1 8) (select |c_#length| .cse2)) (= (store |v_#memory_int_177| .cse2 (store (select |v_#memory_int_177| .cse2) .cse1 (select (select |c_#memory_int| .cse2) .cse1))) |c_#memory_int|) (= (select |c_#valid| .cse3) 1) (= (store |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_176| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_176|) (= (store .cse4 .cse2 (store (select .cse4 .cse2) .cse1 0)) |c_#memory_$Pointer$.offset|) (<= 0 .cse1) (<= 24 (select |c_#length| .cse3)) (= |c_#memory_$Pointer$.base| (store .cse5 .cse2 (store (select .cse5 .cse2) .cse1 |c_ULTIMATE.start_create_~data1~0#1.base|))) (= (select |c_#valid| .cse2) 1) (let ((.cse9 (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_187| .cse3 (store (store (select |v_#memory_$Pointer$.offset_187| .cse3) 8 0) 16 0)) |v_#memory_$Pointer$.offset_195|))) (.cse15 (exists ((|v_#length_130| (Array Int Int))) (= |c_#length| (store |v_#length_130| .cse3 32)))) (.cse18 (not (= 0 .cse3))) (.cse19 (exists ((|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_192| .cse3 (store (store (select |v_#memory_$Pointer$.base_192| .cse3) 8 0) 16 0)) |v_#memory_$Pointer$.base_200|))) (.cse24 (<= (+ 1 .cse3) |c_#StackHeapBarrier|)) (.cse7 (select (select |v_#memory_int_175| .cse3) 16))) (or (and (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_#memory_int_172| .cse3))) (and (= (store |v_#memory_int_171| .cse3 (store (select |v_#memory_int_171| .cse3) 8 (select .cse6 8))) |v_#memory_int_172|) (= (store |v_#memory_int_172| .cse3 (store .cse6 16 .cse7)) |v_#memory_int_175|)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#valid_157| (Array Int Int))) (and (= (select |v_#valid_157| .cse3) 0) (= |c_#valid| (store |v_#valid_157| .cse3 1)))) .cse26) (and .cse27 .cse8 .cse9 .cse10 .cse12 .cse13 .cse28 .cse14 (exists ((|v_#valid_154| (Array Int Int))) (and (= (select |v_#valid_154| .cse3) 0) (= |c_#valid| (store |v_#valid_154| .cse3 1)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse30 .cse24 .cse31 (exists ((|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_int_174| .cse3))) (and (= (store |v_#memory_int_174| .cse3 (store .cse32 16 .cse7)) |v_#memory_int_175|) (= (store |v_#memory_int_173| .cse3 (store (select |v_#memory_int_173| .cse3) 8 (select .cse32 8))) |v_#memory_int_174|))))))) (= |v_#memory_$Pointer$.base_201| (store |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse3))) (= (store |v_#memory_int_176| .cse3 (store (select |v_#memory_int_176| .cse3) 16 (select (select |v_#memory_int_177| .cse3) 16))) |v_#memory_int_177|)))))) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse35 (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse41) (exists ((|v_#memory_$Pointer$.offset_205| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_210| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int)))) (let ((.cse43 (select (select |v_#memory_$Pointer$.offset_205| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse42 (select (select |v_#memory_$Pointer$.base_210| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_210| .cse42 (store (select |v_#memory_$Pointer$.base_210| .cse42) .cse43 |c_ULTIMATE.start_create_~data1~0#1.base|))) (= (select |c_#valid| .cse42) 1) (or (and .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int))) (|v_#memory_int_176| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int))) (|v_#memory_int_175| (Array Int (Array Int Int)))) (let ((.cse44 (select (select |v_#memory_$Pointer$.base_201| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (select |c_#valid| .cse44) 1) (= (store |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_176| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_176|) (= (let ((.cse45 (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse45 .cse44 (store (select .cse45 .cse44) 16 0))) |v_#memory_$Pointer$.offset_205|) (= (store |v_#memory_int_176| .cse44 (store (select |v_#memory_int_176| .cse44) 16 (select (select |v_#memory_int_185| .cse44) 16))) |v_#memory_int_185|) (<= 24 (select |c_#length| .cse44)) (let ((.cse48 (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_187| .cse44 (store (store (select |v_#memory_$Pointer$.offset_187| .cse44) 8 0) 16 0)) |v_#memory_$Pointer$.offset_195|))) (.cse49 (exists ((|v_#length_130| (Array Int Int))) (= |c_#length| (store |v_#length_130| .cse44 32)))) (.cse50 (not (= 0 .cse44))) (.cse51 (exists ((|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_192| .cse44 (store (store (select |v_#memory_$Pointer$.base_192| .cse44) 8 0) 16 0)) |v_#memory_$Pointer$.base_200|))) (.cse52 (<= (+ 1 .cse44) |c_#StackHeapBarrier|)) (.cse47 (select (select |v_#memory_int_175| .cse44) 16))) (or (and (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse46 (select |v_#memory_int_172| .cse44))) (and (= (store |v_#memory_int_171| .cse44 (store (select |v_#memory_int_171| .cse44) 8 (select .cse46 8))) |v_#memory_int_172|) (= (store |v_#memory_int_172| .cse44 (store .cse46 16 .cse47)) |v_#memory_int_175|)))) .cse8 .cse48 .cse10 .cse11 .cse12 .cse13 .cse14 .cse49 .cse16 .cse17 .cse50 .cse51 .cse20 .cse21 .cse22 .cse23 .cse52 .cse25 (exists ((|v_#valid_157| (Array Int Int))) (and (= (select |v_#valid_157| .cse44) 0) (= |c_#valid| (store |v_#valid_157| .cse44 1)))) .cse26) (and .cse27 .cse8 .cse48 .cse10 .cse12 .cse13 .cse28 .cse14 (exists ((|v_#valid_154| (Array Int Int))) (and (= (select |v_#valid_154| .cse44) 0) (= |c_#valid| (store |v_#valid_154| .cse44 1)))) .cse49 .cse16 .cse17 .cse50 .cse51 .cse20 .cse21 .cse29 .cse30 .cse52 .cse31 (exists ((|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (let ((.cse53 (select |v_#memory_int_174| .cse44))) (and (= (store |v_#memory_int_174| .cse44 (store .cse53 16 .cse47)) |v_#memory_int_175|) (= (store |v_#memory_int_173| .cse44 (store (select |v_#memory_int_173| .cse44) 8 (select .cse53 8))) |v_#memory_int_174|))))))) (= |v_#memory_$Pointer$.base_201| (store |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse44))) (= |v_#memory_$Pointer$.base_210| (store |v_#memory_$Pointer$.base_201| .cse44 (store (select |v_#memory_$Pointer$.base_201| .cse44) 16 |c_ULTIMATE.start_create_~now~0#1.base|))))))) (exists ((|v_#memory_$Pointer$.offset_203| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_209| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#memory_int_183| (Array Int (Array Int Int))) (|v_#memory_int_184| (Array Int (Array Int Int)))) (let ((.cse54 (select (select |v_#memory_$Pointer$.base_209| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (select |c_#valid| .cse54) 1) (<= 24 (select |c_#length| .cse54)) (= (store |v_#memory_int_184| .cse54 (store (select |v_#memory_int_184| .cse54) 16 (select (select |v_#memory_int_185| .cse54) 16))) |v_#memory_int_185|) (= (store |v_#memory_$Pointer$.base_209| .cse54 (store (select |v_#memory_$Pointer$.base_209| .cse54) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_210|) (= (store |v_#memory_int_183| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_183| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_184| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_184|) (= (store |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse54)) |v_#memory_$Pointer$.base_209|) (= (let ((.cse55 (store |v_#memory_$Pointer$.offset_203| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_203| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse55 .cse54 (store (select .cse55 .cse54) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_205|))))) (<= 0 .cse43) (= (store |v_#memory_int_185| .cse42 (store (select |v_#memory_int_185| .cse42) .cse43 (select (select |c_#memory_int| .cse42) .cse43))) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_205| .cse42 (store (select |v_#memory_$Pointer$.offset_205| .cse42) .cse43 |c_ULTIMATE.start_create_~data1~0#1.offset|))) (<= (+ .cse43 8) (select |c_#length| .cse42))))))))))) is different from false [2024-11-14 04:05:14,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 .cse0) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.base|) (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.offset|) (let ((.cse35 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse36 (<= 1 |c_#StackHeapBarrier|)) (.cse37 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse38 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse39 (<= 16 .cse1)) (.cse40 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse12 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_int_165| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int)))) (let ((.cse69 (select |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse68 (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse67 (select (select |v_#memory_int_169| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse70 (select (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))) (and (<= 0 (+ .cse67 2147483648)) (= (store |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse68 0))) |v_#memory_int_170|) (= (store |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse69 16 (select (select |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_167|) (<= 0 (+ .cse70 2147483648)) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse69 8))) |v_#memory_int_166|) (<= .cse70 2147483647) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse68 24 (select (select |v_old(#memory_int)_AFTER_CALL_34| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (= (store |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse67)) |v_#memory_int_169|) (<= .cse67 2147483647) (= (store |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse70)) |v_#memory_int_168|))))) (.cse23 (exists ((|v_#valid_154| (Array Int Int))) (let ((.cse66 (store |v_#valid_154| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse65 (store .cse66 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select |v_#valid_154| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select (store .cse65 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse65 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select .cse66 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse24 (exists ((|v_#length_133| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_133| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|)))) (.cse26 (exists ((|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_193| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_191|) (= (let ((.cse64 (store |v_#memory_$Pointer$.offset_193| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_193| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse64 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse64 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_190|)))) (.cse27 (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_196|) (= (let ((.cse63 (store |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse63 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse63 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_195|)))) (.cse28 (exists ((|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_194| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_191|) (= (let ((.cse62 (store |v_#memory_$Pointer$.offset_194| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_194| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse62 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse62 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_190|)))) (.cse9 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse11 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse13 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse14 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_30| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet9#1_30| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_30| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet9#1_30| 0))))) (.cse29 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_int_165| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_54| (Array Int (Array Int Int)))) (let ((.cse59 (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse60 (select |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse58 (select (select |v_#memory_int_169| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse61 (select (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))) (and (<= 0 (+ .cse58 2147483648)) (= (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse59 24 (select (select |v_#memory_int_BEFORE_CALL_54| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_54|) (= (store |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_169| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse59 0))) |v_#memory_int_170|) (= (store |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse60 16 (select (select |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_167|) (<= 0 (+ .cse61 2147483648)) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_165| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse60 8))) |v_#memory_int_166|) (<= .cse61 2147483647) (= (store |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse58)) |v_#memory_int_169|) (<= .cse58 2147483647) (= (store |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_167| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse61)) |v_#memory_int_168|))))) (.cse15 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse17 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse18 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse21 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse22 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse30 (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_196|) (= (let ((.cse57 (store |v_#memory_$Pointer$.base_199| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_199| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse57 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse57 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_195|)))) (.cse31 (exists ((|v_#valid_158| (Array Int Int))) (let ((.cse55 (store |v_#valid_158| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse56 (store .cse55 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse55 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse56 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select |v_#valid_158| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select (store .cse56 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1)))))) (.cse32 (exists ((|v_#length_134| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_134| |c_ULTIMATE.start_create_~dll~0#1.base| 32) |c_ULTIMATE.start_create_~data1~0#1.base| 4) |c_ULTIMATE.start_create_~data2~0#1.base| 4) |c_ULTIMATE.start_create_~now~0#1.base|))))) (or (and (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int))) (|v_#memory_int_176| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int))) (|v_#memory_int_175| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.base_201| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse6 (store |v_#memory_$Pointer$.base_201| .cse4 (store (select |v_#memory_$Pointer$.base_201| .cse4) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse5 (let ((.cse34 (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse34 .cse4 (store (select .cse34 .cse4) 16 0))))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= (+ .cse2 8) (select |c_#length| .cse3)) (= (store |v_#memory_int_177| .cse3 (store (select |v_#memory_int_177| .cse3) .cse2 (select (select |c_#memory_int| .cse3) .cse2))) |c_#memory_int|) (= (select |c_#valid| .cse4) 1) (= (store |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_176| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_176|) (= (store .cse5 .cse3 (store (select .cse5 .cse3) .cse2 0)) |c_#memory_$Pointer$.offset|) (<= 0 .cse2) (<= 24 (select |c_#length| .cse4)) (= |c_#memory_$Pointer$.base| (store .cse6 .cse3 (store (select .cse6 .cse3) .cse2 |c_ULTIMATE.start_create_~data1~0#1.base|))) (= (select |c_#valid| .cse3) 1) (let ((.cse10 (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_187| .cse4 (store (store (select |v_#memory_$Pointer$.offset_187| .cse4) 8 0) 16 0)) |v_#memory_$Pointer$.offset_195|))) (.cse16 (exists ((|v_#length_130| (Array Int Int))) (= |c_#length| (store |v_#length_130| .cse4 32)))) (.cse19 (not (= 0 .cse4))) (.cse20 (exists ((|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_192| .cse4 (store (store (select |v_#memory_$Pointer$.base_192| .cse4) 8 0) 16 0)) |v_#memory_$Pointer$.base_200|))) (.cse25 (<= (+ 1 .cse4) |c_#StackHeapBarrier|)) (.cse8 (select (select |v_#memory_int_175| .cse4) 16))) (or (and (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_int_172| .cse4))) (and (= (store |v_#memory_int_171| .cse4 (store (select |v_#memory_int_171| .cse4) 8 (select .cse7 8))) |v_#memory_int_172|) (= (store |v_#memory_int_172| .cse4 (store .cse7 16 .cse8)) |v_#memory_int_175|)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((|v_#valid_157| (Array Int Int))) (and (= (select |v_#valid_157| .cse4) 0) (= |c_#valid| (store |v_#valid_157| .cse4 1)))) .cse27) (and .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse29 .cse15 (exists ((|v_#valid_154| (Array Int Int))) (and (= (select |v_#valid_154| .cse4) 0) (= |c_#valid| (store |v_#valid_154| .cse4 1)))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse30 .cse31 .cse25 .cse32 (exists ((|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (let ((.cse33 (select |v_#memory_int_174| .cse4))) (and (= (store |v_#memory_int_174| .cse4 (store .cse33 16 .cse8)) |v_#memory_int_175|) (= (store |v_#memory_int_173| .cse4 (store (select |v_#memory_int_173| .cse4) 8 (select .cse33 8))) |v_#memory_int_174|))))))) (= |v_#memory_$Pointer$.base_201| (store |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse4))) (= (store |v_#memory_int_176| .cse4 (store (select |v_#memory_int_176| .cse4) 16 (select (select |v_#memory_int_177| .cse4) 16))) |v_#memory_int_177|)))))) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (exists ((|v_#memory_$Pointer$.offset_205| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_210| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.offset_205| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse41 (select (select |v_#memory_$Pointer$.base_210| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_210| .cse41 (store (select |v_#memory_$Pointer$.base_210| .cse41) .cse42 |c_ULTIMATE.start_create_~data1~0#1.base|))) (= (select |c_#valid| .cse41) 1) (or (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int))) (|v_#memory_int_176| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int))) (|v_#memory_int_175| (Array Int (Array Int Int)))) (let ((.cse43 (select (select |v_#memory_$Pointer$.base_201| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (select |c_#valid| .cse43) 1) (= (store |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_175| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_176| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_176|) (= (let ((.cse44 (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse44 .cse43 (store (select .cse44 .cse43) 16 0))) |v_#memory_$Pointer$.offset_205|) (= (store |v_#memory_int_176| .cse43 (store (select |v_#memory_int_176| .cse43) 16 (select (select |v_#memory_int_185| .cse43) 16))) |v_#memory_int_185|) (<= 24 (select |c_#length| .cse43)) (let ((.cse47 (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_187| .cse43 (store (store (select |v_#memory_$Pointer$.offset_187| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.offset_195|))) (.cse48 (exists ((|v_#length_130| (Array Int Int))) (= |c_#length| (store |v_#length_130| .cse43 32)))) (.cse49 (not (= 0 .cse43))) (.cse50 (exists ((|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_192| .cse43 (store (store (select |v_#memory_$Pointer$.base_192| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.base_200|))) (.cse51 (<= (+ 1 .cse43) |c_#StackHeapBarrier|)) (.cse46 (select (select |v_#memory_int_175| .cse43) 16))) (or (and (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse45 (select |v_#memory_int_172| .cse43))) (and (= (store |v_#memory_int_171| .cse43 (store (select |v_#memory_int_171| .cse43) 8 (select .cse45 8))) |v_#memory_int_172|) (= (store |v_#memory_int_172| .cse43 (store .cse45 16 .cse46)) |v_#memory_int_175|)))) .cse9 .cse47 .cse11 .cse12 .cse13 .cse14 .cse15 .cse48 .cse17 .cse18 .cse49 .cse50 .cse21 .cse22 .cse23 .cse24 .cse51 .cse26 (exists ((|v_#valid_157| (Array Int Int))) (and (= (select |v_#valid_157| .cse43) 0) (= |c_#valid| (store |v_#valid_157| .cse43 1)))) .cse27) (and .cse28 .cse9 .cse47 .cse11 .cse13 .cse14 .cse29 .cse15 (exists ((|v_#valid_154| (Array Int Int))) (and (= (select |v_#valid_154| .cse43) 0) (= |c_#valid| (store |v_#valid_154| .cse43 1)))) .cse48 .cse17 .cse18 .cse49 .cse50 .cse21 .cse22 .cse30 .cse31 .cse51 .cse32 (exists ((|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_int_174| .cse43))) (and (= (store |v_#memory_int_174| .cse43 (store .cse52 16 .cse46)) |v_#memory_int_175|) (= (store |v_#memory_int_173| .cse43 (store (select |v_#memory_int_173| .cse43) 8 (select .cse52 8))) |v_#memory_int_174|))))))) (= |v_#memory_$Pointer$.base_201| (store |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse43))) (= |v_#memory_$Pointer$.base_210| (store |v_#memory_$Pointer$.base_201| .cse43 (store (select |v_#memory_$Pointer$.base_201| .cse43) 16 |c_ULTIMATE.start_create_~now~0#1.base|))))))) (exists ((|v_#memory_$Pointer$.offset_203| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_209| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#memory_int_183| (Array Int (Array Int Int))) (|v_#memory_int_184| (Array Int (Array Int Int)))) (let ((.cse53 (select (select |v_#memory_$Pointer$.base_209| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (select |c_#valid| .cse53) 1) (<= 24 (select |c_#length| .cse53)) (= (store |v_#memory_int_184| .cse53 (store (select |v_#memory_int_184| .cse53) 16 (select (select |v_#memory_int_185| .cse53) 16))) |v_#memory_int_185|) (= (store |v_#memory_$Pointer$.base_209| .cse53 (store (select |v_#memory_$Pointer$.base_209| .cse53) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_210|) (= (store |v_#memory_int_183| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_183| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_184| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_184|) (= (store |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse53)) |v_#memory_$Pointer$.base_209|) (= (let ((.cse54 (store |v_#memory_$Pointer$.offset_203| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_203| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse54 .cse53 (store (select .cse54 .cse53) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_205|))))) (<= 0 .cse42) (= (store |v_#memory_int_185| .cse41 (store (select |v_#memory_int_185| .cse41) .cse42 (select (select |c_#memory_int| .cse41) .cse42))) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_205| .cse41 (store (select |v_#memory_$Pointer$.offset_205| .cse41) .cse42 |c_ULTIMATE.start_create_~data1~0#1.offset|))) (<= (+ .cse42 8) (select |c_#length| .cse41))))))))) is different from false [2024-11-14 04:05:14,296 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8985#(and (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (exists ((|v_ULTIMATE.start_create_~now~0#1.base_58| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_58|) 1))))' at error location [2024-11-14 04:05:14,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:05:14,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:05:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2024-11-14 04:05:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473288447] [2024-11-14 04:05:14,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:05:14,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 04:05:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:05:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 04:05:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1473, Unknown=21, NotChecked=240, Total=1892 [2024-11-14 04:05:14,298 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 23 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:05:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:05:15,946 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-14 04:05:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:05:15,947 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-11-14 04:05:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:05:15,948 INFO L225 Difference]: With dead ends: 116 [2024-11-14 04:05:15,948 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 04:05:15,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 184.3s TimeCoverageRelationStatistics Valid=216, Invalid=2031, Unknown=21, NotChecked=282, Total=2550 [2024-11-14 04:05:15,949 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:05:15,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 409 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 515 Invalid, 0 Unknown, 67 Unchecked, 1.0s Time] [2024-11-14 04:05:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 04:05:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-14 04:05:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 111 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:05:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2024-11-14 04:05:15,955 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 34 [2024-11-14 04:05:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:05:15,955 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2024-11-14 04:05:15,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:05:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2024-11-14 04:05:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 04:05:15,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:05:15,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:05:15,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 04:05:16,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:05:16,161 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 04:05:16,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:05:16,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1286343117, now seen corresponding path program 1 times [2024-11-14 04:05:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:05:16,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636793927] [2024-11-14 04:05:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:16,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:05:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:05:18,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:05:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636793927] [2024-11-14 04:05:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636793927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:05:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107268990] [2024-11-14 04:05:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:18,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:05:18,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:05:18,018 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:05:18,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85f82f6f-d83f-4780-8955-91eca5c2fe76/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:05:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:18,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 04:05:18,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:18,346 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 04:05:18,533 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:05:18,533 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 04:05:18,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 04:05:18,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 04:05:18,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:05:18,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-14 04:05:18,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 04:05:19,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:05:19,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-14 04:05:19,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 04:05:19,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:05:19,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-14 04:05:19,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 04:05:19,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-14 04:05:19,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 04:05:19,455 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-14 04:05:19,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:05:19,511 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 04:05:19,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:05:19,538 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 04:05:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 04:05:19,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107268990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:05:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1330825846] [2024-11-14 04:05:19,954 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 04:05:19,954 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:05:19,954 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:05:19,954 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:05:19,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:05:35,106 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 04:05:35,133 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:07:03,480 WARN L286 SmtUtils]: Spent 40.67s on a formula simplification. DAG size of input: 381 DAG size of output: 371 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)