./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje --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.2.5-dev-a016563 [2024-11-09 06:30:31,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:30:31,449 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-09 06:30:31,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:30:31,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:30:31,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:30:31,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:30:31,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:30:31,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:30:31,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:30:31,493 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:30:31,493 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:30:31,493 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:30:31,494 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:30:31,494 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:30:31,497 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:30:31,498 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:30:31,498 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:30:31,499 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:30:31,499 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:30:31,499 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:30:31,505 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:30:31,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:30:31,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:30:31,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:30:31,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:30:31,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:30:31,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:30:31,510 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:30:31,510 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:30:31,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:30:31,511 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:30:31,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:30:31,512 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:30:31,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:30:31,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:30:31,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:30:31,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:30:31,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:30:31,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:30:31,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:30:31,517 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:30:31,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:30:31,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:30:31,518 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:30:31,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:30:31,518 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje 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-09 06:30:31,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:30:31,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:30:31,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:30:31,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:30:31,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:30:31,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i Unable to find full path for "g++" [2024-11-09 06:30:34,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:30:34,594 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:30:34,595 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-09 06:30:34,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/data/95bdeb6da/003ba792ae424fb28e973e596b7613e9/FLAG666609769 [2024-11-09 06:30:34,640 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/data/95bdeb6da/003ba792ae424fb28e973e596b7613e9 [2024-11-09 06:30:34,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:30:34,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:30:34,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:30:34,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:30:34,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:30:34,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:34" (1/1) ... [2024-11-09 06:30:34,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcb45e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:34, skipping insertion in model container [2024-11-09 06:30:34,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:30:34" (1/1) ... [2024-11-09 06:30:34,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:30:35,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:30:35,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:30:35,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:30:35,293 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:30:35,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35 WrapperNode [2024-11-09 06:30:35,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:30:35,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:30:35,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:30:35,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:30:35,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,350 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-11-09 06:30:35,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:30:35,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:30:35,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:30:35,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:30:35,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:30:35,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:30:35,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:30:35,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:30:35,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (1/1) ... [2024-11-09 06:30:35,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:30:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:35,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:30:35,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:30:35,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:30:35,471 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 06:30:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 06:30:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:30:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:30:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:30:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:30:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:30:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:30:35,649 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:30:35,651 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:30:36,149 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-09 06:30:36,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:30:36,239 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:30:36,240 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:30:36,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:30:36 BoogieIcfgContainer [2024-11-09 06:30:36,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:30:36,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:30:36,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:30:36,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:30:36,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:30:34" (1/3) ... [2024-11-09 06:30:36,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec1918b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:36, skipping insertion in model container [2024-11-09 06:30:36,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:30:35" (2/3) ... [2024-11-09 06:30:36,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec1918b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:30:36, skipping insertion in model container [2024-11-09 06:30:36,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:30:36" (3/3) ... [2024-11-09 06:30:36,253 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2024-11-09 06:30:36,277 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:30:36,277 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-09 06:30:36,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:30:36,340 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;@76c7cde7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:30:36,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 06:30:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 93 states have internal predecessors, (100), 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-09 06:30:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:30:36,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:36,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:30:36,357 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-09 06:30:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash 5982227, now seen corresponding path program 1 times [2024-11-09 06:30:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990572604] [2024-11-09 06:30:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:36,716 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-09 06:30:36,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990572604] [2024-11-09 06:30:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990572604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:36,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:30:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921755307] [2024-11-09 06:30:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:36,786 INFO L87 Difference]: Start difference. First operand has 97 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 93 states have internal predecessors, (100), 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-09 06:30:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:37,001 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-11-09 06:30:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:30:37,004 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-09 06:30:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:37,013 INFO L225 Difference]: With dead ends: 95 [2024-11-09 06:30:37,014 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 06:30:37,016 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-09 06:30:37,021 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:37,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 06:30:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 06:30:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 90 states have internal predecessors, (96), 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-09 06:30:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-09 06:30:37,082 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 4 [2024-11-09 06:30:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:37,083 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-09 06:30:37,083 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-09 06:30:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-09 06:30:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:30:37,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:37,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:30:37,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:30:37,086 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-09 06:30:37,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash 5982228, now seen corresponding path program 1 times [2024-11-09 06:30:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727080020] [2024-11-09 06:30:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:37,231 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-09 06:30:37,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727080020] [2024-11-09 06:30:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727080020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:37,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:30:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820494982] [2024-11-09 06:30:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:37,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:37,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:37,237 INFO L87 Difference]: Start difference. First operand 94 states and 100 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-09 06:30:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:37,414 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-09 06:30:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:30:37,415 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-09 06:30:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:37,417 INFO L225 Difference]: With dead ends: 92 [2024-11-09 06:30:37,418 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 06:30:37,419 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-09 06:30:37,422 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:37,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 06:30:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 06:30:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 43 states have (on average 2.186046511627907) internal successors, (94), 88 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-09 06:30:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-11-09 06:30:37,440 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 4 [2024-11-09 06:30:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:37,441 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-11-09 06:30:37,441 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-09 06:30:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-11-09 06:30:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:30:37,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:37,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:30:37,443 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-09 06:30:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1388127473, now seen corresponding path program 1 times [2024-11-09 06:30:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240183504] [2024-11-09 06:30:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:37,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:37,707 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-09 06:30:37,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240183504] [2024-11-09 06:30:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240183504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:30:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889794436] [2024-11-09 06:30:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:37,715 INFO L87 Difference]: Start difference. First operand 92 states and 98 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-09 06:30:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:37,840 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-09 06:30:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:30:37,842 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-09 06:30:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:37,844 INFO L225 Difference]: With dead ends: 95 [2024-11-09 06:30:37,845 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 06:30:37,845 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-09 06:30:37,846 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:37,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 06:30:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2024-11-09 06:30:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 87 states have internal predecessors, (93), 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-09 06:30:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2024-11-09 06:30:37,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 8 [2024-11-09 06:30:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:37,858 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2024-11-09 06:30:37,858 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-09 06:30:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2024-11-09 06:30:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:30:37,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:37,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:37,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:30:37,860 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-09 06:30:37,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1388127472, now seen corresponding path program 1 times [2024-11-09 06:30:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620339717] [2024-11-09 06:30:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:37,930 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-09 06:30:37,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620339717] [2024-11-09 06:30:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620339717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:37,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:30:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876525573] [2024-11-09 06:30:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:37,934 INFO L87 Difference]: Start difference. First operand 91 states and 97 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-09 06:30:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:38,062 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-09 06:30:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:30:38,065 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-09 06:30:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:38,066 INFO L225 Difference]: With dead ends: 94 [2024-11-09 06:30:38,066 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 06:30:38,067 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-09 06:30:38,071 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:38,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 121 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 06:30:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-09 06:30:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 43 states have (on average 2.13953488372093) internal successors, (92), 86 states have internal predecessors, (92), 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-09 06:30:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-11-09 06:30:38,087 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 8 [2024-11-09 06:30:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:38,087 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-11-09 06:30:38,088 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-09 06:30:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-11-09 06:30:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:30:38,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:38,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:30:38,092 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-09 06:30:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash 82283062, now seen corresponding path program 1 times [2024-11-09 06:30:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156269732] [2024-11-09 06:30:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:38,221 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-09 06:30:38,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:38,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156269732] [2024-11-09 06:30:38,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156269732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:38,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:38,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:30:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247601920] [2024-11-09 06:30:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:38,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:38,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:38,227 INFO L87 Difference]: Start difference. First operand 90 states and 96 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-09 06:30:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:38,353 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-09 06:30:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:30:38,354 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-09 06:30:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:38,355 INFO L225 Difference]: With dead ends: 93 [2024-11-09 06:30:38,355 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 06:30:38,355 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-09 06:30:38,357 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:38,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 06:30:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-09 06:30:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 43 states have (on average 2.116279069767442) internal successors, (91), 85 states have internal predecessors, (91), 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-09 06:30:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-09 06:30:38,372 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 9 [2024-11-09 06:30:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:38,377 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-09 06:30:38,377 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-09 06:30:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-09 06:30:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:30:38,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:38,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:38,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:30:38,378 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-09 06:30:38,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash 82283063, now seen corresponding path program 1 times [2024-11-09 06:30:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524707273] [2024-11-09 06:30:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:38,576 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-09 06:30:38,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524707273] [2024-11-09 06:30:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524707273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:30:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132273219] [2024-11-09 06:30:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:38,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:38,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:38,581 INFO L87 Difference]: Start difference. First operand 89 states and 95 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-09 06:30:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:38,695 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-09 06:30:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:30:38,696 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-09 06:30:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:38,697 INFO L225 Difference]: With dead ends: 92 [2024-11-09 06:30:38,697 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 06:30:38,697 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-09 06:30:38,703 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:38,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 127 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 06:30:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-09 06:30:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 84 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-09 06:30:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-11-09 06:30:38,717 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2024-11-09 06:30:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-11-09 06:30:38,717 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-09 06:30:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-11-09 06:30:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:30:38,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:38,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:30:38,719 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-09 06:30:38,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1744187949, now seen corresponding path program 1 times [2024-11-09 06:30:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877188283] [2024-11-09 06:30:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:39,000 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-09 06:30:39,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877188283] [2024-11-09 06:30:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877188283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:39,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:39,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:30:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146674629] [2024-11-09 06:30:39,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:39,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:39,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:39,003 INFO L87 Difference]: Start difference. First operand 88 states and 94 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-09 06:30:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:39,264 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-11-09 06:30:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:30:39,265 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-09 06:30:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:39,266 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:30:39,266 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:30:39,266 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-09 06:30:39,268 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:39,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 241 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:30:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-09 06:30:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 78 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-09 06:30:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-09 06:30:39,283 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 10 [2024-11-09 06:30:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-09 06:30:39,283 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-09 06:30:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-09 06:30:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:30:39,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:39,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:30:39,285 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-09 06:30:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1744187948, now seen corresponding path program 1 times [2024-11-09 06:30:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984267173] [2024-11-09 06:30:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:39,697 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-09 06:30:39,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984267173] [2024-11-09 06:30:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984267173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:39,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:39,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:30:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144577190] [2024-11-09 06:30:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:39,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:39,702 INFO L87 Difference]: Start difference. First operand 82 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-09 06:30:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:39,958 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-09 06:30:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:30:39,959 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-09 06:30:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:39,960 INFO L225 Difference]: With dead ends: 84 [2024-11-09 06:30:39,960 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 06:30:39,961 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-09 06:30:39,962 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:39,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 197 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 06:30:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-09 06:30:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 76 states have internal predecessors, (82), 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-09 06:30:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 06:30:39,968 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 10 [2024-11-09 06:30:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:39,968 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 06:30:39,969 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-09 06:30:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 06:30:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 06:30:39,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:39,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:39,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:30:39,971 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-09 06:30:39,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash -452409963, now seen corresponding path program 1 times [2024-11-09 06:30:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259235817] [2024-11-09 06:30:39,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:40,102 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-09 06:30:40,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:40,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259235817] [2024-11-09 06:30:40,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259235817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:40,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:40,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:30:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911404017] [2024-11-09 06:30:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:40,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:30:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:40,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:30:40,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:30:40,106 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.0) 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-09 06:30:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:40,327 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-09 06:30:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:30:40,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) 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-09 06:30:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:40,330 INFO L225 Difference]: With dead ends: 109 [2024-11-09 06:30:40,333 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 06:30:40,334 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-09 06:30:40,335 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:40,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 220 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 06:30:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2024-11-09 06:30:40,347 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-09 06:30:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2024-11-09 06:30:40,351 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 17 [2024-11-09 06:30:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:40,352 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2024-11-09 06:30:40,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) 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-09 06:30:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2024-11-09 06:30:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 06:30:40,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:40,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:40,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:30:40,353 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-09 06:30:40,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash -452409962, now seen corresponding path program 1 times [2024-11-09 06:30:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660721244] [2024-11-09 06:30:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:40,704 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-09 06:30:40,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660721244] [2024-11-09 06:30:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660721244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:30:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865310413] [2024-11-09 06:30:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:30:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:40,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:30:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:30:40,710 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 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-09 06:30:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:40,965 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2024-11-09 06:30:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:30:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 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-09 06:30:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:40,967 INFO L225 Difference]: With dead ends: 111 [2024-11-09 06:30:40,967 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 06:30:40,968 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-09 06:30:40,969 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:40,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 370 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 06:30:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2024-11-09 06:30:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 97 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-09 06:30:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2024-11-09 06:30:40,983 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 17 [2024-11-09 06:30:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2024-11-09 06:30:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 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-09 06:30:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2024-11-09 06:30:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:30:40,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:40,989 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-09 06:30:40,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:30:40,989 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-09 06:30:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1139194147, now seen corresponding path program 1 times [2024-11-09 06:30:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324416533] [2024-11-09 06:30:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:41,142 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-09 06:30:41,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:41,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324416533] [2024-11-09 06:30:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324416533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:41,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:41,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:30:41,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230932236] [2024-11-09 06:30:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:41,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:41,145 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-09 06:30:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:41,257 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2024-11-09 06:30:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:41,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-09 06:30:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:41,260 INFO L225 Difference]: With dead ends: 114 [2024-11-09 06:30:41,260 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 06:30:41,260 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-09 06:30:41,261 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 28 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:41,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 369 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 06:30:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2024-11-09 06:30:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.826086956521739) internal successors, (126), 101 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:30:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2024-11-09 06:30:41,270 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 18 [2024-11-09 06:30:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:41,270 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2024-11-09 06:30:41,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-09 06:30:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2024-11-09 06:30:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:30:41,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:41,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:41,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:30:41,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-09 06:30:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash 384682109, now seen corresponding path program 1 times [2024-11-09 06:30:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099506050] [2024-11-09 06:30:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:41,491 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-09 06:30:41,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:41,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099506050] [2024-11-09 06:30:41,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099506050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:41,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:41,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:30:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296486523] [2024-11-09 06:30:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:41,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:41,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:41,494 INFO L87 Difference]: Start difference. First operand 106 states and 132 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-09 06:30:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:41,720 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2024-11-09 06:30:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:30:41,721 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-09 06:30:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:41,722 INFO L225 Difference]: With dead ends: 106 [2024-11-09 06:30:41,722 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 06:30:41,723 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-09 06:30:41,723 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:41,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 163 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 06:30:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 06:30:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 101 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-09 06:30:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2024-11-09 06:30:41,728 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 19 [2024-11-09 06:30:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:41,729 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2024-11-09 06:30:41,729 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-09 06:30:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2024-11-09 06:30:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:30:41,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:41,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:41,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:30:41,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-09 06:30:41,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 384682110, now seen corresponding path program 1 times [2024-11-09 06:30:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977262925] [2024-11-09 06:30:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:41,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:42,102 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-09 06:30:42,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:42,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977262925] [2024-11-09 06:30:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977262925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:42,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645872779] [2024-11-09 06:30:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:42,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:42,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:42,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:42,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:30:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:42,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 06:30:42,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:42,497 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-09 06:30:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:30:42,572 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-09 06:30:42,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:30:42,589 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-09 06:30:42,622 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-09 06:30:42,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:30:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645872779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:30:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-09 06:30:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115431391] [2024-11-09 06:30:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-09 06:30:42,624 INFO L87 Difference]: Start difference. First operand 106 states and 131 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-09 06:30:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:42,899 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-09 06:30:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:42,900 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-09 06:30:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:42,901 INFO L225 Difference]: With dead ends: 112 [2024-11-09 06:30:42,901 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 06:30:42,902 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-09 06:30:42,902 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:42,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 169 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 120 Unchecked, 0.3s Time] [2024-11-09 06:30:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 06:30:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2024-11-09 06:30:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 101 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-09 06:30:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2024-11-09 06:30:42,907 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 19 [2024-11-09 06:30:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:42,908 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2024-11-09 06:30:42,908 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-09 06:30:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2024-11-09 06:30:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:30:42,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:42,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:42,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:30:43,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:30:43,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-09 06:30:43,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash -974273239, now seen corresponding path program 1 times [2024-11-09 06:30:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261949926] [2024-11-09 06:30:43,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:43,219 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-09 06:30:43,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261949926] [2024-11-09 06:30:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261949926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:30:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438929038] [2024-11-09 06:30:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:43,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:30:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:43,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:30:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:30:43,221 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-09 06:30:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:43,357 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2024-11-09 06:30:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:30:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 19 [2024-11-09 06:30:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:43,361 INFO L225 Difference]: With dead ends: 113 [2024-11-09 06:30:43,361 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 06:30:43,361 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-09 06:30:43,362 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:43,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 06:30:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 06:30:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 107 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:30:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2024-11-09 06:30:43,368 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 19 [2024-11-09 06:30:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2024-11-09 06:30:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-09 06:30:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2024-11-09 06:30:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:30:43,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:43,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:43,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:30:43,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-09 06:30:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -974273238, now seen corresponding path program 1 times [2024-11-09 06:30:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980938007] [2024-11-09 06:30:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:43,635 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-09 06:30:43,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980938007] [2024-11-09 06:30:43,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980938007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:43,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:30:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987563494] [2024-11-09 06:30:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:30:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:30:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:30:43,640 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-09 06:30:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:43,886 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2024-11-09 06:30:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:30:43,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2024-11-09 06:30:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:43,888 INFO L225 Difference]: With dead ends: 112 [2024-11-09 06:30:43,888 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 06:30:43,890 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-09 06:30:43,891 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 22 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:43,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 377 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 06:30:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 06:30:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 107 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:30:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2024-11-09 06:30:43,897 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 19 [2024-11-09 06:30:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2024-11-09 06:30:43,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-09 06:30:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2024-11-09 06:30:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:30:43,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:43,900 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-09 06:30:43,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:30:43,901 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-09 06:30:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 312442688, now seen corresponding path program 1 times [2024-11-09 06:30:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170643332] [2024-11-09 06:30:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:44,194 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-09 06:30:44,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:44,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170643332] [2024-11-09 06:30:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170643332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:44,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:44,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:30:44,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468172672] [2024-11-09 06:30:44,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:44,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:44,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:44,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:44,199 INFO L87 Difference]: Start difference. First operand 112 states and 134 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-09 06:30:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:44,455 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2024-11-09 06:30:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:44,456 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-09 06:30:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:44,457 INFO L225 Difference]: With dead ends: 111 [2024-11-09 06:30:44,457 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 06:30:44,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:30:44,459 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:44,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 258 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 06:30:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 06:30:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.68) internal successors, (126), 106 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:30:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2024-11-09 06:30:44,468 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 21 [2024-11-09 06:30:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:44,469 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2024-11-09 06:30:44,469 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-09 06:30:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2024-11-09 06:30:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:30:44,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:44,472 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-09 06:30:44,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:30:44,473 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-09 06:30:44,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 312442689, now seen corresponding path program 1 times [2024-11-09 06:30:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468178234] [2024-11-09 06:30:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:44,917 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-09 06:30:44,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468178234] [2024-11-09 06:30:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468178234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:30:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643635980] [2024-11-09 06:30:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:44,920 INFO L87 Difference]: Start difference. First operand 111 states and 132 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-09 06:30:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:45,174 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2024-11-09 06:30:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:45,175 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-09 06:30:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:45,176 INFO L225 Difference]: With dead ends: 110 [2024-11-09 06:30:45,176 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 06:30:45,176 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-09 06:30:45,177 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:45,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 06:30:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 06:30:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 105 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-09 06:30:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-11-09 06:30:45,182 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 21 [2024-11-09 06:30:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-11-09 06:30:45,183 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-09 06:30:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-11-09 06:30:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:30:45,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:45,184 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-09 06:30:45,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:30:45,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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-09 06:30:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash -390168738, now seen corresponding path program 1 times [2024-11-09 06:30:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836981065] [2024-11-09 06:30:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:45,573 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-09 06:30:45,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836981065] [2024-11-09 06:30:45,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836981065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:45,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:30:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584780579] [2024-11-09 06:30:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:45,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:30:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:30:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:30:45,576 INFO L87 Difference]: Start difference. First operand 110 states and 130 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-09 06:30:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:46,055 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2024-11-09 06:30:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:30:46,055 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-09 06:30:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:46,057 INFO L225 Difference]: With dead ends: 111 [2024-11-09 06:30:46,057 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 06:30:46,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:30:46,058 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:46,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 392 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:30:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 06:30:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 06:30:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.64) internal successors, (123), 105 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-09 06:30:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2024-11-09 06:30:46,063 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 23 [2024-11-09 06:30:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:46,064 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2024-11-09 06:30:46,064 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-09 06:30:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2024-11-09 06:30:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:30:46,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:46,065 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-09 06:30:46,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:30:46,066 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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-09 06:30:46,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash -390168737, now seen corresponding path program 1 times [2024-11-09 06:30:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194079216] [2024-11-09 06:30:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:46,748 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-09 06:30:46,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194079216] [2024-11-09 06:30:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194079216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:46,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:30:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373441219] [2024-11-09 06:30:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:46,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:30:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:30:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:30:46,752 INFO L87 Difference]: Start difference. First operand 110 states and 129 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-09 06:30:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:47,218 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2024-11-09 06:30:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:30:47,219 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-09 06:30:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:47,220 INFO L225 Difference]: With dead ends: 110 [2024-11-09 06:30:47,220 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 06:30:47,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:30:47,221 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 17 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:47,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 374 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:30:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 06:30:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 06:30:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 105 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-09 06:30:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2024-11-09 06:30:47,226 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 23 [2024-11-09 06:30:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:47,227 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2024-11-09 06:30:47,227 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-09 06:30:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2024-11-09 06:30:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:30:47,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:47,228 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-09 06:30:47,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:30:47,229 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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-09 06:30:47,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash -439577069, now seen corresponding path program 1 times [2024-11-09 06:30:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632142506] [2024-11-09 06:30:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:47,355 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-09 06:30:47,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632142506] [2024-11-09 06:30:47,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632142506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:47,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:47,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:30:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508804671] [2024-11-09 06:30:47,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:47,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:30:47,358 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:30:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:47,612 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2024-11-09 06:30:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:47,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 06:30:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:47,614 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:30:47,614 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 06:30:47,614 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-09 06:30:47,615 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:47,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 06:30:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2024-11-09 06:30:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 117 states have internal predecessors, (146), 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-09 06:30:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2024-11-09 06:30:47,621 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 23 [2024-11-09 06:30:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:47,621 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2024-11-09 06:30:47,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:30:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2024-11-09 06:30:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:30:47,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:47,623 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-09 06:30:47,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:30:47,623 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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-09 06:30:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash -439577068, now seen corresponding path program 1 times [2024-11-09 06:30:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:47,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963697600] [2024-11-09 06:30:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:47,937 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-09 06:30:47,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963697600] [2024-11-09 06:30:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963697600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565647400] [2024-11-09 06:30:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:47,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:47,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:30:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:48,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:30:48,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:48,334 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-09 06:30:48,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:30:48,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:30:48,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 06:30:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:30:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565647400] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:30:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 19 [2024-11-09 06:30:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731590968] [2024-11-09 06:30:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:30:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:30:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:30:48,675 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:30:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:49,032 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2024-11-09 06:30:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:49,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 06:30:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:49,034 INFO L225 Difference]: With dead ends: 136 [2024-11-09 06:30:49,034 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 06:30:49,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:30:49,035 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:49,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 214 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:30:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 06:30:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2024-11-09 06:30:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 120 states have internal predecessors, (150), 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-09 06:30:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2024-11-09 06:30:49,041 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 23 [2024-11-09 06:30:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:49,042 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2024-11-09 06:30:49,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:30:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2024-11-09 06:30:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:30:49,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:49,043 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-09 06:30:49,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:30:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 06:30:49,247 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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-09 06:30:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -741987177, now seen corresponding path program 1 times [2024-11-09 06:30:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783421801] [2024-11-09 06:30:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:49,525 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-09 06:30:49,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:49,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783421801] [2024-11-09 06:30:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783421801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:49,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:49,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:30:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635097454] [2024-11-09 06:30:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:30:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:30:49,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:30:49,530 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-09 06:30:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:49,839 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2024-11-09 06:30:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-09 06:30:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:49,841 INFO L225 Difference]: With dead ends: 148 [2024-11-09 06:30:49,841 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 06:30:49,841 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-09 06:30:49,842 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 38 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:49,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 264 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:30:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 06:30:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2024-11-09 06:30:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.641304347826087) internal successors, (151), 121 states have internal predecessors, (151), 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-09 06:30:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2024-11-09 06:30:49,849 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 24 [2024-11-09 06:30:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:49,850 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2024-11-09 06:30:49,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-09 06:30:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2024-11-09 06:30:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:30:49,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:49,852 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] [2024-11-09 06:30:49,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:30:49,852 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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-09 06:30:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -760980301, now seen corresponding path program 1 times [2024-11-09 06:30:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590787530] [2024-11-09 06:30:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:30:50,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590787530] [2024-11-09 06:30:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590787530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099171293] [2024-11-09 06:30:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:50,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:50,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:50,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:30:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:51,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 06:30:51,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:51,085 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-09 06:30:51,120 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-09 06:30:51,129 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-09 06:30:51,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 06:30:51,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 06:30:51,337 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:30:51,337 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-09 06:30:51,444 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:30:51,445 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-09 06:30:51,458 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 27 treesize of output 20 [2024-11-09 06:30:51,474 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 18 treesize of output 13 [2024-11-09 06:30:51,559 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 18 treesize of output 13 [2024-11-09 06:30:51,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 06:30:51,597 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 25 treesize of output 13 [2024-11-09 06:30:51,649 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 34 treesize of output 25 [2024-11-09 06:30:51,681 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 38 treesize of output 25 [2024-11-09 06:30:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 06:30:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:30:51,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:30:52,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) (and (forall ((v_ArrVal_1050 Int) (v_ArrVal_1047 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_1047))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_1050) .cse1 |c_ULTIMATE.start_create_~data2~0#1.base|))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_create_~data1~0#1.offset| Int) (|ULTIMATE.start_create_~data2~0#1.offset| Int) (v_ArrVal_1046 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_1046))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data1~0#1.offset|) .cse1 |ULTIMATE.start_create_~data2~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 0)))) is different from false [2024-11-09 06:30:53,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:30:53,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-09 06:30:53,317 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 140 treesize of output 122 [2024-11-09 06:30:53,330 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 17 treesize of output 13 [2024-11-09 06:30:53,336 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 20 [2024-11-09 06:30:53,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:30:53,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-09 06:30:53,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:30:53,421 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 80 treesize of output 62 [2024-11-09 06:30:53,429 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 46 treesize of output 38 [2024-11-09 06:30:53,435 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-09 06:30:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:30:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099171293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:30:55,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1184557005] [2024-11-09 06:30:55,603 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 06:30:55,603 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:30:55,608 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:30:55,614 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:30:55,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:31:00,996 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-09 06:31:01,016 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:31:18,720 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5264#(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|)) (= |ULTIMATE.start_loop_~l#1.offset| 0) (exists ((|v_ULTIMATE.start_loop_~node~0#1.base_26| Int)) (and (or (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0)) (not (= |v_ULTIMATE.start_loop_~node~0#1.base_26| 0))) (not (= (select |#valid| |v_ULTIMATE.start_loop_~node~0#1.base_26|) 1)))))' at error location [2024-11-09 06:31:18,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:31:18,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:31:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 30 [2024-11-09 06:31:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925185327] [2024-11-09 06:31:18,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:31:18,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 06:31:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 06:31:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1855, Unknown=13, NotChecked=88, Total=2162 [2024-11-09 06:31:18,724 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand has 30 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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-09 06:31:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:20,999 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2024-11-09 06:31:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:31:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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 24 [2024-11-09 06:31:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:21,000 INFO L225 Difference]: With dead ends: 122 [2024-11-09 06:31:21,000 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 06:31:21,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=282, Invalid=2465, Unknown=13, NotChecked=102, Total=2862 [2024-11-09 06:31:21,002 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:21,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1004 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 804 Invalid, 0 Unknown, 42 Unchecked, 1.5s Time] [2024-11-09 06:31:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 06:31:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 06:31:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.625) internal successors, (143), 117 states have internal predecessors, (143), 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-09 06:31:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-09 06:31:21,007 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 24 [2024-11-09 06:31:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:21,008 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-09 06:31:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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-09 06:31:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-09 06:31:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:31:21,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:21,009 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-09 06:31:21,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:31:21,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 06:31:21,213 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 06:31:21,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1289902648, now seen corresponding path program 1 times [2024-11-09 06:31:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005511088] [2024-11-09 06:31:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:21,890 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-09 06:31:21,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:21,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005511088] [2024-11-09 06:31:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005511088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507866271] [2024-11-09 06:31:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:21,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:21,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:21,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:21,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:31:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:22,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 06:31:22,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:22,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:31:22,192 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-09 06:31:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:31:22,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:31:22,323 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-09 06:31:22,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:31:22,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 06:31:22,441 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-09 06:31:22,445 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-09 06:31:22,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507866271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 19 [2024-11-09 06:31:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92749952] [2024-11-09 06:31:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:31:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:31:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:31:22,448 INFO L87 Difference]: Start difference. First operand 122 states and 149 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-09 06:31:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:22,925 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2024-11-09 06:31:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:31:22,926 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-09 06:31:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:22,927 INFO L225 Difference]: With dead ends: 123 [2024-11-09 06:31:22,927 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 06:31:22,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-11-09 06:31:22,928 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:22,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 452 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:31:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 06:31:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-09 06:31:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 117 states have internal predecessors, (142), 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-09 06:31:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2024-11-09 06:31:22,933 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 25 [2024-11-09 06:31:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:22,933 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2024-11-09 06:31:22,934 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-09 06:31:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2024-11-09 06:31:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:31:22,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:22,935 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-09 06:31:22,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:31:23,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 06:31:23,139 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 06:31:23,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1289902647, now seen corresponding path program 1 times [2024-11-09 06:31:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:23,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007978843] [2024-11-09 06:31:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:23,878 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-09 06:31:23,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007978843] [2024-11-09 06:31:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007978843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:23,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:23,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:31:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135495317] [2024-11-09 06:31:23,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:23,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:31:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:23,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:31:23,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:31:23,881 INFO L87 Difference]: Start difference. First operand 122 states and 148 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-09 06:31:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:24,687 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2024-11-09 06:31:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:31:24,687 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-09 06:31:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:24,688 INFO L225 Difference]: With dead ends: 122 [2024-11-09 06:31:24,689 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 06:31:24,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:31:24,690 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:24,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 407 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:31:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 06:31:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 06:31:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 117 states have internal predecessors, (141), 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-09 06:31:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-11-09 06:31:24,698 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 25 [2024-11-09 06:31:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:24,699 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-11-09 06:31:24,699 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-09 06:31:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2024-11-09 06:31:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:31:24,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:24,699 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-09 06:31:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:31:24,700 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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-09 06:31:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1526765869, now seen corresponding path program 1 times [2024-11-09 06:31:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387695974] [2024-11-09 06:31:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:24,982 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-09 06:31:24,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387695974] [2024-11-09 06:31:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387695974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:31:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959903774] [2024-11-09 06:31:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:31:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:31:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:31:24,985 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-09 06:31:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:25,521 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2024-11-09 06:31:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:31:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-09 06:31:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:25,522 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:31:25,522 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:31:25,524 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-09 06:31:25,524 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 33 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:25,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 215 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:31:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:31:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2024-11-09 06:31:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.595505617977528) internal successors, (142), 118 states have internal predecessors, (142), 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-09 06:31:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2024-11-09 06:31:25,533 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 25 [2024-11-09 06:31:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2024-11-09 06:31:25,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-09 06:31:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2024-11-09 06:31:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:31:25,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:25,535 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-09 06:31:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:31:25,535 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 06:31:25,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1526147176, now seen corresponding path program 1 times [2024-11-09 06:31:25,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:25,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710216229] [2024-11-09 06:31:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:25,702 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-09 06:31:25,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:25,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710216229] [2024-11-09 06:31:25,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710216229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:25,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:25,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:31:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115513281] [2024-11-09 06:31:25,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:25,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:31:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:25,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:31:25,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:31:25,705 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-09 06:31:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:25,951 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2024-11-09 06:31:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:31:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-09 06:31:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:25,953 INFO L225 Difference]: With dead ends: 127 [2024-11-09 06:31:25,954 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 06:31:25,954 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-09 06:31:25,955 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:25,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 311 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:31:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 06:31:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2024-11-09 06:31:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 117 states have internal predecessors, (135), 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-09 06:31:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2024-11-09 06:31:25,960 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 25 [2024-11-09 06:31:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:25,960 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2024-11-09 06:31:25,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-09 06:31:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2024-11-09 06:31:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:31:25,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:25,962 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-09 06:31:25,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:31:25,962 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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-09 06:31:25,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash -85101543, now seen corresponding path program 1 times [2024-11-09 06:31:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441206159] [2024-11-09 06:31:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:26,355 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-09 06:31:26,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441206159] [2024-11-09 06:31:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441206159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:26,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:31:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252475828] [2024-11-09 06:31:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:26,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:31:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:31:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:31:26,358 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-09 06:31:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:26,793 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2024-11-09 06:31:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:31:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-09 06:31:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:26,795 INFO L225 Difference]: With dead ends: 123 [2024-11-09 06:31:26,795 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 06:31:26,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:31:26,796 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 17 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 235 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:26,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 235 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:31:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 06:31:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 06:31:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 118 states have internal predecessors, (136), 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-09 06:31:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2024-11-09 06:31:26,800 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 26 [2024-11-09 06:31:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:26,801 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2024-11-09 06:31:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-09 06:31:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2024-11-09 06:31:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 06:31:26,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:26,802 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-09 06:31:26,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 06:31:26,803 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-09 06:31:26,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1656819606, now seen corresponding path program 1 times [2024-11-09 06:31:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30192367] [2024-11-09 06:31:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:27,318 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-09 06:31:27,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30192367] [2024-11-09 06:31:27,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30192367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:27,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:31:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839507930] [2024-11-09 06:31:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:31:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:31:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:31:27,320 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 11 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-09 06:31:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:27,971 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2024-11-09 06:31:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:31:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 11 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-09 06:31:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:27,972 INFO L225 Difference]: With dead ends: 130 [2024-11-09 06:31:27,972 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 06:31:27,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:31:27,973 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:27,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 357 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:31:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 06:31:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2024-11-09 06:31:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 119 states have internal predecessors, (138), 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-09 06:31:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2024-11-09 06:31:27,977 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 27 [2024-11-09 06:31:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:27,977 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2024-11-09 06:31:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 11 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-09 06:31:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2024-11-09 06:31:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 06:31:27,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:27,978 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-09 06:31:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 06:31:27,978 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 06:31:27,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1656819607, now seen corresponding path program 1 times [2024-11-09 06:31:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448172761] [2024-11-09 06:31:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:28,255 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-09 06:31:28,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448172761] [2024-11-09 06:31:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448172761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:28,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542590217] [2024-11-09 06:31:28,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:28,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:28,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:28,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:28,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:31:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:28,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:31:28,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:28,658 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-09 06:31:28,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542590217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-11-09 06:31:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071966317] [2024-11-09 06:31:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:28,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:31:28,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:31:28,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:31:28,660 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-09 06:31:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:29,061 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2024-11-09 06:31:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:31:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-09 06:31:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:29,063 INFO L225 Difference]: With dead ends: 136 [2024-11-09 06:31:29,063 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 06:31:29,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:31:29,064 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 41 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:29,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 198 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:31:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 06:31:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2024-11-09 06:31:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.53125) internal successors, (147), 125 states have internal predecessors, (147), 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-09 06:31:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2024-11-09 06:31:29,068 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 27 [2024-11-09 06:31:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:29,069 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2024-11-09 06:31:29,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-09 06:31:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2024-11-09 06:31:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:31:29,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:29,070 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-09 06:31:29,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:31:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:29,275 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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-09 06:31:29,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -178199683, now seen corresponding path program 1 times [2024-11-09 06:31:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464013500] [2024-11-09 06:31:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:29,820 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-09 06:31:29,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464013500] [2024-11-09 06:31:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464013500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:31:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846684542] [2024-11-09 06:31:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:31:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:31:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:31:29,823 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 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-09 06:31:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:30,315 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2024-11-09 06:31:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:31:30,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 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-09 06:31:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:30,317 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:31:30,317 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:31:30,317 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-09 06:31:30,318 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:30,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 478 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:31:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:31:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-09 06:31:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 126 states have internal predecessors, (147), 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-09 06:31:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2024-11-09 06:31:30,322 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 28 [2024-11-09 06:31:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:30,322 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2024-11-09 06:31:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 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-09 06:31:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2024-11-09 06:31:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:31:30,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:30,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:31:30,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 06:31:30,324 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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-09 06:31:30,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1229222730, now seen corresponding path program 1 times [2024-11-09 06:31:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:30,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230305637] [2024-11-09 06:31:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:30,747 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-09 06:31:30,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230305637] [2024-11-09 06:31:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230305637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:30,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:31:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015850805] [2024-11-09 06:31:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:30,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:31:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:30,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:31:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:31:30,750 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:31:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:31,167 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2024-11-09 06:31:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:31:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 06:31:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:31,168 INFO L225 Difference]: With dead ends: 132 [2024-11-09 06:31:31,169 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 06:31:31,169 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-09 06:31:31,169 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:31,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 385 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:31:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 06:31:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-11-09 06:31:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 126 states have internal predecessors, (146), 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-09 06:31:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-11-09 06:31:31,174 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 29 [2024-11-09 06:31:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:31,174 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-11-09 06:31:31,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:31:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-11-09 06:31:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:31:31,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:31,175 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-09 06:31:31,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 06:31:31,176 INFO L396 AbstractCegarLoop]: === Iteration 33 === 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-09 06:31:31,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash 548801183, now seen corresponding path program 1 times [2024-11-09 06:31:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669586011] [2024-11-09 06:31:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:31,948 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-09 06:31:31,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669586011] [2024-11-09 06:31:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669586011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 06:31:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408394068] [2024-11-09 06:31:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:31,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:31:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:31:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:31:31,951 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 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-09 06:31:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:32,608 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2024-11-09 06:31:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:31:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 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-09 06:31:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:32,610 INFO L225 Difference]: With dead ends: 131 [2024-11-09 06:31:32,610 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 06:31:32,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-09 06:31:32,612 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 30 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:32,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 430 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:31:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 06:31:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-09 06:31:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 126 states have internal predecessors, (145), 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-09 06:31:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2024-11-09 06:31:32,620 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 30 [2024-11-09 06:31:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:32,621 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2024-11-09 06:31:32,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 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-09 06:31:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2024-11-09 06:31:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:31:32,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:32,622 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-09 06:31:32,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 06:31:32,623 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-09 06:31:32,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1463982469, now seen corresponding path program 1 times [2024-11-09 06:31:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:32,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642972054] [2024-11-09 06:31:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:32,989 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-09 06:31:32,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642972054] [2024-11-09 06:31:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642972054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032978] [2024-11-09 06:31:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:32,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:32,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:32,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:32,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:31:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:33,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:31:33,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:33,479 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-09 06:31:33,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:33,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:31:33,647 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-09 06:31:33,846 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-09 06:31:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:31:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910149437] [2024-11-09 06:31:33,849 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 06:31:33,849 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:31:33,849 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:31:33,850 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:31:33,850 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:31:51,795 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-09 06:31:51,823 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:33:24,784 WARN L286 SmtUtils]: Spent 46.72s on a formula simplification. DAG size of input: 382 DAG size of output: 372 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:33:26,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse34 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (or (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) (exists ((|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse5 (select (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (let ((.cse0 (not (= .cse5 0))) (.cse1 (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (.cse2 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse4 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse6 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse9 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse10 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse11 (exists ((|v_#length_105| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_105| |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|)))) (.cse12 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse13 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse8 (select (select |v_#memory_int_111| .cse5) 16)) (.cse18 (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)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| .cse5 (store (store (select |v_#memory_$Pointer$.base_130| .cse5) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse6 (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_int_110| .cse5))) (and (= (store |v_#memory_int_110| .cse5 (store .cse7 16 .cse8)) |v_#memory_int_111|) (= (store |v_#memory_int_109| .cse5 (store (select |v_#memory_int_109| .cse5) 8 (select .cse7 8))) |v_#memory_int_110|)))) .cse9 (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| .cse5) 0) (= |c_#valid| (store |v_#valid_131| .cse5 1)))) .cse10 .cse11 .cse12 .cse13 (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_130| (let ((.cse14 (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse14 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse14 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= (store |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_131|))) (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| .cse5 32) |c_#length|)) (exists ((|v_#valid_127| (Array Int Int))) (let ((.cse16 (store |v_#valid_127| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse15 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select (store .cse15 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse16 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select |v_#valid_127| |c_ULTIMATE.start_create_~dll~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_134|) (= (let ((.cse17 (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 .cse17 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse17 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_133|))) .cse18 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (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_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_13| (Array Int (Array Int Int)))) (let ((.cse21 (select |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse20 (select (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse19 (select (select |v_#memory_int_105| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse22 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse19 2147483648)) (<= 0 (+ .cse20 2147483648)) (= |v_#memory_int_104| (store |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse20))) (= (store |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse21 8))) |v_#memory_int_102|) (= (store |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse21 16 (select (select |v_#memory_int_103| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_103|) (<= .cse20 2147483647) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse22 24 (select (select |v_#memory_int_BEFORE_CALL_13| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_13|) (<= .cse19 2147483647) (= (store |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse19)) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse22 0))) |v_#memory_int_106|)))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_127| .cse5 (store (store (select |v_#memory_$Pointer$.offset_127| .cse5) 8 0) 16 0)) |v_#memory_$Pointer$.offset_135|))) (and .cse0 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (let ((.cse23 (store |v_#memory_$Pointer$.base_130| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse23 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse23 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_133|) (= (store |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_134|))) .cse1 (exists ((|v_#length_108| (Array Int Int))) (= |c_#length| (store |v_#length_108| .cse5 32))) .cse2 (exists ((|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_136| .cse5 (store (store (select |v_#memory_$Pointer$.base_136| .cse5) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse3 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (and (= (let ((.cse24 (store |v_#memory_$Pointer$.offset_127| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |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_130| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_130|) (= (store |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_131|))) .cse4 .cse6 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (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_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse26 (select (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse25 (select (select |v_#memory_int_105| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse27 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse25 2147483648)) (<= 0 (+ .cse26 2147483648)) (= |v_#memory_int_104| (store |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse26))) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse27 24 (select (select |v_#memory_int_BEFORE_CALL_11| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_11|) (= (store |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse28 8))) |v_#memory_int_102|) (= (store |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse28 16 (select (select |v_#memory_int_103| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_103|) (<= .cse26 2147483647) (<= .cse25 2147483647) (= (store |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse25)) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse27 0))) |v_#memory_int_106|)))) .cse9 .cse10 (exists ((|v_#valid_130| (Array Int Int))) (let ((.cse29 (store |v_#valid_130| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse30 (store .cse29 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse29 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse30 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_130| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse30 |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))) .cse11 .cse12 .cse13 (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_135| (store |v_#memory_$Pointer$.offset_133| .cse5 (store (store (select |v_#memory_$Pointer$.offset_133| .cse5) 8 0) 16 0)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_int_108| .cse5))) (and (= (store |v_#memory_int_108| .cse5 (store .cse31 16 .cse8)) |v_#memory_int_111|) (= (store |v_#memory_int_107| .cse5 (store (select |v_#memory_int_107| .cse5) 8 (select .cse31 8))) |v_#memory_int_108|)))) .cse18 (exists ((|v_#valid_127| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_127| .cse5 1)) (= (select |v_#valid_127| .cse5) 0)))))) (<= 24 (select |c_#length| .cse5)) (= (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse5)) |v_#memory_$Pointer$.base_139|) (= (select |c_#valid| .cse5) 1) (= |v_#memory_int_112| (store |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_112| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_139| .cse5 (store (select |v_#memory_$Pointer$.base_139| .cse5) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_112| .cse5 (store (select |v_#memory_int_112| .cse5) 16 (select (select |c_#memory_int| .cse5) 16))) |c_#memory_int|) (= (let ((.cse32 (store |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse32 .cse5 (store (select .cse32 .cse5) 16 0))) |c_#memory_$Pointer$.offset|)))) (<= 16 .cse33) (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse35 (select (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34))) (and (= (store |v_#memory_$Pointer$.base_146| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_146| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34 .cse35)) |v_#memory_$Pointer$.base_147|) (<= 24 (select |c_#length| .cse35)) (= (store |v_#memory_int_120| .cse35 (store (select |v_#memory_int_120| .cse35) 16 (select (select |c_#memory_int| .cse35) 16))) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (let ((.cse36 (store |v_#memory_$Pointer$.offset_143| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_143| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34 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_int_119| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_119| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34 (select (select |v_#memory_int_120| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34))) |v_#memory_int_120|) (= (store |v_#memory_$Pointer$.base_147| .cse35 (store (select |v_#memory_$Pointer$.base_147| .cse35) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |c_#memory_$Pointer$.base|))))) (<= 0 .cse34) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1) (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse33) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34) |c_ULTIMATE.start_create_#t~mem12#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse34) |c_ULTIMATE.start_create_#t~mem12#1.base|))) is different from false [2024-11-09 06:33:28,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse48 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.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)) (.cse35 (<= 16 .cse48)) (.cse36 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse23 (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_130| (let ((.cse64 (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_134| |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_130| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= (store |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_131|)))) (.cse24 (exists ((|v_#valid_127| (Array Int Int))) (let ((.cse63 (store |v_#valid_127| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse62 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select (store .cse62 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse63 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select |v_#valid_127| |c_ULTIMATE.start_create_~dll~0#1.base|) 0)))))) (.cse25 (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_134|) (= (let ((.cse61 (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 .cse61 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse61 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_133|)))) (.cse27 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (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_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_13| (Array Int (Array Int Int)))) (let ((.cse59 (select |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse58 (select (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse57 (select (select |v_#memory_int_105| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse60 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse57 2147483648)) (<= 0 (+ .cse58 2147483648)) (= |v_#memory_int_104| (store |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse58))) (= (store |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse59 8))) |v_#memory_int_102|) (= (store |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse59 16 (select (select |v_#memory_int_103| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_103|) (<= .cse58 2147483647) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse60 24 (select (select |v_#memory_int_BEFORE_CALL_13| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_13|) (<= .cse57 2147483647) (= (store |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse57)) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse60 0))) |v_#memory_int_106|))))) (.cse28 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (let ((.cse56 (store |v_#memory_$Pointer$.base_130| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |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_133| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_133|) (= (store |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_134|)))) (.cse11 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse29 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (and (= (let ((.cse55 (store |v_#memory_$Pointer$.offset_127| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |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_130| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_130|) (= (store |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_131|)))) (.cse13 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse15 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse30 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (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_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse54 (select |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse52 (select (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse51 (select (select |v_#memory_int_105| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse53 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse51 2147483648)) (<= 0 (+ .cse52 2147483648)) (= |v_#memory_int_104| (store |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse52))) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse53 24 (select (select |v_#memory_int_BEFORE_CALL_11| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_11|) (= (store |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse54 8))) |v_#memory_int_102|) (= (store |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse54 16 (select (select |v_#memory_int_103| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_103|) (<= .cse52 2147483647) (<= .cse51 2147483647) (= (store |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse51)) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse53 0))) |v_#memory_int_106|))))) (.cse18 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse19 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse31 (exists ((|v_#valid_130| (Array Int Int))) (let ((.cse49 (store |v_#valid_130| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse50 (store .cse49 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse49 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse50 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_130| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse50 |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))))) (.cse20 (exists ((|v_#length_105| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_105| |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|)))) (.cse21 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse22 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse26 (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))))) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse14 (select (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse7 (let ((.cse34 (store |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse34 .cse14 (store (select .cse34 .cse14) 16 0)))) (.cse33 (store |v_#memory_$Pointer$.base_139| .cse14 (store (select |v_#memory_$Pointer$.base_139| .cse14) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse8 (select (select .cse33 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= 0 .cse6) (= |c_#memory_$Pointer$.offset| (store .cse7 .cse8 (store (select .cse7 .cse8) .cse6 0))) (<= (+ .cse6 8) (select |c_#length| .cse8)) (let ((.cse9 (not (= .cse14 0))) (.cse10 (<= (+ .cse14 1) |c_#StackHeapBarrier|)) (.cse17 (select (select |v_#memory_int_111| .cse14) 16))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| .cse14 (store (store (select |v_#memory_$Pointer$.base_130| .cse14) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse15 (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_int_110| .cse14))) (and (= (store |v_#memory_int_110| .cse14 (store .cse16 16 .cse17)) |v_#memory_int_111|) (= (store |v_#memory_int_109| .cse14 (store (select |v_#memory_int_109| .cse14) 8 (select .cse16 8))) |v_#memory_int_110|)))) .cse18 (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| .cse14) 0) (= |c_#valid| (store |v_#valid_131| .cse14 1)))) .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| .cse14 32) |c_#length|)) .cse24 .cse25 .cse26 .cse27 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_127| .cse14 (store (store (select |v_#memory_$Pointer$.offset_127| .cse14) 8 0) 16 0)) |v_#memory_$Pointer$.offset_135|))) (and .cse9 .cse28 .cse10 (exists ((|v_#length_108| (Array Int Int))) (= |c_#length| (store |v_#length_108| .cse14 32))) .cse11 (exists ((|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_136| .cse14 (store (store (select |v_#memory_$Pointer$.base_136| .cse14) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse12 .cse29 .cse13 .cse15 .cse30 .cse18 .cse19 .cse31 .cse20 .cse21 .cse22 (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_135| (store |v_#memory_$Pointer$.offset_133| .cse14 (store (store (select |v_#memory_$Pointer$.offset_133| .cse14) 8 0) 16 0)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_int_108| .cse14))) (and (= (store |v_#memory_int_108| .cse14 (store .cse32 16 .cse17)) |v_#memory_int_111|) (= (store |v_#memory_int_107| .cse14 (store (select |v_#memory_int_107| .cse14) 8 (select .cse32 8))) |v_#memory_int_108|)))) .cse26 (exists ((|v_#valid_127| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_127| .cse14 1)) (= (select |v_#valid_127| .cse14) 0)))))) (= (store .cse33 .cse8 (store (select .cse33 .cse8) .cse6 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (<= 24 (select |c_#length| .cse14)) (= (store |v_#memory_int_112| .cse14 (store (select |v_#memory_int_112| .cse14) 16 (select (select |v_#memory_int_113| .cse14) 16))) |v_#memory_int_113|) (= (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse14)) |v_#memory_$Pointer$.base_139|) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#memory_int_113| .cse8 (store (select |v_#memory_int_113| .cse8) .cse6 (select (select |c_#memory_int| .cse8) .cse6))) |c_#memory_int|) (= |v_#memory_int_112| (store |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_112| |c_ULTIMATE.start_create_~now~0#1.base|) 8))))))))) .cse35 .cse36) (and (exists ((|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (let ((.cse37 (select (select |v_#memory_$Pointer$.base_148| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse38 (select (select |v_#memory_$Pointer$.offset_145| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_int_121| .cse37 (store (select |v_#memory_int_121| .cse37) .cse38 (select (select |c_#memory_int| .cse37) .cse38))) |c_#memory_int|) (or (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse40 (select (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= |v_#memory_$Pointer$.offset_145| (let ((.cse39 (store |v_#memory_$Pointer$.offset_143| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_143| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse39 .cse40 (store (select .cse39 .cse40) 16 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (store |v_#memory_$Pointer$.base_146| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_146| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse40)) |v_#memory_$Pointer$.base_147|) (= (store |v_#memory_$Pointer$.base_147| .cse40 (store (select |v_#memory_$Pointer$.base_147| .cse40) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_148|) (<= 24 (select |c_#length| .cse40)) (= (store |v_#memory_int_120| .cse40 (store (select |v_#memory_int_120| .cse40) 16 (select (select |v_#memory_int_121| .cse40) 16))) |v_#memory_int_121|) (= (select |c_#valid| .cse40) 1) (= (store |v_#memory_int_119| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_119| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_120| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_120|)))) (and .cse1 .cse3 .cse4 .cse5 .cse35 .cse36 (exists ((|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse41 (select (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_$Pointer$.base_139| .cse41 (store (select |v_#memory_$Pointer$.base_139| .cse41) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_148|) (= (let ((.cse42 (store |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse42 .cse41 (store (select .cse42 .cse41) 16 0))) |v_#memory_$Pointer$.offset_145|) (let ((.cse43 (not (= .cse41 0))) (.cse44 (<= (+ .cse41 1) |c_#StackHeapBarrier|)) (.cse46 (select (select |v_#memory_int_111| .cse41) 16))) (or (and .cse43 .cse44 .cse11 .cse12 .cse13 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| .cse41 (store (store (select |v_#memory_$Pointer$.base_130| .cse41) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse15 (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse45 (select |v_#memory_int_110| .cse41))) (and (= (store |v_#memory_int_110| .cse41 (store .cse45 16 .cse46)) |v_#memory_int_111|) (= (store |v_#memory_int_109| .cse41 (store (select |v_#memory_int_109| .cse41) 8 (select .cse45 8))) |v_#memory_int_110|)))) .cse18 (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| .cse41) 0) (= |c_#valid| (store |v_#valid_131| .cse41 1)))) .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| .cse41 32) |c_#length|)) .cse24 .cse25 .cse26 .cse27 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_127| .cse41 (store (store (select |v_#memory_$Pointer$.offset_127| .cse41) 8 0) 16 0)) |v_#memory_$Pointer$.offset_135|))) (and .cse43 .cse28 .cse44 (exists ((|v_#length_108| (Array Int Int))) (= |c_#length| (store |v_#length_108| .cse41 32))) .cse11 (exists ((|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_136| .cse41 (store (store (select |v_#memory_$Pointer$.base_136| .cse41) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse12 .cse29 .cse13 .cse15 .cse30 .cse18 .cse19 .cse31 .cse20 .cse21 .cse22 (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_135| (store |v_#memory_$Pointer$.offset_133| .cse41 (store (store (select |v_#memory_$Pointer$.offset_133| .cse41) 8 0) 16 0)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (let ((.cse47 (select |v_#memory_int_108| .cse41))) (and (= (store |v_#memory_int_108| .cse41 (store .cse47 16 .cse46)) |v_#memory_int_111|) (= (store |v_#memory_int_107| .cse41 (store (select |v_#memory_int_107| .cse41) 8 (select .cse47 8))) |v_#memory_int_108|)))) .cse26 (exists ((|v_#valid_127| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_127| .cse41 1)) (= (select |v_#valid_127| .cse41) 0)))))) (<= 24 (select |c_#length| .cse41)) (= (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse41)) |v_#memory_$Pointer$.base_139|) (= (select |c_#valid| .cse41) 1) (= |v_#memory_int_112| (store |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_112| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (store |v_#memory_int_112| .cse41 (store (select |v_#memory_int_112| .cse41) 16 (select (select |v_#memory_int_121| .cse41) 16))) |v_#memory_int_121|)))))) (= (select |c_#valid| .cse37) 1) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_145| .cse37 (store (select |v_#memory_$Pointer$.offset_145| .cse37) .cse38 |c_ULTIMATE.start_create_~data1~0#1.offset|))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_148| .cse37 (store (select |v_#memory_$Pointer$.base_148| .cse37) .cse38 |c_ULTIMATE.start_create_~data1~0#1.base|))) (<= (+ .cse38 8) (select |c_#length| .cse37)) (<= 0 .cse38)))) .cse2 (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse48))))))) is different from false [2024-11-09 06:33:30,895 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 ((.cse6 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse7 (<= 1 |c_#StackHeapBarrier|)) (.cse8 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse9 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse27 (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_130| (let ((.cse63 (store |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_134| |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_130| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= (store |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_131|)))) (.cse28 (exists ((|v_#valid_127| (Array Int Int))) (let ((.cse62 (store |v_#valid_127| |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 .cse62 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select |v_#valid_127| |c_ULTIMATE.start_create_~dll~0#1.base|) 0)))))) (.cse29 (exists ((|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_134|) (= (let ((.cse60 (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 .cse60 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse60 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_133|)))) (.cse31 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (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_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_13| (Array Int (Array Int Int)))) (let ((.cse58 (select |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse57 (select (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse56 (select (select |v_#memory_int_105| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse59 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse56 2147483648)) (<= 0 (+ .cse57 2147483648)) (= |v_#memory_int_104| (store |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse57))) (= (store |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse58 8))) |v_#memory_int_102|) (= (store |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse58 16 (select (select |v_#memory_int_103| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_103|) (<= .cse57 2147483647) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse59 24 (select (select |v_#memory_int_BEFORE_CALL_13| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_13|) (<= .cse56 2147483647) (= (store |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse56)) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse59 0))) |v_#memory_int_106|))))) (.cse32 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= (let ((.cse55 (store |v_#memory_$Pointer$.base_130| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |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_133| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_133|) (= (store |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_134|)))) (.cse16 (= |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)) (.cse33 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (and (= (let ((.cse54 (store |v_#memory_$Pointer$.offset_127| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |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$.offset_130| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_130|) (= (store |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_130| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_131| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.offset_131|)))) (.cse18 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse19 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse34 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (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_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse53 (select |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse51 (select (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse50 (select (select |v_#memory_int_105| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse52 (select |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse50 2147483648)) (<= 0 (+ .cse51 2147483648)) (= |v_#memory_int_104| (store |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_103| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse51))) (= (store |v_#memory_int_106| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse52 24 (select (select |v_#memory_int_BEFORE_CALL_11| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_11|) (= (store |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_101| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse53 8))) |v_#memory_int_102|) (= (store |v_#memory_int_102| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse53 16 (select (select |v_#memory_int_103| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_103|) (<= .cse51 2147483647) (<= .cse50 2147483647) (= (store |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_104| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse50)) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse52 0))) |v_#memory_int_106|))))) (.cse22 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse23 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse35 (exists ((|v_#valid_130| (Array Int Int))) (let ((.cse48 (store |v_#valid_130| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse49 (store .cse48 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse48 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse49 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_130| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse49 |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))))) (.cse24 (exists ((|v_#length_105| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_105| |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 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse26 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse30 (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))))) (.cse10 (<= 16 .cse1)) (.cse11 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0))) (or (exists ((|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (let ((.cse2 (select (select |v_#memory_$Pointer$.base_148| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse3 (select (select |v_#memory_$Pointer$.offset_145| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_int_121| .cse2 (store (select |v_#memory_int_121| .cse2) .cse3 (select (select |c_#memory_int| .cse2) .cse3))) |c_#memory_int|) (or (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse5 (select (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= |v_#memory_$Pointer$.offset_145| (let ((.cse4 (store |v_#memory_$Pointer$.offset_143| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_143| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse4 .cse5 (store (select .cse4 .cse5) 16 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (store |v_#memory_$Pointer$.base_146| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_146| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse5)) |v_#memory_$Pointer$.base_147|) (= (store |v_#memory_$Pointer$.base_147| .cse5 (store (select |v_#memory_$Pointer$.base_147| .cse5) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_148|) (<= 24 (select |c_#length| .cse5)) (= (store |v_#memory_int_120| .cse5 (store (select |v_#memory_int_120| .cse5) 16 (select (select |v_#memory_int_121| .cse5) 16))) |v_#memory_int_121|) (= (select |c_#valid| .cse5) 1) (= (store |v_#memory_int_119| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_119| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_120| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_120|)))) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse12 (select (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_$Pointer$.base_139| .cse12 (store (select |v_#memory_$Pointer$.base_139| .cse12) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_148|) (= (let ((.cse13 (store |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse13 .cse12 (store (select .cse13 .cse12) 16 0))) |v_#memory_$Pointer$.offset_145|) (let ((.cse14 (not (= .cse12 0))) (.cse15 (<= (+ .cse12 1) |c_#StackHeapBarrier|)) (.cse21 (select (select |v_#memory_int_111| .cse12) 16))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| .cse12 (store (store (select |v_#memory_$Pointer$.base_130| .cse12) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse19 (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse20 (select |v_#memory_int_110| .cse12))) (and (= (store |v_#memory_int_110| .cse12 (store .cse20 16 .cse21)) |v_#memory_int_111|) (= (store |v_#memory_int_109| .cse12 (store (select |v_#memory_int_109| .cse12) 8 (select .cse20 8))) |v_#memory_int_110|)))) .cse22 (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| .cse12) 0) (= |c_#valid| (store |v_#valid_131| .cse12 1)))) .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| .cse12 32) |c_#length|)) .cse28 .cse29 .cse30 .cse31 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_127| .cse12 (store (store (select |v_#memory_$Pointer$.offset_127| .cse12) 8 0) 16 0)) |v_#memory_$Pointer$.offset_135|))) (and .cse14 .cse32 .cse15 (exists ((|v_#length_108| (Array Int Int))) (= |c_#length| (store |v_#length_108| .cse12 32))) .cse16 (exists ((|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_136| .cse12 (store (store (select |v_#memory_$Pointer$.base_136| .cse12) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse17 .cse33 .cse18 .cse19 .cse34 .cse22 .cse23 .cse35 .cse24 .cse25 .cse26 (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_135| (store |v_#memory_$Pointer$.offset_133| .cse12 (store (store (select |v_#memory_$Pointer$.offset_133| .cse12) 8 0) 16 0)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (let ((.cse36 (select |v_#memory_int_108| .cse12))) (and (= (store |v_#memory_int_108| .cse12 (store .cse36 16 .cse21)) |v_#memory_int_111|) (= (store |v_#memory_int_107| .cse12 (store (select |v_#memory_int_107| .cse12) 8 (select .cse36 8))) |v_#memory_int_108|)))) .cse30 (exists ((|v_#valid_127| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_127| .cse12 1)) (= (select |v_#valid_127| .cse12) 0)))))) (<= 24 (select |c_#length| .cse12)) (= (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse12)) |v_#memory_$Pointer$.base_139|) (= (select |c_#valid| .cse12) 1) (= |v_#memory_int_112| (store |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_112| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (store |v_#memory_int_112| .cse12 (store (select |v_#memory_int_112| .cse12) 16 (select (select |v_#memory_int_121| .cse12) 16))) |v_#memory_int_121|)))))) (= (select |c_#valid| .cse2) 1) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_145| .cse2 (store (select |v_#memory_$Pointer$.offset_145| .cse2) .cse3 |c_ULTIMATE.start_create_~data1~0#1.offset|))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_148| .cse2 (store (select |v_#memory_$Pointer$.base_148| .cse2) .cse3 |c_ULTIMATE.start_create_~data1~0#1.base|))) (<= (+ .cse3 8) (select |c_#length| .cse2)) (<= 0 .cse3)))) (and .cse6 .cse7 .cse8 .cse9 (exists ((|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_138| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_139| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse38 (let ((.cse47 (store |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse47 .cse42 (store (select .cse47 .cse42) 16 0)))) (.cse46 (store |v_#memory_$Pointer$.base_139| .cse42 (store (select |v_#memory_$Pointer$.base_139| .cse42) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse39 (select (select .cse46 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse37 (select (select .cse38 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (<= 0 .cse37) (= |c_#memory_$Pointer$.offset| (store .cse38 .cse39 (store (select .cse38 .cse39) .cse37 0))) (<= (+ .cse37 8) (select |c_#length| .cse39)) (let ((.cse40 (not (= .cse42 0))) (.cse41 (<= (+ .cse42 1) |c_#StackHeapBarrier|)) (.cse44 (select (select |v_#memory_int_111| .cse42) 16))) (or (and .cse40 .cse41 .cse16 .cse17 .cse18 (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| .cse42 (store (store (select |v_#memory_$Pointer$.base_130| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse19 (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_110| .cse42))) (and (= (store |v_#memory_int_110| .cse42 (store .cse43 16 .cse44)) |v_#memory_int_111|) (= (store |v_#memory_int_109| .cse42 (store (select |v_#memory_int_109| .cse42) 8 (select .cse43 8))) |v_#memory_int_110|)))) .cse22 (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| .cse42) 0) (= |c_#valid| (store |v_#valid_131| .cse42 1)))) .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| .cse42 32) |c_#length|)) .cse28 .cse29 .cse30 .cse31 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_127| .cse42 (store (store (select |v_#memory_$Pointer$.offset_127| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.offset_135|))) (and .cse40 .cse32 .cse41 (exists ((|v_#length_108| (Array Int Int))) (= |c_#length| (store |v_#length_108| .cse42 32))) .cse16 (exists ((|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_136| .cse42 (store (store (select |v_#memory_$Pointer$.base_136| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.base_138|)) .cse17 .cse33 .cse18 .cse19 .cse34 .cse22 .cse23 .cse35 .cse24 .cse25 .cse26 (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_135| (store |v_#memory_$Pointer$.offset_133| .cse42 (store (store (select |v_#memory_$Pointer$.offset_133| .cse42) 8 0) 16 0)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (let ((.cse45 (select |v_#memory_int_108| .cse42))) (and (= (store |v_#memory_int_108| .cse42 (store .cse45 16 .cse44)) |v_#memory_int_111|) (= (store |v_#memory_int_107| .cse42 (store (select |v_#memory_int_107| .cse42) 8 (select .cse45 8))) |v_#memory_int_108|)))) .cse30 (exists ((|v_#valid_127| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_127| .cse42 1)) (= (select |v_#valid_127| .cse42) 0)))))) (= (store .cse46 .cse39 (store (select .cse46 .cse39) .cse37 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (<= 24 (select |c_#length| .cse42)) (= (store |v_#memory_int_112| .cse42 (store (select |v_#memory_int_112| .cse42) 16 (select (select |v_#memory_int_113| .cse42) 16))) |v_#memory_int_113|) (= (store |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_138| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse42)) |v_#memory_$Pointer$.base_139|) (= (select |c_#valid| .cse39) 1) (= (select |c_#valid| .cse42) 1) (= (store |v_#memory_int_113| .cse39 (store (select |v_#memory_int_113| .cse39) .cse37 (select (select |c_#memory_int| .cse39) .cse37))) |c_#memory_int|) (= |v_#memory_int_112| (store |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_111| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_112| |c_ULTIMATE.start_create_~now~0#1.base|) 8))))))))) .cse10 .cse11))))) is different from false [2024-11-09 06:33:39,790 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8617#(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-09 06:33:39,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:33:39,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:33:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2024-11-09 06:33:39,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176530362] [2024-11-09 06:33:39,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:33:39,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:33:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:33:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1112, Unknown=14, NotChecked=210, Total=1482 [2024-11-09 06:33:39,793 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 17 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 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-09 06:33:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:40,443 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2024-11-09 06:33:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:33:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 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 32 [2024-11-09 06:33:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:40,445 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:33:40,445 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:33:40,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 108.4s TimeCoverageRelationStatistics Valid=159, Invalid=1171, Unknown=14, NotChecked=216, Total=1560 [2024-11-09 06:33:40,446 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 26 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:40,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 650 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:33:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:33:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-11-09 06:33:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 126 states have internal predecessors, (142), 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-09 06:33:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2024-11-09 06:33:40,451 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 32 [2024-11-09 06:33:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:40,451 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2024-11-09 06:33:40,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 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-09 06:33:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2024-11-09 06:33:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 06:33:40,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:40,452 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, 1] [2024-11-09 06:33:40,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:33:40,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:40,653 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-09 06:33:40,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1861183692, now seen corresponding path program 1 times [2024-11-09 06:33:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810199452] [2024-11-09 06:33:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:41,573 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-09 06:33:41,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:41,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810199452] [2024-11-09 06:33:41,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810199452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:41,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171954964] [2024-11-09 06:33:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:41,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:41,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:41,577 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:41,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:33:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:41,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 06:33:41,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:42,023 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-09 06:33:42,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:42,052 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-09 06:33:42,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:33:42,065 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-09 06:33:42,205 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-09 06:33:42,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171954964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [534494333] [2024-11-09 06:33:42,634 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 06:33:42,634 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:33:42,635 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:33:42,636 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:33:42,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:33:54,578 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 06:33:54,595 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:35:31,277 WARN L286 SmtUtils]: Spent 37.02s on a formula simplification. DAG size of input: 368 DAG size of output: 361 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:37:06,936 WARN L286 SmtUtils]: Spent 57.49s on a formula simplification. DAG size of input: 375 DAG size of output: 367 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:37:45,581 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9075#(and (exists ((|v_ULTIMATE.start_create_~now~0#1.offset_46| Int) (|v_ULTIMATE.start_create_~now~0#1.base_53| Int) (|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int))) (|v_#memory_int_150| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int)))) (and (<= 0 (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) (<= 0 (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24)) (<= (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_46|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_53|)) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) 1) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_53|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_172| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) (store (select |v_#memory_$Pointer$.offset_172| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24))))) (= (store |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) (store (select |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24)))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_150| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) (store (select |v_#memory_int_150| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (+ (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)) 24))))) (<= (+ 32 (select (select |v_#memory_$Pointer$.offset_172| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|))) (select |#length| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_create_~now~0#1.base_53|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_46|)))))) (<= (select |#length| |ULTIMATE.start_loop_~node~0#1.base|) (+ |ULTIMATE.start_loop_~node~0#1.offset| 31)) (<= 0 |ULTIMATE.start_loop_~node~0#1.offset|) (= (select |#valid| |ULTIMATE.start_loop_~node~0#1.base|) 1) (<= (+ |ULTIMATE.start_loop_~node~0#1.offset| 8) (select |#length| |ULTIMATE.start_loop_~node~0#1.base|)) (= |ULTIMATE.start_loop_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_loop_~node~0#1.base|) |ULTIMATE.start_loop_~node~0#1.offset|)) (= |ULTIMATE.start_loop_#t~mem15#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_loop_~node~0#1.base|) |ULTIMATE.start_loop_~node~0#1.offset|)) (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|))' at error location [2024-11-09 06:37:45,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:37:45,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:37:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-09 06:37:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586112981] [2024-11-09 06:37:45,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:37:45,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 06:37:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:37:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 06:37:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1944, Unknown=36, NotChecked=90, Total=2256 [2024-11-09 06:37:45,584 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 21 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 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-09 06:37:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:37:47,819 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2024-11-09 06:37:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:37:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 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 33 [2024-11-09 06:37:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:37:47,821 INFO L225 Difference]: With dead ends: 171 [2024-11-09 06:37:47,821 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 06:37:47,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 232.2s TimeCoverageRelationStatistics Valid=206, Invalid=2210, Unknown=38, NotChecked=96, Total=2550 [2024-11-09 06:37:47,823 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 67 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:37:47,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 662 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 612 Invalid, 0 Unknown, 144 Unchecked, 1.7s Time] [2024-11-09 06:37:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 06:37:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2024-11-09 06:37:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.4821428571428572) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:37:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2024-11-09 06:37:47,831 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 33 [2024-11-09 06:37:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:37:47,831 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2024-11-09 06:37:47,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 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-09 06:37:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2024-11-09 06:37:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:37:47,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:47,833 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-09 06:37:47,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 06:37:48,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 06:37:48,034 INFO L396 AbstractCegarLoop]: === Iteration 36 === 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-09 06:37:48,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash -503161684, now seen corresponding path program 1 times [2024-11-09 06:37:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016706181] [2024-11-09 06:37:48,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:49,473 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-09 06:37:49,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:37:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016706181] [2024-11-09 06:37:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016706181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:37:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639219690] [2024-11-09 06:37:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:37:49,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:37:49,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:37:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:49,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:37:49,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:37:49,887 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:37:49,887 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-09 06:37:49,905 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-09 06:37:50,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:37:50,016 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-09 06:37:50,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:37:50,146 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-09 06:37:50,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:37:50,279 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-09 06:37:50,299 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-09 06:37:50,340 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-09 06:37:50,418 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:37:50,419 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-09 06:37:50,425 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-09 06:37:50,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:37:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639219690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:37:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [472478160] [2024-11-09 06:37:50,562 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 06:37:50,562 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:37:50,563 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:37:50,563 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:37:50,563 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:38:06,074 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-09 06:38:06,114 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:39:23,714 WARN L286 SmtUtils]: Spent 42.76s on a formula simplification. DAG size of input: 360 DAG size of output: 350 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:40:35,188 WARN L286 SmtUtils]: Spent 45.44s on a formula simplification. DAG size of input: 367 DAG size of output: 356 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:40:37,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse34 (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 .cse34)) (.cse7 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse13 (exists ((|v_#valid_157| (Array Int Int))) (let ((.cse58 (store |v_#valid_157| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse57 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= 0 (select .cse58 |c_ULTIMATE.start_create_~data1~0#1.base|)) (= (select .cse57 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select |v_#valid_157| |c_ULTIMATE.start_create_~dll~0#1.base|) 0)))))) (.cse27 (exists ((|v_#memory_int_BEFORE_CALL_49| (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_168| (Array Int (Array Int Int))) (|v_#memory_int_162| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int)))) (let ((.cse53 (select |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse54 (select (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse56 (select |v_#memory_int_169| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse55 (select (select |v_#memory_int_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_165| (store |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse53 0)))) (= (store |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse54)) |v_#memory_int_163|) (<= 0 (+ .cse54 2147483648)) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse53 24 (select (select |v_#memory_int_BEFORE_CALL_49| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_49|) (<= .cse54 2147483647) (<= 0 (+ .cse55 2147483648)) (= (store |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse55)) |v_#memory_int_164|) (= (store |v_#memory_int_168| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse56 8))) |v_#memory_int_169|) (= (store |v_#memory_int_169| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse56 16 (select (select |v_#memory_int_162| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_162|) (<= .cse55 2147483647))))) (.cse29 (exists ((|v_#valid_153| (Array Int Int))) (let ((.cse51 (store |v_#valid_153| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse52 (store .cse51 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select |v_#valid_153| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse51 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse52 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= 0 (select .cse52 |c_ULTIMATE.start_create_~data2~0#1.base|))))))) (.cse30 (exists ((|v_#memory_int_BEFORE_CALL_47| (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_162| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int)))) (let ((.cse47 (select |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse48 (select (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse49 (select |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse50 (select (select |v_#memory_int_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_165| (store |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse47 0)))) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse47 24 (select (select |v_#memory_int_BEFORE_CALL_47| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_47|) (= (store |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse48)) |v_#memory_int_163|) (<= 0 (+ .cse48 2147483648)) (= (store |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse49 8))) |v_#memory_int_167|) (<= .cse48 2147483647) (<= 0 (+ .cse50 2147483648)) (= (store |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse50)) |v_#memory_int_164|) (= (store |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse49 16 (select (select |v_#memory_int_162| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_162|) (<= .cse50 2147483647))))) (.cse14 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse15 (exists ((|v_#memory_$Pointer$.base_193| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_192| (let ((.cse46 (store |v_#memory_$Pointer$.base_189| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_189| |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$.base_192| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= |v_#memory_$Pointer$.base_193| (store |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_193| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))))) (.cse17 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse18 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse19 (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))))) (.cse20 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse21 (exists ((|v_#memory_$Pointer$.offset_182| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_186| (store |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))) (= (let ((.cse45 (store |v_#memory_$Pointer$.offset_182| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_182| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse45 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse45 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_185|)))) (.cse22 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse23 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse25 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse28 (exists ((|v_#length_128| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_128| |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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_197| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse9 (let ((.cse33 (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse33 .cse8 (store (select .cse33 .cse8) 16 0)))) (.cse32 (store |v_#memory_$Pointer$.base_198| .cse8 (store (select |v_#memory_$Pointer$.base_198| .cse8) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse10 (select (select .cse32 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_int_171| .cse8 (store (select |v_#memory_int_171| .cse8) 16 (select (select |v_#memory_int_172| .cse8) 16))) |v_#memory_int_172|) (= |c_#memory_$Pointer$.offset| (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 0))) (= (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_171|) (<= (+ .cse11 8) (select |c_#length| .cse10)) (= (store |v_#memory_int_172| .cse10 (store (select |v_#memory_int_172| .cse10) .cse11 (select (select |c_#memory_int| .cse10) .cse11))) |c_#memory_int|) (= (store |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse8)) |v_#memory_$Pointer$.base_198|) (let ((.cse12 (not (= 0 .cse8))) (.cse16 (<= (+ 1 .cse8) |c_#StackHeapBarrier|)) (.cse26 (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_int_161| .cse8))) (and (= |v_#memory_int_170| (store |v_#memory_int_161| .cse8 (store .cse31 16 (select (select |v_#memory_int_170| .cse8) 16)))) (= (store |v_#memory_int_160| .cse8 (store (select |v_#memory_int_160| .cse8) 8 (select .cse31 8))) |v_#memory_int_161|)))))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#valid_153| (Array Int Int))) (and (= (select |v_#valid_153| .cse8) 0) (= |c_#valid| (store |v_#valid_153| .cse8 1)))) (exists ((|v_#length_132| (Array Int Int))) (= |c_#length| (store |v_#length_132| .cse8 32))) (exists ((|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_189| .cse8 (store (store (select |v_#memory_$Pointer$.offset_189| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_196| .cse8 (store (store (select |v_#memory_$Pointer$.base_196| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) .cse26 .cse27 .cse28) (and .cse12 .cse29 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| .cse8 32) |c_#length|)) .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_#valid_156| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_156| .cse8 1)) (= 0 (select |v_#valid_156| .cse8)))) .cse24 .cse25 (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_195| .cse8 (store (store (select |v_#memory_$Pointer$.base_195| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) (exists ((|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_188| .cse8 (store (store (select |v_#memory_$Pointer$.offset_188| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) .cse26 .cse28))) (<= 24 (select |c_#length| .cse8)) (= (select |c_#valid| .cse10) 1) (= (store .cse32 .cse10 (store (select .cse32 .cse10) .cse11 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (= (select |c_#valid| .cse8) 1) (<= 0 .cse11))))))) (and .cse2 (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse34) (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int)))) (let ((.cse36 (select (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse35 (select (select |v_#memory_$Pointer$.offset_200| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= (+ 8 .cse35) (select |c_#length| .cse36)) (<= 0 .cse35) (= (select |c_#valid| .cse36) 1) (= |c_#memory_int| (store |v_#memory_int_180| .cse36 (store (select |v_#memory_int_180| .cse36) .cse35 (select (select |c_#memory_int| .cse36) .cse35)))) (or (exists ((|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_198| (Array Int (Array Int Int)))) (let ((.cse37 (select (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= 24 (select |c_#length| .cse37)) (= |v_#memory_int_180| (store |v_#memory_int_179| .cse37 (store (select |v_#memory_int_179| .cse37) 16 (select (select |v_#memory_int_180| .cse37) 16)))) (= |v_#memory_$Pointer$.base_207| (store |v_#memory_$Pointer$.base_206| .cse37 (store (select |v_#memory_$Pointer$.base_206| .cse37) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (= (store |v_#memory_int_178| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_178| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_179| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_179|) (= (let ((.cse38 (store |v_#memory_$Pointer$.offset_198| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_198| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse38 .cse37 (store (select .cse38 .cse37) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_200|) (= |v_#memory_$Pointer$.base_206| (store |v_#memory_$Pointer$.base_205| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_205| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse37))) (= (select |c_#valid| .cse37) 1)))) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_197| (Array Int (Array Int Int)))) (let ((.cse39 (select (select |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_171|) (= (store |v_#memory_$Pointer$.base_198| .cse39 (store (select |v_#memory_$Pointer$.base_198| .cse39) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_207|) (= (store |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse39)) |v_#memory_$Pointer$.base_198|) (let ((.cse40 (not (= 0 .cse39))) (.cse41 (<= (+ 1 .cse39) |c_#StackHeapBarrier|)) (.cse42 (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_161| .cse39))) (and (= |v_#memory_int_170| (store |v_#memory_int_161| .cse39 (store .cse43 16 (select (select |v_#memory_int_170| .cse39) 16)))) (= (store |v_#memory_int_160| .cse39 (store (select |v_#memory_int_160| .cse39) 8 (select .cse43 8))) |v_#memory_int_161|)))))) (or (and .cse40 .cse13 .cse14 .cse15 .cse41 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#valid_153| (Array Int Int))) (and (= (select |v_#valid_153| .cse39) 0) (= |c_#valid| (store |v_#valid_153| .cse39 1)))) (exists ((|v_#length_132| (Array Int Int))) (= |c_#length| (store |v_#length_132| .cse39 32))) (exists ((|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_189| .cse39 (store (store (select |v_#memory_$Pointer$.offset_189| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_196| .cse39 (store (store (select |v_#memory_$Pointer$.base_196| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) .cse42 .cse27 .cse28) (and .cse40 .cse29 .cse30 .cse14 .cse15 .cse41 .cse17 .cse18 (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| .cse39 32) |c_#length|)) .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_#valid_156| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_156| .cse39 1)) (= 0 (select |v_#valid_156| .cse39)))) .cse24 .cse25 (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_195| .cse39 (store (store (select |v_#memory_$Pointer$.base_195| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) (exists ((|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_188| .cse39 (store (store (select |v_#memory_$Pointer$.offset_188| .cse39) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) .cse42 .cse28))) (<= 24 (select |c_#length| .cse39)) (= (store |v_#memory_int_171| .cse39 (store (select |v_#memory_int_171| .cse39) 16 (select (select |v_#memory_int_180| .cse39) 16))) |v_#memory_int_180|) (= (let ((.cse44 (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse44 .cse39 (store (select .cse44 .cse39) 16 0))) |v_#memory_$Pointer$.offset_200|) (= (select |c_#valid| .cse39) 1)))))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_200| .cse36 (store (select |v_#memory_$Pointer$.offset_200| .cse36) .cse35 |c_ULTIMATE.start_create_~data1~0#1.offset|))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_207| .cse36 (store (select |v_#memory_$Pointer$.base_207| .cse36) .cse35 |c_ULTIMATE.start_create_~data1~0#1.base|)))))))))))) is different from false [2024-11-09 06:40:39,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (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) (= (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) (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)) (.cse13 (exists ((|v_#valid_157| (Array Int Int))) (let ((.cse57 (store |v_#valid_157| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse56 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= 0 (select .cse57 |c_ULTIMATE.start_create_~data1~0#1.base|)) (= (select .cse56 |c_ULTIMATE.start_create_~data2~0#1.base|) 0) (= (select |v_#valid_157| |c_ULTIMATE.start_create_~dll~0#1.base|) 0)))))) (.cse27 (exists ((|v_#memory_int_BEFORE_CALL_49| (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_168| (Array Int (Array Int Int))) (|v_#memory_int_162| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse53 (select (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse55 (select |v_#memory_int_169| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse54 (select (select |v_#memory_int_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_165| (store |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse52 0)))) (= (store |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse53)) |v_#memory_int_163|) (<= 0 (+ .cse53 2147483648)) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse52 24 (select (select |v_#memory_int_BEFORE_CALL_49| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_49|) (<= .cse53 2147483647) (<= 0 (+ .cse54 2147483648)) (= (store |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse54)) |v_#memory_int_164|) (= (store |v_#memory_int_168| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse55 8))) |v_#memory_int_169|) (= (store |v_#memory_int_169| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse55 16 (select (select |v_#memory_int_162| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_162|) (<= .cse54 2147483647))))) (.cse29 (exists ((|v_#valid_153| (Array Int Int))) (let ((.cse50 (store |v_#valid_153| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse51 (store .cse50 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select |v_#valid_153| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse50 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse51 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= 0 (select .cse51 |c_ULTIMATE.start_create_~data2~0#1.base|))))))) (.cse30 (exists ((|v_#memory_int_BEFORE_CALL_47| (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_162| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int)))) (let ((.cse46 (select |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse47 (select (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse48 (select |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse49 (select (select |v_#memory_int_164| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) (and (= |v_#memory_int_165| (store |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_164| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse46 0)))) (= (store |v_#memory_int_165| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse46 24 (select (select |v_#memory_int_BEFORE_CALL_47| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_47|) (= (store |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_162| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse47)) |v_#memory_int_163|) (<= 0 (+ .cse47 2147483648)) (= (store |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_166| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse48 8))) |v_#memory_int_167|) (<= .cse47 2147483647) (<= 0 (+ .cse49 2147483648)) (= (store |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_163| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse49)) |v_#memory_int_164|) (= (store |v_#memory_int_167| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse48 16 (select (select |v_#memory_int_162| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_162|) (<= .cse49 2147483647))))) (.cse14 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse15 (exists ((|v_#memory_$Pointer$.base_193| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_192| (let ((.cse45 (store |v_#memory_$Pointer$.base_189| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_189| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse45 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse45 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= |v_#memory_$Pointer$.base_193| (store |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_193| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))))) (.cse17 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse18 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse19 (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))))) (.cse20 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse21 (exists ((|v_#memory_$Pointer$.offset_182| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_186| (store |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))) (= (let ((.cse44 (store |v_#memory_$Pointer$.offset_182| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_182| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse44 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse44 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_185|)))) (.cse22 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse23 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse25 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse28 (exists ((|v_#length_128| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_128| |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 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_197| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse9 (let ((.cse33 (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse33 .cse8 (store (select .cse33 .cse8) 16 0)))) (.cse32 (store |v_#memory_$Pointer$.base_198| .cse8 (store (select |v_#memory_$Pointer$.base_198| .cse8) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse10 (select (select .cse32 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_int_171| .cse8 (store (select |v_#memory_int_171| .cse8) 16 (select (select |v_#memory_int_172| .cse8) 16))) |v_#memory_int_172|) (= |c_#memory_$Pointer$.offset| (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 0))) (= (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_171|) (<= (+ .cse11 8) (select |c_#length| .cse10)) (= (store |v_#memory_int_172| .cse10 (store (select |v_#memory_int_172| .cse10) .cse11 (select (select |c_#memory_int| .cse10) .cse11))) |c_#memory_int|) (= (store |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse8)) |v_#memory_$Pointer$.base_198|) (let ((.cse12 (not (= 0 .cse8))) (.cse16 (<= (+ 1 .cse8) |c_#StackHeapBarrier|)) (.cse26 (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_int_161| .cse8))) (and (= |v_#memory_int_170| (store |v_#memory_int_161| .cse8 (store .cse31 16 (select (select |v_#memory_int_170| .cse8) 16)))) (= (store |v_#memory_int_160| .cse8 (store (select |v_#memory_int_160| .cse8) 8 (select .cse31 8))) |v_#memory_int_161|)))))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#valid_153| (Array Int Int))) (and (= (select |v_#valid_153| .cse8) 0) (= |c_#valid| (store |v_#valid_153| .cse8 1)))) (exists ((|v_#length_132| (Array Int Int))) (= |c_#length| (store |v_#length_132| .cse8 32))) (exists ((|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_189| .cse8 (store (store (select |v_#memory_$Pointer$.offset_189| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_196| .cse8 (store (store (select |v_#memory_$Pointer$.base_196| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) .cse26 .cse27 .cse28) (and .cse12 .cse29 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| .cse8 32) |c_#length|)) .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_#valid_156| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_156| .cse8 1)) (= 0 (select |v_#valid_156| .cse8)))) .cse24 .cse25 (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_195| .cse8 (store (store (select |v_#memory_$Pointer$.base_195| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) (exists ((|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_188| .cse8 (store (store (select |v_#memory_$Pointer$.offset_188| .cse8) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) .cse26 .cse28))) (<= 24 (select |c_#length| .cse8)) (= (select |c_#valid| .cse10) 1) (= (store .cse32 .cse10 (store (select .cse32 .cse10) .cse11 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (= (select |c_#valid| .cse8) 1) (<= 0 .cse11))))))) (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int)))) (let ((.cse35 (select (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse34 (select (select |v_#memory_$Pointer$.offset_200| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= (+ 8 .cse34) (select |c_#length| .cse35)) (<= 0 .cse34) (= (select |c_#valid| .cse35) 1) (= |c_#memory_int| (store |v_#memory_int_180| .cse35 (store (select |v_#memory_int_180| .cse35) .cse34 (select (select |c_#memory_int| .cse35) .cse34)))) (or (exists ((|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_198| (Array Int (Array Int Int)))) (let ((.cse36 (select (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= 24 (select |c_#length| .cse36)) (= |v_#memory_int_180| (store |v_#memory_int_179| .cse36 (store (select |v_#memory_int_179| .cse36) 16 (select (select |v_#memory_int_180| .cse36) 16)))) (= |v_#memory_$Pointer$.base_207| (store |v_#memory_$Pointer$.base_206| .cse36 (store (select |v_#memory_$Pointer$.base_206| .cse36) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (= (store |v_#memory_int_178| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_178| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_179| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_179|) (= (let ((.cse37 (store |v_#memory_$Pointer$.offset_198| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_198| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse37 .cse36 (store (select .cse37 .cse36) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_200|) (= |v_#memory_$Pointer$.base_206| (store |v_#memory_$Pointer$.base_205| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_205| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse36))) (= (select |c_#valid| .cse36) 1)))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_197| (Array Int (Array Int Int)))) (let ((.cse38 (select (select |v_#memory_$Pointer$.base_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_170| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_171| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_171|) (= (store |v_#memory_$Pointer$.base_198| .cse38 (store (select |v_#memory_$Pointer$.base_198| .cse38) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_207|) (= (store |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_197| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse38)) |v_#memory_$Pointer$.base_198|) (let ((.cse39 (not (= 0 .cse38))) (.cse40 (<= (+ 1 .cse38) |c_#StackHeapBarrier|)) (.cse41 (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (let ((.cse42 (select |v_#memory_int_161| .cse38))) (and (= |v_#memory_int_170| (store |v_#memory_int_161| .cse38 (store .cse42 16 (select (select |v_#memory_int_170| .cse38) 16)))) (= (store |v_#memory_int_160| .cse38 (store (select |v_#memory_int_160| .cse38) 8 (select .cse42 8))) |v_#memory_int_161|)))))) (or (and .cse39 .cse13 .cse14 .cse15 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#valid_153| (Array Int Int))) (and (= (select |v_#valid_153| .cse38) 0) (= |c_#valid| (store |v_#valid_153| .cse38 1)))) (exists ((|v_#length_132| (Array Int Int))) (= |c_#length| (store |v_#length_132| .cse38 32))) (exists ((|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_189| .cse38 (store (store (select |v_#memory_$Pointer$.offset_189| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_196| .cse38 (store (store (select |v_#memory_$Pointer$.base_196| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) .cse41 .cse27 .cse28) (and .cse39 .cse29 .cse30 .cse14 .cse15 .cse40 .cse17 .cse18 (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| .cse38 32) |c_#length|)) .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_#valid_156| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_156| .cse38 1)) (= 0 (select |v_#valid_156| .cse38)))) .cse24 .cse25 (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_195| .cse38 (store (store (select |v_#memory_$Pointer$.base_195| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.base_197|)) (exists ((|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_188| .cse38 (store (store (select |v_#memory_$Pointer$.offset_188| .cse38) 8 0) 16 0)) |v_#memory_$Pointer$.offset_190|)) .cse41 .cse28))) (<= 24 (select |c_#length| .cse38)) (= (store |v_#memory_int_171| .cse38 (store (select |v_#memory_int_171| .cse38) 16 (select (select |v_#memory_int_180| .cse38) 16))) |v_#memory_int_180|) (= (let ((.cse43 (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse43 .cse38 (store (select .cse43 .cse38) 16 0))) |v_#memory_$Pointer$.offset_200|) (= (select |c_#valid| .cse38) 1)))))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_200| .cse35 (store (select |v_#memory_$Pointer$.offset_200| .cse35) .cse34 |c_ULTIMATE.start_create_~data1~0#1.offset|))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_207| .cse35 (store (select |v_#memory_$Pointer$.base_207| .cse35) .cse34 |c_ULTIMATE.start_create_~data1~0#1.base|)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) |c_ULTIMATE.start_create_#t~mem13#1.offset|))) is different from false [2024-11-09 06:40:39,281 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9548#(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-09 06:40:39,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:40:39,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:40:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-09 06:40:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260580859] [2024-11-09 06:40:39,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:40:39,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:40:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:40:39,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:40:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1262, Unknown=13, NotChecked=222, Total=1640 [2024-11-09 06:40:39,283 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 20 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 18 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:40:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:40,993 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2024-11-09 06:40:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:40:40,994 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 18 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-09 06:40:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:40,994 INFO L225 Difference]: With dead ends: 144 [2024-11-09 06:40:40,995 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 06:40:40,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 154.8s TimeCoverageRelationStatistics Valid=208, Invalid=1861, Unknown=13, NotChecked=270, Total=2352 [2024-11-09 06:40:40,996 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:40,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 483 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 75 Unchecked, 1.0s Time] [2024-11-09 06:40:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 06:40:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 06:40:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 138 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:40:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-11-09 06:40:41,003 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 34 [2024-11-09 06:40:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:41,004 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-11-09 06:40:41,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 18 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:40:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-11-09 06:40:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:40:41,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:41,006 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-09 06:40:41,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:40:41,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 06:40:41,210 INFO L396 AbstractCegarLoop]: === Iteration 37 === 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-09 06:40:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -503161683, now seen corresponding path program 1 times [2024-11-09 06:40:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:40:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54034338] [2024-11-09 06:40:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:40:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:40:43,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:40:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54034338] [2024-11-09 06:40:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54034338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:40:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247744416] [2024-11-09 06:40:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:43,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:40:43,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:40:43,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:40:43,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:40:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:40:43,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 06:40:43,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:40:43,654 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-09 06:40:43,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:40:43,793 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-09 06:40:43,827 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-09 06:40:43,834 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-09 06:40:43,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:40:43,987 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-09 06:40:43,995 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-09 06:40:44,281 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:40:44,282 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-09 06:40:44,290 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-09 06:40:44,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:40:44,492 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-09 06:40:44,515 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-09 06:40:44,543 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-09 06:40:44,552 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-09 06:40:44,795 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-09 06:40:44,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:40:44,836 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-09 06:40:44,863 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:40:44,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:40:44,864 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-09 06:40:44,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:40:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247744416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:40:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [52410512] [2024-11-09 06:40:45,212 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 06:40:45,213 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:40:45,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:40:45,213 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:40:45,214 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:41:01,911 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-09 06:41:01,950 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:42:23,458 WARN L286 SmtUtils]: Spent 39.00s on a formula simplification. DAG size of input: 385 DAG size of output: 375 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:43:45,650 WARN L286 SmtUtils]: Spent 50.01s on a formula simplification. DAG size of input: 392 DAG size of output: 381 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:43:47,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse40 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.cse4 (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0)) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1)) (.cse5 (<= 1 |c_#StackHeapBarrier|)) (.cse6 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0)) (.cse8 (<= 16 .cse40)) (.cse9 (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (.cse12 (exists ((|v_#length_142| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_142| |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 (exists ((|v_#memory_$Pointer$.base_225| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_223| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_222| (Array Int (Array Int Int)))) (and (= (let ((.cse69 (store |v_#memory_$Pointer$.base_225| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_225| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse69 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse69 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_222|) (= (store |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_223|)))) (.cse26 (exists ((|v_#memory_$Pointer$.offset_215| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_218| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_215| (let ((.cse68 (store |v_#memory_$Pointer$.offset_218| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_218| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse68 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse68 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= |v_#memory_$Pointer$.offset_216| (store |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_216| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))))) (.cse29 (exists ((|v_#valid_169| (Array Int Int))) (let ((.cse67 (store |v_#valid_169| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse66 (store .cse67 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse66 |c_ULTIMATE.start_create_~data2~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 |v_#valid_169| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse67 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse30 (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int)))) (let ((.cse62 (select (select |v_#memory_int_192| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse65 (select |v_#memory_int_195| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse64 (select (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse63 (select |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse62 2147483648)) (= (store |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse63 0))) |v_#memory_int_193|) (<= .cse62 2147483647) (<= .cse64 2147483647) (<= 0 (+ .cse64 2147483648)) (= (store |v_#memory_int_195| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse65 16 (select (select |v_#memory_int_190| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_190|) (= (store |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse62)) |v_#memory_int_192|) (= (store |v_#memory_int_194| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_194| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse65 8))) |v_#memory_int_195|) (= (store |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse64)) |v_#memory_int_191|) (= |v_old(#memory_int)_AFTER_CALL_46| (store |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse63 24 (select (select |v_old(#memory_int)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))))))) (.cse11 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse31 (exists ((|v_#length_146| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_146| |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 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse17 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse32 (exists ((|v_#memory_$Pointer$.offset_215| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int)))) (and (= (let ((.cse61 (store |v_#memory_$Pointer$.offset_219| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_219| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse61 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse61 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_215|) (= |v_#memory_$Pointer$.offset_216| (store |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_216| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))))) (.cse18 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse20 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_33| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet9#1_33| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_33| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet9#1_33| 0))))) (.cse33 (exists ((|v_#valid_166| (Array Int Int))) (let ((.cse59 (store |v_#valid_166| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse60 (store .cse59 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse59 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select |v_#valid_166| |c_ULTIMATE.start_create_~dll~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 .cse60 |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))))) (.cse22 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse23 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse25 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse34 (exists ((|v_#memory_$Pointer$.base_226| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_223| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_222| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_223|) (= (let ((.cse58 (store |v_#memory_$Pointer$.base_226| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_226| |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_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_222|)))) (.cse36 (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (let ((.cse54 (select |v_#memory_int_189| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse56 (select |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse55 (select (select |v_#memory_int_192| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse57 (select (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))) (and (= (store |v_#memory_int_188| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_188| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse54 8))) |v_#memory_int_189|) (<= 0 (+ .cse55 2147483648)) (= (store |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse56 0))) |v_#memory_int_193|) (<= .cse55 2147483647) (= (store |v_#memory_int_189| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse54 16 (select (select |v_#memory_int_190| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_190|) (<= .cse57 2147483647) (<= 0 (+ .cse57 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_47| (store |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse56 24 (select (select |v_old(#memory_int)_AFTER_CALL_47| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (= (store |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse55)) |v_#memory_int_192|) (= (store |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse57)) |v_#memory_int_191|)))))) (or (and .cse1 (exists ((|v_#memory_int_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_237| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_237| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse2 (select (select |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= 0 .cse2) (= (select |c_#valid| .cse3) 1) (= (store |v_#memory_$Pointer$.offset_230| .cse3 (store (select |v_#memory_$Pointer$.offset_230| .cse3) .cse2 |c_ULTIMATE.start_create_~data1~0#1.offset|)) |c_#memory_$Pointer$.offset|) (<= (+ 8 .cse2) (select |c_#length| .cse3)) (= |c_#memory_int| (store |v_#memory_int_208| .cse3 (store (select |v_#memory_int_208| .cse3) .cse2 (select (select |c_#memory_int| .cse3) .cse2)))) (= (store |v_#memory_$Pointer$.base_237| .cse3 (store (select |v_#memory_$Pointer$.base_237| .cse3) .cse2 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_#memory_$Pointer$.base_228| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= |v_#memory_int_199| (store |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_199| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse10)) |v_#memory_$Pointer$.base_228|) (let ((.cse19 (exists ((|v_#memory_$Pointer$.base_219| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_219| .cse10 (store (store (select |v_#memory_$Pointer$.base_219| .cse10) 8 0) 16 0)) |v_#memory_$Pointer$.base_227|))) (.cse21 (exists ((|v_#memory_$Pointer$.offset_212| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_212| .cse10 (store (store (select |v_#memory_$Pointer$.offset_212| .cse10) 8 0) 16 0)) |v_#memory_$Pointer$.offset_220|))) (.cse14 (select (select |v_#memory_int_198| .cse10) 16)) (.cse27 (<= (+ .cse10 1) |c_#StackHeapBarrier|)) (.cse28 (not (= .cse10 0)))) (or (and .cse11 .cse12 (exists ((|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_189| .cse10))) (and (= (store |v_#memory_int_188| .cse10 (store (select |v_#memory_int_188| .cse10) 8 (select .cse13 8))) |v_#memory_int_189|) (= (store |v_#memory_int_189| .cse10 (store .cse13 16 .cse14)) |v_#memory_int_198|)))) .cse15 .cse16 .cse17 (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| .cse10) 0) (= |c_#valid| (store |v_#valid_166| .cse10 1)))) .cse18 (exists ((|v_#length_145| (Array Int Int))) (= (store |v_#length_145| .cse10 32) |c_#length|)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse11 .cse31 .cse16 .cse17 .cse32 (exists ((|v_#length_142| (Array Int Int))) (= |c_#length| (store |v_#length_142| .cse10 32))) .cse18 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse34 (exists ((|v_#valid_170| (Array Int Int))) (and (= (select |v_#valid_170| .cse10) 0) (= |c_#valid| (store |v_#valid_170| .cse10 1)))) (exists ((|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_#memory_int_197| .cse10))) (and (= (store |v_#memory_int_196| .cse10 (store (select |v_#memory_int_196| .cse10) 8 (select .cse35 8))) |v_#memory_int_197|) (= (store |v_#memory_int_197| .cse10 (store .cse35 16 .cse14)) |v_#memory_int_198|)))) .cse27 .cse28 .cse36))) (= (select |c_#valid| .cse10) 1) (<= 24 (select |c_#length| .cse10)) (= |v_#memory_$Pointer$.base_237| (store |v_#memory_$Pointer$.base_228| .cse10 (store (select |v_#memory_$Pointer$.base_228| .cse10) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (= (store |v_#memory_int_199| .cse10 (store (select |v_#memory_int_199| .cse10) 16 (select (select |v_#memory_int_208| .cse10) 16))) |v_#memory_int_208|) (= (let ((.cse37 (store |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse37 .cse10 (store (select .cse37 .cse10) 16 0))) |v_#memory_$Pointer$.offset_230|))))) (exists ((|v_#memory_int_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_235| (Array Int (Array Int Int)))) (let ((.cse38 (select (select |v_#memory_$Pointer$.base_236| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_int_207| .cse38 (store (select |v_#memory_int_207| .cse38) 16 (select (select |v_#memory_int_208| .cse38) 16))) |v_#memory_int_208|) (= (store |v_#memory_int_206| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_206| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_207| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_207|) (= (let ((.cse39 (store |v_#memory_$Pointer$.offset_228| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_228| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse39 .cse38 (store (select .cse39 .cse38) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_230|) (<= 24 (select |c_#length| .cse38)) (= (store |v_#memory_$Pointer$.base_236| .cse38 (store (select |v_#memory_$Pointer$.base_236| .cse38) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_237|) (= (store |v_#memory_$Pointer$.base_235| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_235| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse38)) |v_#memory_$Pointer$.base_236|) (= (select |c_#valid| .cse38) 1)))))))) (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse40)) (and .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (let ((.cse43 (select (select |v_#memory_$Pointer$.base_228| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse51 (let ((.cse53 (store |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse53 .cse43 (store (select .cse53 .cse43) 16 0)))) (.cse52 (store |v_#memory_$Pointer$.base_228| .cse43 (store (select |v_#memory_$Pointer$.base_228| .cse43) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse41 (select (select .cse52 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse42 (select (select .cse51 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_int_200| .cse41 (store (select |v_#memory_int_200| .cse41) .cse42 (select (select |c_#memory_int| .cse41) .cse42))) |c_#memory_int|) (<= 0 .cse42) (= |v_#memory_int_199| (store |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_199| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (select |c_#valid| .cse41) 1) (= (store |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse43)) |v_#memory_$Pointer$.base_228|) (let ((.cse46 (exists ((|v_#memory_$Pointer$.base_219| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_219| .cse43 (store (store (select |v_#memory_$Pointer$.base_219| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.base_227|))) (.cse47 (exists ((|v_#memory_$Pointer$.offset_212| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_212| .cse43 (store (store (select |v_#memory_$Pointer$.offset_212| .cse43) 8 0) 16 0)) |v_#memory_$Pointer$.offset_220|))) (.cse45 (select (select |v_#memory_int_198| .cse43) 16)) (.cse48 (<= (+ .cse43 1) |c_#StackHeapBarrier|)) (.cse49 (not (= .cse43 0)))) (or (and .cse11 .cse12 (exists ((|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (let ((.cse44 (select |v_#memory_int_189| .cse43))) (and (= (store |v_#memory_int_188| .cse43 (store (select |v_#memory_int_188| .cse43) 8 (select .cse44 8))) |v_#memory_int_189|) (= (store |v_#memory_int_189| .cse43 (store .cse44 16 .cse45)) |v_#memory_int_198|)))) .cse15 .cse16 .cse17 (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| .cse43) 0) (= |c_#valid| (store |v_#valid_166| .cse43 1)))) .cse18 (exists ((|v_#length_145| (Array Int Int))) (= (store |v_#length_145| .cse43 32) |c_#length|)) .cse46 .cse20 .cse47 .cse22 .cse23 .cse24 .cse25 .cse26 .cse48 .cse49 .cse29 .cse30) (and .cse11 .cse31 .cse16 .cse17 .cse32 (exists ((|v_#length_142| (Array Int Int))) (= |c_#length| (store |v_#length_142| .cse43 32))) .cse18 .cse46 .cse20 .cse47 .cse33 .cse22 .cse23 .cse24 .cse25 .cse34 (exists ((|v_#valid_170| (Array Int Int))) (and (= (select |v_#valid_170| .cse43) 0) (= |c_#valid| (store |v_#valid_170| .cse43 1)))) (exists ((|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse50 (select |v_#memory_int_197| .cse43))) (and (= (store |v_#memory_int_196| .cse43 (store (select |v_#memory_int_196| .cse43) 8 (select .cse50 8))) |v_#memory_int_197|) (= (store |v_#memory_int_197| .cse43 (store .cse50 16 .cse45)) |v_#memory_int_198|)))) .cse48 .cse49 .cse36))) (= (select |c_#valid| .cse43) 1) (= (store |v_#memory_int_199| .cse43 (store (select |v_#memory_int_199| .cse43) 16 (select (select |v_#memory_int_200| .cse43) 16))) |v_#memory_int_200|) (<= 24 (select |c_#length| .cse43)) (= (store .cse51 .cse41 (store (select .cse51 .cse41) .cse42 0)) |c_#memory_$Pointer$.offset|) (<= (+ .cse42 8) (select |c_#length| .cse41)) (= |c_#memory_$Pointer$.base| (store .cse52 .cse41 (store (select .cse52 .cse41) .cse42 |c_ULTIMATE.start_create_~data1~0#1.base|)))))))))))))) is different from false [2024-11-09 06:43:49,732 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)) (.cse12 (exists ((|v_#length_142| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_142| |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 (exists ((|v_#memory_$Pointer$.base_225| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_223| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_222| (Array Int (Array Int Int)))) (and (= (let ((.cse68 (store |v_#memory_$Pointer$.base_225| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_225| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse68 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse68 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_222|) (= (store |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_223|)))) (.cse26 (exists ((|v_#memory_$Pointer$.offset_215| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_218| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_215| (let ((.cse67 (store |v_#memory_$Pointer$.offset_218| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_218| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse67 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse67 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))))) (= |v_#memory_$Pointer$.offset_216| (store |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_216| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))))) (.cse29 (exists ((|v_#valid_169| (Array Int Int))) (let ((.cse66 (store |v_#valid_169| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse65 (store .cse66 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse65 |c_ULTIMATE.start_create_~data2~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 |v_#valid_169| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse66 |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))))) (.cse30 (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int)))) (let ((.cse61 (select (select |v_#memory_int_192| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse64 (select |v_#memory_int_195| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse63 (select (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse62 (select |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= 0 (+ .cse61 2147483648)) (= (store |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse62 0))) |v_#memory_int_193|) (<= .cse61 2147483647) (<= .cse63 2147483647) (<= 0 (+ .cse63 2147483648)) (= (store |v_#memory_int_195| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse64 16 (select (select |v_#memory_int_190| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_190|) (= (store |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse61)) |v_#memory_int_192|) (= (store |v_#memory_int_194| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_194| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse64 8))) |v_#memory_int_195|) (= (store |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse63)) |v_#memory_int_191|) (= |v_old(#memory_int)_AFTER_CALL_46| (store |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse62 24 (select (select |v_old(#memory_int)_AFTER_CALL_46| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))))))) (.cse11 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse31 (exists ((|v_#length_146| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_146| |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 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse17 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse32 (exists ((|v_#memory_$Pointer$.offset_215| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int)))) (and (= (let ((.cse60 (store |v_#memory_$Pointer$.offset_219| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_219| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse60 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse60 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_215|) (= |v_#memory_$Pointer$.offset_216| (store |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_215| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_216| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))))) (.cse18 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse20 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_33| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet9#1_33| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_33| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet9#1_33| 0))))) (.cse33 (exists ((|v_#valid_166| (Array Int Int))) (let ((.cse58 (store |v_#valid_166| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse59 (store .cse58 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select .cse58 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select |v_#valid_166| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select (store .cse59 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse59 |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))))) (.cse22 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse23 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse25 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse34 (exists ((|v_#memory_$Pointer$.base_226| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_223| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_222| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_222| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_223|) (= (let ((.cse57 (store |v_#memory_$Pointer$.base_226| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_226| |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_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_222|)))) (.cse36 (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (let ((.cse53 (select |v_#memory_int_189| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse55 (select |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse54 (select (select |v_#memory_int_192| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse56 (select (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data1~0#1.base|) 0))) (and (= (store |v_#memory_int_188| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_188| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse53 8))) |v_#memory_int_189|) (<= 0 (+ .cse54 2147483648)) (= (store |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_192| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse55 0))) |v_#memory_int_193|) (<= .cse54 2147483647) (= (store |v_#memory_int_189| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse53 16 (select (select |v_#memory_int_190| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_190|) (<= .cse56 2147483647) (<= 0 (+ .cse56 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_47| (store |v_#memory_int_193| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse55 24 (select (select |v_old(#memory_int)_AFTER_CALL_47| |c_ULTIMATE.start_create_~now~0#1.base|) 24)))) (= (store |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_191| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse54)) |v_#memory_int_192|) (= (store |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_190| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse56)) |v_#memory_int_191|)))))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_#memory_$Pointer$.base_228| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (let ((.cse37 (let ((.cse39 (store |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse39 .cse10 (store (select .cse39 .cse10) 16 0)))) (.cse38 (store |v_#memory_$Pointer$.base_228| .cse10 (store (select |v_#memory_$Pointer$.base_228| .cse10) 16 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse8 (select (select .cse38 |c_ULTIMATE.start_create_~now~0#1.base|) 8)) (.cse9 (select (select .cse37 |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= (store |v_#memory_int_200| .cse8 (store (select |v_#memory_int_200| .cse8) .cse9 (select (select |c_#memory_int| .cse8) .cse9))) |c_#memory_int|) (<= 0 .cse9) (= |v_#memory_int_199| (store |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_199| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (select |c_#valid| .cse8) 1) (= (store |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse10)) |v_#memory_$Pointer$.base_228|) (let ((.cse19 (exists ((|v_#memory_$Pointer$.base_219| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_219| .cse10 (store (store (select |v_#memory_$Pointer$.base_219| .cse10) 8 0) 16 0)) |v_#memory_$Pointer$.base_227|))) (.cse21 (exists ((|v_#memory_$Pointer$.offset_212| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_212| .cse10 (store (store (select |v_#memory_$Pointer$.offset_212| .cse10) 8 0) 16 0)) |v_#memory_$Pointer$.offset_220|))) (.cse14 (select (select |v_#memory_int_198| .cse10) 16)) (.cse27 (<= (+ .cse10 1) |c_#StackHeapBarrier|)) (.cse28 (not (= .cse10 0)))) (or (and .cse11 .cse12 (exists ((|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_189| .cse10))) (and (= (store |v_#memory_int_188| .cse10 (store (select |v_#memory_int_188| .cse10) 8 (select .cse13 8))) |v_#memory_int_189|) (= (store |v_#memory_int_189| .cse10 (store .cse13 16 .cse14)) |v_#memory_int_198|)))) .cse15 .cse16 .cse17 (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| .cse10) 0) (= |c_#valid| (store |v_#valid_166| .cse10 1)))) .cse18 (exists ((|v_#length_145| (Array Int Int))) (= (store |v_#length_145| .cse10 32) |c_#length|)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse11 .cse31 .cse16 .cse17 .cse32 (exists ((|v_#length_142| (Array Int Int))) (= |c_#length| (store |v_#length_142| .cse10 32))) .cse18 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse34 (exists ((|v_#valid_170| (Array Int Int))) (and (= (select |v_#valid_170| .cse10) 0) (= |c_#valid| (store |v_#valid_170| .cse10 1)))) (exists ((|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_#memory_int_197| .cse10))) (and (= (store |v_#memory_int_196| .cse10 (store (select |v_#memory_int_196| .cse10) 8 (select .cse35 8))) |v_#memory_int_197|) (= (store |v_#memory_int_197| .cse10 (store .cse35 16 .cse14)) |v_#memory_int_198|)))) .cse27 .cse28 .cse36))) (= (select |c_#valid| .cse10) 1) (= (store |v_#memory_int_199| .cse10 (store (select |v_#memory_int_199| .cse10) 16 (select (select |v_#memory_int_200| .cse10) 16))) |v_#memory_int_200|) (<= 24 (select |c_#length| .cse10)) (= (store .cse37 .cse8 (store (select .cse37 .cse8) .cse9 0)) |c_#memory_$Pointer$.offset|) (<= (+ .cse9 8) (select |c_#length| .cse8)) (= |c_#memory_$Pointer$.base| (store .cse38 .cse8 (store (select .cse38 .cse8) .cse9 |c_ULTIMATE.start_create_~data1~0#1.base|))))))))) (exists ((|v_#memory_int_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_237| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int)))) (let ((.cse41 (select (select |v_#memory_$Pointer$.base_237| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (.cse40 (select (select |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (<= 0 .cse40) (= (select |c_#valid| .cse41) 1) (= (store |v_#memory_$Pointer$.offset_230| .cse41 (store (select |v_#memory_$Pointer$.offset_230| .cse41) .cse40 |c_ULTIMATE.start_create_~data1~0#1.offset|)) |c_#memory_$Pointer$.offset|) (<= (+ 8 .cse40) (select |c_#length| .cse41)) (= |c_#memory_int| (store |v_#memory_int_208| .cse41 (store (select |v_#memory_int_208| .cse41) .cse40 (select (select |c_#memory_int| .cse41) .cse40)))) (= (store |v_#memory_$Pointer$.base_237| .cse41 (store (select |v_#memory_$Pointer$.base_237| .cse41) .cse40 |c_ULTIMATE.start_create_~data1~0#1.base|)) |c_#memory_$Pointer$.base|) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_228| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= |v_#memory_int_199| (store |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_198| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_199| |c_ULTIMATE.start_create_~now~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_227| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse42)) |v_#memory_$Pointer$.base_228|) (let ((.cse45 (exists ((|v_#memory_$Pointer$.base_219| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_219| .cse42 (store (store (select |v_#memory_$Pointer$.base_219| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.base_227|))) (.cse46 (exists ((|v_#memory_$Pointer$.offset_212| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_212| .cse42 (store (store (select |v_#memory_$Pointer$.offset_212| .cse42) 8 0) 16 0)) |v_#memory_$Pointer$.offset_220|))) (.cse44 (select (select |v_#memory_int_198| .cse42) 16)) (.cse47 (<= (+ .cse42 1) |c_#StackHeapBarrier|)) (.cse48 (not (= .cse42 0)))) (or (and .cse11 .cse12 (exists ((|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_189| .cse42))) (and (= (store |v_#memory_int_188| .cse42 (store (select |v_#memory_int_188| .cse42) 8 (select .cse43 8))) |v_#memory_int_189|) (= (store |v_#memory_int_189| .cse42 (store .cse43 16 .cse44)) |v_#memory_int_198|)))) .cse15 .cse16 .cse17 (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| .cse42) 0) (= |c_#valid| (store |v_#valid_166| .cse42 1)))) .cse18 (exists ((|v_#length_145| (Array Int Int))) (= (store |v_#length_145| .cse42 32) |c_#length|)) .cse45 .cse20 .cse46 .cse22 .cse23 .cse24 .cse25 .cse26 .cse47 .cse48 .cse29 .cse30) (and .cse11 .cse31 .cse16 .cse17 .cse32 (exists ((|v_#length_142| (Array Int Int))) (= |c_#length| (store |v_#length_142| .cse42 32))) .cse18 .cse45 .cse20 .cse46 .cse33 .cse22 .cse23 .cse24 .cse25 .cse34 (exists ((|v_#valid_170| (Array Int Int))) (and (= (select |v_#valid_170| .cse42) 0) (= |c_#valid| (store |v_#valid_170| .cse42 1)))) (exists ((|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse49 (select |v_#memory_int_197| .cse42))) (and (= (store |v_#memory_int_196| .cse42 (store (select |v_#memory_int_196| .cse42) 8 (select .cse49 8))) |v_#memory_int_197|) (= (store |v_#memory_int_197| .cse42 (store .cse49 16 .cse44)) |v_#memory_int_198|)))) .cse47 .cse48 .cse36))) (= (select |c_#valid| .cse42) 1) (<= 24 (select |c_#length| .cse42)) (= |v_#memory_$Pointer$.base_237| (store |v_#memory_$Pointer$.base_228| .cse42 (store (select |v_#memory_$Pointer$.base_228| .cse42) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (= (store |v_#memory_int_199| .cse42 (store (select |v_#memory_int_199| .cse42) 16 (select (select |v_#memory_int_208| .cse42) 16))) |v_#memory_int_208|) (= (let ((.cse50 (store |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_220| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse50 .cse42 (store (select .cse50 .cse42) 16 0))) |v_#memory_$Pointer$.offset_230|))))) (exists ((|v_#memory_int_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_235| (Array Int (Array Int Int)))) (let ((.cse51 (select (select |v_#memory_$Pointer$.base_236| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= (store |v_#memory_int_207| .cse51 (store (select |v_#memory_int_207| .cse51) 16 (select (select |v_#memory_int_208| .cse51) 16))) |v_#memory_int_208|) (= (store |v_#memory_int_206| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_206| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_207| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_207|) (= (let ((.cse52 (store |v_#memory_$Pointer$.offset_228| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_228| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse52 .cse51 (store (select .cse52 .cse51) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |v_#memory_$Pointer$.offset_230|) (<= 24 (select |c_#length| .cse51)) (= (store |v_#memory_$Pointer$.base_236| .cse51 (store (select |v_#memory_$Pointer$.base_236| .cse51) 16 |c_ULTIMATE.start_create_~now~0#1.base|)) |v_#memory_$Pointer$.base_237|) (= (store |v_#memory_$Pointer$.base_235| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_235| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse51)) |v_#memory_$Pointer$.base_236|) (= (select |c_#valid| .cse51) 1)))))))))))) is different from false [2024-11-09 06:43:49,760 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10003#(= |ULTIMATE.start_create_#t~ret10#1.offset| 0)' at error location [2024-11-09 06:43:49,760 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:43:49,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:43:49,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2024-11-09 06:43:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397736014] [2024-11-09 06:43:49,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:43:49,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 06:43:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 06:43:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1542, Unknown=20, NotChecked=246, Total=1980 [2024-11-09 06:43:49,764 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:52,752 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2024-11-09 06:43:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:43:52,752 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2024-11-09 06:43:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:52,753 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:43:52,754 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:43:52,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 171.0s TimeCoverageRelationStatistics Valid=307, Invalid=2655, Unknown=20, NotChecked=324, Total=3306 [2024-11-09 06:43:52,756 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:52,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 434 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 511 Invalid, 0 Unknown, 84 Unchecked, 1.4s Time] [2024-11-09 06:43:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:43:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 06:43:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 133 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2024-11-09 06:43:52,763 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 34 [2024-11-09 06:43:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:52,763 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2024-11-09 06:43:52,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2024-11-09 06:43:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 06:43:52,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:52,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:52,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:43:52,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 06:43:52,969 INFO L396 AbstractCegarLoop]: === Iteration 38 === 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-09 06:43:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1604299041, now seen corresponding path program 1 times [2024-11-09 06:43:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448772059] [2024-11-09 06:43:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:54,241 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-09 06:43:54,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448772059] [2024-11-09 06:43:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448772059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:54,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:54,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:43:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161882597] [2024-11-09 06:43:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:54,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:43:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:43:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:43:54,246 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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-09 06:43:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:55,886 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2024-11-09 06:43:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:43:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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 33 [2024-11-09 06:43:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:55,888 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:43:55,888 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:43:55,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:43:55,889 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 37 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:55,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 369 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 06:43:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:43:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 06:43:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 133 states have internal predecessors, (149), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2024-11-09 06:43:55,897 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 33 [2024-11-09 06:43:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:55,897 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2024-11-09 06:43:55,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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-09 06:43:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2024-11-09 06:43:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:43:55,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:55,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:55,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 06:43:55,900 INFO L396 AbstractCegarLoop]: === Iteration 39 === 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-09 06:43:55,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash 161915968, now seen corresponding path program 1 times [2024-11-09 06:43:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803735413] [2024-11-09 06:43:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:56,253 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-09 06:43:56,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:56,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803735413] [2024-11-09 06:43:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803735413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:56,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:56,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:43:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602048255] [2024-11-09 06:43:56,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:56,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:43:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:43:56,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:43:56,256 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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-09 06:43:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:57,096 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2024-11-09 06:43:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:43:57,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-09 06:43:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:57,098 INFO L225 Difference]: With dead ends: 143 [2024-11-09 06:43:57,098 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 06:43:57,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:43:57,099 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:57,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 236 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:43:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 06:43:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-11-09 06:43:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 136 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2024-11-09 06:43:57,107 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2024-11-09 06:43:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:57,107 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2024-11-09 06:43:57,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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-09 06:43:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2024-11-09 06:43:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:43:57,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:57,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:57,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 06:43:57,109 INFO L396 AbstractCegarLoop]: === Iteration 40 === 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-09 06:43:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash 838820878, now seen corresponding path program 1 times [2024-11-09 06:43:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648207432] [2024-11-09 06:43:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 06:43:58,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:58,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648207432] [2024-11-09 06:43:58,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648207432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:43:58,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:43:58,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:43:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231644463] [2024-11-09 06:43:58,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:43:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:43:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:43:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:43:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:43:58,617 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:43:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:59,344 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2024-11-09 06:43:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:43:59,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-09 06:43:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:59,346 INFO L225 Difference]: With dead ends: 141 [2024-11-09 06:43:59,346 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 06:43:59,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:43:59,347 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:59,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 290 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:43:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 06:43:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-09 06:43:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 135 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:43:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2024-11-09 06:43:59,354 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 38 [2024-11-09 06:43:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:59,355 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2024-11-09 06:43:59,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:43:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2024-11-09 06:43:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:43:59,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:59,357 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, 1, 1, 1, 1, 1, 1] [2024-11-09 06:43:59,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 06:43:59,357 INFO L396 AbstractCegarLoop]: === Iteration 41 === 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-09 06:43:59,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash 789412547, now seen corresponding path program 1 times [2024-11-09 06:43:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:59,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210831239] [2024-11-09 06:43:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:43:59,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210831239] [2024-11-09 06:43:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210831239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79100090] [2024-11-09 06:43:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:59,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:59,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:43:59,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:43:59,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:44:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:44:00,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 06:44:00,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:44:01,228 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:44:01,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:44:01,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:44:01,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:44:01,563 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 19 treesize of output 7 [2024-11-09 06:44:01,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:44:01,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-09 06:44:02,197 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 06:44:02,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2024-11-09 06:44:02,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:44:02,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:02,529 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 41 treesize of output 40 [2024-11-09 06:44:02,959 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 30 treesize of output 12 [2024-11-09 06:44:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:44:03,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:44:03,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2752 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_2752) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-09 06:44:03,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2752 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_2752) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-09 06:44:03,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2751))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_2752)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-09 06:44:03,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2751))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2752))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-09 06:44:04,094 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-09 06:44:04,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 789 treesize of output 736 [2024-11-09 06:44:04,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:04,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 362 treesize of output 370 [2024-11-09 06:44:04,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:04,257 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 319 treesize of output 284 [2024-11-09 06:44:04,284 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 275 treesize of output 251 [2024-11-09 06:44:04,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 06:44:04,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:04,974 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 30 treesize of output 30 [2024-11-09 06:44:05,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79100090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:44:05,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1196617750] [2024-11-09 06:44:05,576 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-09 06:44:05,576 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:44:05,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:44:05,577 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:44:05,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:44:17,775 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 06:44:17,793 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:44:44,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (<= 0 .cse0) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~0#1.base|) 1)) (.cse2 (select |c_#length| |c_ULTIMATE.start_create_~now~0#1.base|))) (or (and .cse1 (<= (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|) .cse2) (exists ((|v_#memory_int_239| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_270| (Array Int (Array Int Int))) (|v_#memory_int_238| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_269| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_270| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_270| .cse3 (store (select |v_#memory_$Pointer$.base_270| .cse3) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (= |c_#memory_int| (store |v_#memory_int_239| .cse3 (store (select |v_#memory_int_239| .cse3) 16 (select (select |c_#memory_int| .cse3) 16)))) (<= 24 (select |c_#length| .cse3)) (= (let ((.cse4 (store |v_#memory_$Pointer$.offset_259| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_259| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse4 .cse3 (store (select .cse4 .cse3) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_int_238| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_238| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_239| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_239|) (= (select |c_#valid| .cse3) 1) (= (store |v_#memory_$Pointer$.base_269| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_269| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse3)) |v_#memory_$Pointer$.base_270|))))) (and (= |c_ULTIMATE.start_create_~data1~0#1.offset| 0) .cse1 (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_~now~0#1.offset| 0) (= |c_ULTIMATE.start_create_~dll~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_261| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (let ((.cse5 (select (select |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_262| .cse5 (store (select |v_#memory_$Pointer$.base_262| .cse5) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.cse6 (not (= .cse5 0))) (.cse7 (= |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)) (.cse14 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse15 (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|)) (.cse18 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_38| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet9#1_38| 2147483647) (not (= |v_ULTIMATE.start_create_#t~nondet9#1_38| 0)) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_38| 2147483648))))) (.cse19 (<= (+ .cse5 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))) (.cse13 (select (select |v_#memory_int_230| .cse5) 16))) (or (and .cse6 (exists ((|v_#valid_182| (Array Int Int))) (and (= (select |v_#valid_182| .cse5) 0) (= |c_#valid| (store |v_#valid_182| .cse5 1)))) .cse7 (exists ((|v_#valid_178| (Array Int Int))) (let ((.cse9 (store |v_#valid_178| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse8 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_178| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse9 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse8 |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_260| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_257| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_256| (Array Int (Array Int Int)))) (and (= (let ((.cse10 (store |v_#memory_$Pointer$.base_260| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_260| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse10 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse10 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_256|) (= (store |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_257| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_257|))) .cse11 (exists ((|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_229| .cse5))) (and (= (store |v_#memory_int_229| .cse5 (store .cse12 16 .cse13)) |v_#memory_int_230|) (= (store |v_#memory_int_228| .cse5 (store (select |v_#memory_int_228| .cse5) 8 (select .cse12 8))) |v_#memory_int_229|)))) .cse14 .cse15 (exists ((|v_#length_156| (Array Int Int))) (= (store |v_#length_156| .cse5 32) |c_#length|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_261| (store |v_#memory_$Pointer$.base_253| .cse5 (store (store (select |v_#memory_$Pointer$.base_253| .cse5) 8 0) 16 0)))) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_85| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (let ((.cse23 (select (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse22 (select (select |v_#memory_int_224| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse24 (select |v_#memory_int_221| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse25 (select |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= .cse22 2147483647) (= (store |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse23)) |v_#memory_int_223|) (<= 0 (+ .cse23 2147483648)) (<= 0 (+ 2147483648 .cse22)) (= |v_#memory_int_221| (store |v_#memory_int_220| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_220| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse24 8)))) (<= .cse23 2147483647) (= (store |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse25 0))) |v_#memory_int_225|) (= (store |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse22)) |v_#memory_int_224|) (= (store |v_#memory_int_221| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse24 16 (select (select |v_#memory_int_222| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_222|) (= (store |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse25 24 (select (select |v_#memory_int_BEFORE_CALL_85| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_85|)))) (exists ((|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_243| .cse5 (store (store (select |v_#memory_$Pointer$.offset_243| .cse5) 8 0) 16 0)) |v_#memory_$Pointer$.offset_251|)) (exists ((|v_#memory_$Pointer$.offset_247| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_247| (store |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_247| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))) (= (let ((.cse26 (store |v_#memory_$Pointer$.offset_250| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_250| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse26 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse26 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_246|))) (exists ((|v_#length_152| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_152| |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|)))) (and (exists ((|v_#valid_181| (Array Int Int))) (let ((.cse27 (store |v_#valid_181| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse28 (store .cse27 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select |v_#valid_181| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse27 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse28 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse28 |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_257| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_256| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (and (= (let ((.cse29 (store |v_#memory_$Pointer$.base_253| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_253| |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$.base_256| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_256|) (= (store |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_257| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_257|))) .cse6 (exists ((|v_#length_155| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_155| |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|))) (exists ((|v_#valid_178| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_178| .cse5 1)) (= (select |v_#valid_178| .cse5) 0))) .cse7 (exists ((|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_259| .cse5 (store (store (select |v_#memory_$Pointer$.base_259| .cse5) 8 0) 16 0)) |v_#memory_$Pointer$.base_261|)) .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int)))) (let ((.cse30 (select |v_#memory_int_221| .cse5))) (and (= (store |v_#memory_int_220| .cse5 (store (select |v_#memory_int_220| .cse5) 8 (select .cse30 8))) |v_#memory_int_221|) (= (store |v_#memory_int_221| .cse5 (store .cse30 16 .cse13)) |v_#memory_int_230|)))) (exists ((|v_#memory_$Pointer$.offset_247| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_247| (store |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_247| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))) (= (let ((.cse31 (store |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse31 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse31 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_246|))) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_83| (Array Int (Array Int Int)))) (let ((.cse33 (select (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse34 (select |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse32 (select (select |v_#memory_int_224| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse35 (select |v_#memory_int_227| |c_ULTIMATE.start_create_~dll~0#1.base|))) (and (<= .cse32 2147483647) (= (store |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse33)) |v_#memory_int_223|) (<= 0 (+ .cse33 2147483648)) (<= 0 (+ 2147483648 .cse32)) (<= .cse33 2147483647) (= (store |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse34 24 (select (select |v_#memory_int_BEFORE_CALL_83| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_83|) (= (store |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse34 0))) |v_#memory_int_225|) (= |v_#memory_int_222| (store |v_#memory_int_227| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse35 16 (select (select |v_#memory_int_222| |c_ULTIMATE.start_create_~dll~0#1.base|) 16)))) (= (store |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse32)) |v_#memory_int_224|) (= (store |v_#memory_int_226| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_226| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse35 8))) |v_#memory_int_227|)))) (exists ((|v_#length_152| (Array Int Int))) (= (store |v_#length_152| .cse5 32) |c_#length|)) (exists ((|v_#memory_$Pointer$.offset_249| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_251| (store |v_#memory_$Pointer$.offset_249| .cse5 (store (store (select |v_#memory_$Pointer$.offset_249| .cse5) 8 0) 16 0))))))) (= (store |v_#memory_int_231| .cse5 (store (select |v_#memory_int_231| .cse5) 16 (select (select |c_#memory_int| .cse5) 16))) |c_#memory_int|) (= (store |v_#memory_int_230| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_230| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_231| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_231|) (= (select |c_#valid| .cse5) 1) (= (store |v_#memory_$Pointer$.base_261| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_261| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse5)) |v_#memory_$Pointer$.base_262|) (= (let ((.cse36 (store |v_#memory_$Pointer$.offset_251| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_251| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse36 .cse5 (store (select .cse36 .cse5) 16 0))) |c_#memory_$Pointer$.offset|) (<= 24 (select |c_#length| .cse5))))) (<= 16 .cse2) (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)))))) is different from false [2024-11-09 06:44:46,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (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) (<= (+ 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~mem12#1.offset|) (or (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) (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_261| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (let ((.cse2 (select (select |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_262| .cse2 (store (select |v_#memory_$Pointer$.base_262| .cse2) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (let ((.cse3 (not (= .cse2 0))) (.cse4 (= |c_ULTIMATE.start_create_~dll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse8 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse11 (not (= |c_ULTIMATE.start_create_~data2~0#1.base| 0))) (.cse12 (not (= |c_ULTIMATE.start_create_~dll~0#1.base| 0))) (.cse13 (<= (+ |c_ULTIMATE.start_create_~data1~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse14 (<= (+ |c_ULTIMATE.start_create_~dll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse15 (exists ((|v_ULTIMATE.start_create_#t~nondet9#1_38| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet9#1_38| 2147483647) (not (= |v_ULTIMATE.start_create_#t~nondet9#1_38| 0)) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet9#1_38| 2147483648))))) (.cse16 (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (.cse17 (<= (+ |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse18 (not (= |c_ULTIMATE.start_create_~data1~0#1.base| 0))) (.cse10 (select (select |v_#memory_int_230| .cse2) 16))) (or (and .cse3 (exists ((|v_#valid_182| (Array Int Int))) (and (= (select |v_#valid_182| .cse2) 0) (= |c_#valid| (store |v_#valid_182| .cse2 1)))) .cse4 (exists ((|v_#valid_178| (Array Int Int))) (let ((.cse6 (store |v_#valid_178| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select (store .cse5 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select |v_#valid_178| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse6 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select .cse5 |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_260| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_257| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_256| (Array Int (Array Int Int)))) (and (= (let ((.cse7 (store |v_#memory_$Pointer$.base_260| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_260| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse7 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_256|) (= (store |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_257| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_257|))) .cse8 (exists ((|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_229| .cse2))) (and (= (store |v_#memory_int_229| .cse2 (store .cse9 16 .cse10)) |v_#memory_int_230|) (= (store |v_#memory_int_228| .cse2 (store (select |v_#memory_int_228| .cse2) 8 (select .cse9 8))) |v_#memory_int_229|)))) .cse11 .cse12 (exists ((|v_#length_156| (Array Int Int))) (= (store |v_#length_156| .cse2 32) |c_#length|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_261| (store |v_#memory_$Pointer$.base_253| .cse2 (store (store (select |v_#memory_$Pointer$.base_253| .cse2) 8 0) 16 0)))) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_85| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (let ((.cse20 (select (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse19 (select (select |v_#memory_int_224| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse21 (select |v_#memory_int_221| |c_ULTIMATE.start_create_~dll~0#1.base|)) (.cse22 (select |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base|))) (and (<= .cse19 2147483647) (= (store |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse20)) |v_#memory_int_223|) (<= 0 (+ .cse20 2147483648)) (<= 0 (+ 2147483648 .cse19)) (= |v_#memory_int_221| (store |v_#memory_int_220| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_220| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse21 8)))) (<= .cse20 2147483647) (= (store |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse22 0))) |v_#memory_int_225|) (= (store |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse19)) |v_#memory_int_224|) (= (store |v_#memory_int_221| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse21 16 (select (select |v_#memory_int_222| |c_ULTIMATE.start_create_~dll~0#1.base|) 16))) |v_#memory_int_222|) (= (store |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse22 24 (select (select |v_#memory_int_BEFORE_CALL_85| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_85|)))) (exists ((|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_243| .cse2 (store (store (select |v_#memory_$Pointer$.offset_243| .cse2) 8 0) 16 0)) |v_#memory_$Pointer$.offset_251|)) (exists ((|v_#memory_$Pointer$.offset_247| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_247| (store |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_247| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))) (= (let ((.cse23 (store |v_#memory_$Pointer$.offset_250| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_250| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse23 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse23 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_246|))) (exists ((|v_#length_152| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_152| |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|)))) (and (exists ((|v_#valid_181| (Array Int Int))) (let ((.cse24 (store |v_#valid_181| |c_ULTIMATE.start_create_~dll~0#1.base| 1))) (let ((.cse25 (store .cse24 |c_ULTIMATE.start_create_~data1~0#1.base| 1))) (and (= (select |v_#valid_181| |c_ULTIMATE.start_create_~dll~0#1.base|) 0) (= (select .cse24 |c_ULTIMATE.start_create_~data1~0#1.base|) 0) (= (select (store .cse25 |c_ULTIMATE.start_create_~data2~0#1.base| 1) |c_ULTIMATE.start_create_~now~0#1.base|) 1) (= (select .cse25 |c_ULTIMATE.start_create_~data2~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_257| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_256| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (and (= (let ((.cse26 (store |v_#memory_$Pointer$.base_253| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.base_253| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 0) 16 0)))) (store .cse26 |c_ULTIMATE.start_create_~data1~0#1.base| (store (select .cse26 |c_ULTIMATE.start_create_~data1~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.base_256|) (= (store |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.base_256| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_257| |c_ULTIMATE.start_create_~data2~0#1.base|) 0))) |v_#memory_$Pointer$.base_257|))) .cse3 (exists ((|v_#length_155| (Array Int Int))) (<= 32 (select (store (store (store |v_#length_155| |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|))) (exists ((|v_#valid_178| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_178| .cse2 1)) (= (select |v_#valid_178| .cse2) 0))) .cse4 (exists ((|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_259| .cse2 (store (store (select |v_#memory_$Pointer$.base_259| .cse2) 8 0) 16 0)) |v_#memory_$Pointer$.base_261|)) .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int)))) (let ((.cse27 (select |v_#memory_int_221| .cse2))) (and (= (store |v_#memory_int_220| .cse2 (store (select |v_#memory_int_220| .cse2) 8 (select .cse27 8))) |v_#memory_int_221|) (= (store |v_#memory_int_221| .cse2 (store .cse27 16 .cse10)) |v_#memory_int_230|)))) (exists ((|v_#memory_$Pointer$.offset_247| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_247| (store |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_247| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)))) (= (let ((.cse28 (store |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_create_~dll~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_243| |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$.offset_246| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)))) |v_#memory_$Pointer$.offset_246|))) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_83| (Array Int (Array Int Int)))) (let ((.cse30 (select (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data1~0#1.base|) 0)) (.cse31 (select |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse29 (select (select |v_#memory_int_224| |c_ULTIMATE.start_create_~data2~0#1.base|) 0)) (.cse32 (select |v_#memory_int_227| |c_ULTIMATE.start_create_~dll~0#1.base|))) (and (<= .cse29 2147483647) (= (store |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base| (store (select |v_#memory_int_222| |c_ULTIMATE.start_create_~data1~0#1.base|) 0 .cse30)) |v_#memory_int_223|) (<= 0 (+ .cse30 2147483648)) (<= 0 (+ 2147483648 .cse29)) (<= .cse30 2147483647) (= (store |v_#memory_int_225| |c_ULTIMATE.start_create_~now~0#1.base| (store .cse31 24 (select (select |v_#memory_int_BEFORE_CALL_83| |c_ULTIMATE.start_create_~now~0#1.base|) 24))) |v_#memory_int_BEFORE_CALL_83|) (= (store |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_224| |c_ULTIMATE.start_create_~now~0#1.base|) 0 (select .cse31 0))) |v_#memory_int_225|) (= |v_#memory_int_222| (store |v_#memory_int_227| |c_ULTIMATE.start_create_~dll~0#1.base| (store .cse32 16 (select (select |v_#memory_int_222| |c_ULTIMATE.start_create_~dll~0#1.base|) 16)))) (= (store |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base| (store (select |v_#memory_int_223| |c_ULTIMATE.start_create_~data2~0#1.base|) 0 .cse29)) |v_#memory_int_224|) (= (store |v_#memory_int_226| |c_ULTIMATE.start_create_~dll~0#1.base| (store (select |v_#memory_int_226| |c_ULTIMATE.start_create_~dll~0#1.base|) 8 (select .cse32 8))) |v_#memory_int_227|)))) (exists ((|v_#length_152| (Array Int Int))) (= (store |v_#length_152| .cse2 32) |c_#length|)) (exists ((|v_#memory_$Pointer$.offset_249| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_251| (store |v_#memory_$Pointer$.offset_249| .cse2 (store (store (select |v_#memory_$Pointer$.offset_249| .cse2) 8 0) 16 0))))))) (= (store |v_#memory_int_231| .cse2 (store (select |v_#memory_int_231| .cse2) 16 (select (select |c_#memory_int| .cse2) 16))) |c_#memory_int|) (= (store |v_#memory_int_230| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_230| |c_ULTIMATE.start_create_~now~0#1.base|) 8 (select (select |v_#memory_int_231| |c_ULTIMATE.start_create_~now~0#1.base|) 8))) |v_#memory_int_231|) (= (select |c_#valid| .cse2) 1) (= (store |v_#memory_$Pointer$.base_261| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_261| |c_ULTIMATE.start_create_~now~0#1.base|) 8 .cse2)) |v_#memory_$Pointer$.base_262|) (= (let ((.cse33 (store |v_#memory_$Pointer$.offset_251| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_251| |c_ULTIMATE.start_create_~now~0#1.base|) 8 0)))) (store .cse33 .cse2 (store (select .cse33 .cse2) 16 0))) |c_#memory_$Pointer$.offset|) (<= 24 (select |c_#length| .cse2))))) (<= 16 .cse1) (= |c_ULTIMATE.start_create_~data2~0#1.offset| 0)) (exists ((|v_#memory_int_239| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_270| (Array Int (Array Int Int))) (|v_#memory_int_238| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_269| (Array Int (Array Int Int)))) (let ((.cse34 (select (select |v_#memory_$Pointer$.base_270| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_270| .cse34 (store (select |v_#memory_$Pointer$.base_270| .cse34) 16 |c_ULTIMATE.start_create_~now~0#1.base|))) (= |c_#memory_int| (store |v_#memory_int_239| .cse34 (store (select |v_#memory_int_239| .cse34) 16 (select (select |c_#memory_int| .cse34) 16)))) (<= 24 (select |c_#length| .cse34)) (= (let ((.cse35 (store |v_#memory_$Pointer$.offset_259| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.offset_259| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 0)))) (store .cse35 .cse34 (store (select .cse35 .cse34) 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_int_238| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_238| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select (select |v_#memory_int_239| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) |v_#memory_int_239|) (= (select |c_#valid| .cse34) 1) (= (store |v_#memory_$Pointer$.base_269| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_$Pointer$.base_269| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 .cse34)) |v_#memory_$Pointer$.base_270|))))) (= (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-09 06:44:49,037 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11211#true' at error location [2024-11-09 06:44:49,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:44:49,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:44:49,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20] total 27 [2024-11-09 06:44:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835250609] [2024-11-09 06:44:49,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:44:49,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 06:44:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:44:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 06:44:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2773, Unknown=30, NotChecked=666, Total=3660 [2024-11-09 06:44:49,042 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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-09 06:44:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:44:53,347 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2024-11-09 06:44:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:44:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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 38 [2024-11-09 06:44:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:44:53,349 INFO L225 Difference]: With dead ends: 145 [2024-11-09 06:44:53,349 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 06:44:53,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=324, Invalid=4225, Unknown=31, NotChecked=822, Total=5402 [2024-11-09 06:44:53,353 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:44:53,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 557 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 06:44:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 06:44:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-11-09 06:44:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.293103448275862) internal successors, (150), 135 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:44:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2024-11-09 06:44:53,361 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 38 [2024-11-09 06:44:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:44:53,361 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2024-11-09 06:44:53,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 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-09 06:44:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2024-11-09 06:44:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 06:44:53,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:44:53,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:44:53,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 06:44:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:44:53,564 INFO L396 AbstractCegarLoop]: === Iteration 42 === 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-09 06:44:53,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:44:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1317007900, now seen corresponding path program 1 times [2024-11-09 06:44:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:44:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108803336] [2024-11-09 06:44:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:44:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:44:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:44:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:44:55,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:44:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108803336] [2024-11-09 06:44:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108803336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:44:55,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56474307] [2024-11-09 06:44:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:44:55,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:44:55,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:44:55,813 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:44:55,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a325264a-b310-4e27-9023-cfef363ca913/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:44:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:44:56,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 06:44:56,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:44:56,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:44:56,594 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-09 06:44:56,704 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-09 06:44:56,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:56,998 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 31 treesize of output 32 [2024-11-09 06:44:57,217 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:57,218 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-09 06:44:57,512 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:44:57,513 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-09 06:44:57,847 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-09 06:44:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:44:57,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:44:58,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_2916) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8))) 1)) is different from false [2024-11-09 06:44:58,403 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-09 06:44:58,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-09 06:44:58,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_2916)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) |c_ULTIMATE.start_create_#t~mem12#1.base|)) is different from false [2024-11-09 06:44:58,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2915))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2916)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)))))) is different from false [2024-11-09 06:44:58,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2914)) (.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2916)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) .cse3)))) is different from false [2024-11-09 06:44:58,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2914))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_2915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2916)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) .cse3))))) is different from false [2024-11-09 06:44:58,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:58,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 68 [2024-11-09 06:44:58,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:58,564 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 3570 treesize of output 2843 [2024-11-09 06:44:58,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:58,736 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 1031 treesize of output 951 [2024-11-09 06:44:58,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:44:58,796 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 943 treesize of output 671 [2024-11-09 06:44:58,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 663 treesize of output 615 [2024-11-09 06:45:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56474307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:45:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2042983985] [2024-11-09 06:45:00,370 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 06:45:00,370 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:45:00,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:45:00,371 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:45:00,371 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs