./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:24:21,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:24:21,491 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 04:24:21,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:24:21,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:24:21,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:24:21,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:24:21,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:24:21,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:24:21,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:24:21,557 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:24:21,557 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:24:21,557 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:24:21,558 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:24:21,560 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:24:21,560 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:24:21,560 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:24:21,561 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:24:21,561 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:24:21,561 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:24:21,561 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:24:21,561 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:24:21,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:24:21,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:24:21,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:24:21,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:24:21,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:24:21,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:24:21,563 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:24:21,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:24:21,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:24:21,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:24:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:24:21,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:24:21,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:24:21,566 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:24:21,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:24:21,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:24:21,566 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:24:21,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:24:21,567 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-14 04:24:21,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:24:21,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:24:21,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:24:21,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:24:21,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:24:21,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i Unable to find full path for "g++" [2024-11-14 04:24:24,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:24:24,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:24:24,857 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-14 04:24:24,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/data/6991bc572/0af3bdc6fca84d98beb2d5397835c031/FLAG27c5cde77 [2024-11-14 04:24:24,912 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/data/6991bc572/0af3bdc6fca84d98beb2d5397835c031 [2024-11-14 04:24:24,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:24:24,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:24:24,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:24:24,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:24:24,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:24:24,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:24:24" (1/1) ... [2024-11-14 04:24:24,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28730e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:24, skipping insertion in model container [2024-11-14 04:24:24,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:24:24" (1/1) ... [2024-11-14 04:24:24,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:24:25,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:24:25,377 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:24:25,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:24:25,490 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:24:25,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25 WrapperNode [2024-11-14 04:24:25,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:24:25,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:24:25,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:24:25,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:24:25,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,563 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 116 [2024-11-14 04:24:25,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:24:25,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:24:25,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:24:25,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:24:25,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:24:25,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:24:25,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:24:25,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:24:25,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (1/1) ... [2024-11-14 04:24:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:24:25,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:25,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:24:25,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:24:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:24:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:24:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 04:24:25,725 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 04:24:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:24:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:24:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:24:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:24:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:24:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:24:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 04:24:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:24:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:24:25,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:24:25,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:24:25,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:24:26,345 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-11-14 04:24:26,345 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:24:26,412 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:24:26,413 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 04:24:26,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:24:26 BoogieIcfgContainer [2024-11-14 04:24:26,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:24:26,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:24:26,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:24:26,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:24:26,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:24:24" (1/3) ... [2024-11-14 04:24:26,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:24:26, skipping insertion in model container [2024-11-14 04:24:26,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:25" (2/3) ... [2024-11-14 04:24:26,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:24:26, skipping insertion in model container [2024-11-14 04:24:26,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:24:26" (3/3) ... [2024-11-14 04:24:26,425 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-14 04:24:26,445 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:24:26,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 68 locations, 1 initial locations, 3 loop locations, and 31 error locations. [2024-11-14 04:24:26,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:24:26,517 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;@555fba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:24:26,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-14 04:24:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:24:26,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:26,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:24:26,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 981735965, now seen corresponding path program 1 times [2024-11-14 04:24:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646770604] [2024-11-14 04:24:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:24:26,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646770604] [2024-11-14 04:24:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646770604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:24:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662893784] [2024-11-14 04:24:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:26,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:26,940 INFO L87 Difference]: Start difference. First operand has 68 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 64 states have internal predecessors, (72), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:24:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:27,060 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-14 04:24:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:27,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2024-11-14 04:24:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:27,075 INFO L225 Difference]: With dead ends: 73 [2024-11-14 04:24:27,075 INFO L226 Difference]: Without dead ends: 71 [2024-11-14 04:24:27,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:27,083 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:27,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 116 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-14 04:24:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-11-14 04:24:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.09375) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-14 04:24:27,132 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 6 [2024-11-14 04:24:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:27,132 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-14 04:24:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:24:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-14 04:24:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:24:27,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:27,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:24:27,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:24:27,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash 843148233, now seen corresponding path program 1 times [2024-11-14 04:24:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974415808] [2024-11-14 04:24:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:24:27,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974415808] [2024-11-14 04:24:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974415808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:24:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98822617] [2024-11-14 04:24:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:27,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:27,318 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:24:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:27,444 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-14 04:24:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:27,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-14 04:24:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:27,448 INFO L225 Difference]: With dead ends: 64 [2024-11-14 04:24:27,448 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 04:24:27,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:27,450 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:27,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 04:24:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 04:24:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.03125) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-11-14 04:24:27,464 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 6 [2024-11-14 04:24:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:27,465 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-14 04:24:27,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:24:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-11-14 04:24:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:24:27,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:27,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:24:27,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:24:27,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:27,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 843148234, now seen corresponding path program 1 times [2024-11-14 04:24:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:27,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982906113] [2024-11-14 04:24:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:24:27,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982906113] [2024-11-14 04:24:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982906113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:24:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536868116] [2024-11-14 04:24:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:27,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:27,652 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:24:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:27,738 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-14 04:24:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-14 04:24:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:27,739 INFO L225 Difference]: With dead ends: 62 [2024-11-14 04:24:27,739 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 04:24:27,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:27,740 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:27,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 04:24:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-14 04:24:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 1.96875) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-14 04:24:27,746 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 6 [2024-11-14 04:24:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:27,747 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-14 04:24:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:24:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-14 04:24:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:24:27,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:27,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:24:27,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:27,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 417254491, now seen corresponding path program 1 times [2024-11-14 04:24:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340335850] [2024-11-14 04:24:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:24:27,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:27,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340335850] [2024-11-14 04:24:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340335850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:24:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214308834] [2024-11-14 04:24:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:27,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:24:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:24:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:27,911 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:24:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:28,148 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-11-14 04:24:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:24:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 04:24:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:28,150 INFO L225 Difference]: With dead ends: 61 [2024-11-14 04:24:28,150 INFO L226 Difference]: Without dead ends: 61 [2024-11-14 04:24:28,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:28,151 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:28,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 164 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:24:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-14 04:24:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-14 04:24:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 1.9375) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-14 04:24:28,165 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 10 [2024-11-14 04:24:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:28,166 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-14 04:24:28,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:24:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-14 04:24:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:24:28,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:28,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:28,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:24:28,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:28,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 417254492, now seen corresponding path program 1 times [2024-11-14 04:24:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566904829] [2024-11-14 04:24:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:24:28,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566904829] [2024-11-14 04:24:28,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566904829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:28,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:28,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:24:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982848476] [2024-11-14 04:24:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:28,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:24:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:24:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:28,532 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:24:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:28,716 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-11-14 04:24:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:24:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 04:24:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:28,718 INFO L225 Difference]: With dead ends: 60 [2024-11-14 04:24:28,718 INFO L226 Difference]: Without dead ends: 60 [2024-11-14 04:24:28,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:28,719 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:28,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 191 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:24:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-14 04:24:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-14 04:24:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.90625) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-14 04:24:28,733 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 10 [2024-11-14 04:24:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-14 04:24:28,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:24:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-14 04:24:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:24:28,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:28,735 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:28,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:24:28,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:28,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -94210338, now seen corresponding path program 1 times [2024-11-14 04:24:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452883863] [2024-11-14 04:24:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:24:28,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452883863] [2024-11-14 04:24:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452883863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809624800] [2024-11-14 04:24:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:28,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:28,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:28,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:24:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:29,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:24:29,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:24:29,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:24:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809624800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:24:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334039143] [2024-11-14 04:24:29,292 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 04:24:29,292 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:24:29,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:24:29,304 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:24:29,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:24:31,786 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2024-11-14 04:24:31,905 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:24:36,323 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '838#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_prepend_~data#1|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_19| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_prepend_~head#1.base_19|) 1)) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#valid_82| (Array Int Int))) (and (= 0 (select |v_#valid_82| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (= (store |v_#valid_82| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_48| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 5)) |#memory_int|) (= (store |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_48| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_48|))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_67| (Array Int Int))) (= |#length| (store |v_#length_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_17| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_17| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#valid_82| (Array Int Int))) (and (= 0 (select |v_#valid_82| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (= (store |v_#valid_82| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_48| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 5)) |#memory_int|) (= (store |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_48| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_48|))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_67| (Array Int Int))) (= |#length| (store |v_#length_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 04:24:36,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:24:36,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:24:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-14 04:24:36,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278452481] [2024-11-14 04:24:36,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:24:36,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:24:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:24:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=201, Unknown=1, NotChecked=0, Total=240 [2024-11-14 04:24:36,327 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 04:24:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:36,387 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-14 04:24:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-14 04:24:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:36,389 INFO L225 Difference]: With dead ends: 64 [2024-11-14 04:24:36,389 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 04:24:36,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=38, Invalid=201, Unknown=1, NotChecked=0, Total=240 [2024-11-14 04:24:36,390 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:36,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 99 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 04:24:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 04:24:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-14 04:24:36,397 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 19 [2024-11-14 04:24:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:36,398 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-14 04:24:36,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 04:24:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-14 04:24:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 04:24:36,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:36,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:36,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:24:36,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 04:24:36,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1768440751, now seen corresponding path program 2 times [2024-11-14 04:24:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:36,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162942590] [2024-11-14 04:24:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 04:24:37,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162942590] [2024-11-14 04:24:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162942590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783570642] [2024-11-14 04:24:37,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:24:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:37,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:37,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:24:37,743 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:24:37,743 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:24:37,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:24:37,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:37,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 04:24:37,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:24:37,882 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:24:37,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:24:38,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:24:38,024 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 04:24:38,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:38,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 04:24:38,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:24:38,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:38,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 04:24:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-14 04:24:38,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:24:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783570642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593617945] [2024-11-14 04:24:38,323 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 04:24:38,324 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:24:38,324 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:24:38,324 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:24:38,325 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:24:39,648 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2024-11-14 04:24:40,130 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:24:48,449 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1085#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_20| Int)) (and (or (and (exists ((|v_#valid_95| (Array Int Int))) (and (= (store |v_#valid_95| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_95| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_35| (Array Int Int)) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int)))) (and (= |v_#memory_int_60| (store |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 5)))))) (and (exists ((|v_#valid_95| (Array Int Int))) (and (= (store |v_#valid_95| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_95| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#length_BEFORE_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_33| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int)))) (and (= |v_#memory_int_60| (store |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 5))))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_prepend_~head#1.base_20|) 1)))) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 04:24:48,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:24:48,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:24:48,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-14 04:24:48,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027890492] [2024-11-14 04:24:48,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:24:48,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 04:24:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 04:24:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=670, Unknown=2, NotChecked=52, Total=812 [2024-11-14 04:24:48,452 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 16 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 04:24:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:49,000 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-14 04:24:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:24:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-11-14 04:24:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:49,002 INFO L225 Difference]: With dead ends: 70 [2024-11-14 04:24:49,002 INFO L226 Difference]: Without dead ends: 70 [2024-11-14 04:24:49,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=114, Invalid=818, Unknown=2, NotChecked=58, Total=992 [2024-11-14 04:24:49,004 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 181 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:49,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 169 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 286 Invalid, 0 Unknown, 67 Unchecked, 0.3s Time] [2024-11-14 04:24:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-14 04:24:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-14 04:24:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-14 04:24:49,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 28 [2024-11-14 04:24:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-14 04:24:49,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 04:24:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-14 04:24:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 04:24:49,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:49,012 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:49,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:24:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:49,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1768440750, now seen corresponding path program 1 times [2024-11-14 04:24:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974279317] [2024-11-14 04:24:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:24:50,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974279317] [2024-11-14 04:24:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974279317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898718072] [2024-11-14 04:24:50,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:50,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:50,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:50,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:50,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:24:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:50,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:24:50,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:50,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:24:50,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:24:50,604 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-14 04:24:50,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:50,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 04:24:50,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:24:50,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:50,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 04:24:50,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:24:50,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:50,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 04:24:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:24:50,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898718072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:50,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-14 04:24:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909284271] [2024-11-14 04:24:50,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:50,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:24:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:50,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:24:50,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-11-14 04:24:50,882 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:51,056 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-14 04:24:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:24:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 28 [2024-11-14 04:24:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:51,058 INFO L225 Difference]: With dead ends: 58 [2024-11-14 04:24:51,058 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 04:24:51,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-11-14 04:24:51,060 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:51,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2024-11-14 04:24:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 04:24:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-14 04:24:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-14 04:24:51,065 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 28 [2024-11-14 04:24:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:51,066 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-14 04:24:51,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-14 04:24:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 04:24:51,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:51,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:51,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:24:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:51,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1012911565, now seen corresponding path program 1 times [2024-11-14 04:24:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730077441] [2024-11-14 04:24:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 04:24:51,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730077441] [2024-11-14 04:24:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730077441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:24:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275677292] [2024-11-14 04:24:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:51,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:24:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:24:51,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:51,451 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:24:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:51,608 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-14 04:24:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:24:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 29 [2024-11-14 04:24:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:51,610 INFO L225 Difference]: With dead ends: 57 [2024-11-14 04:24:51,610 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 04:24:51,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:51,611 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:51,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 04:24:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-14 04:24:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-14 04:24:51,624 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 29 [2024-11-14 04:24:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:51,624 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-14 04:24:51,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:24:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-14 04:24:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 04:24:51,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:51,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:51,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:24:51,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:51,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1012911566, now seen corresponding path program 1 times [2024-11-14 04:24:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:51,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563945462] [2024-11-14 04:24:51,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:51,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:24:51,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563945462] [2024-11-14 04:24:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563945462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:24:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908116574] [2024-11-14 04:24:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:51,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:24:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:24:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:51,927 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:24:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:52,083 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-14 04:24:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:24:52,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 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 29 [2024-11-14 04:24:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:52,084 INFO L225 Difference]: With dead ends: 56 [2024-11-14 04:24:52,085 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 04:24:52,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:52,086 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:52,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 04:24:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-14 04:24:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.6) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-14 04:24:52,093 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 29 [2024-11-14 04:24:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:52,093 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-14 04:24:52,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:24:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-14 04:24:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 04:24:52,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:52,095 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:52,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:24:52,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1549445132, now seen corresponding path program 1 times [2024-11-14 04:24:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:52,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466544710] [2024-11-14 04:24:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:24:52,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:52,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466544710] [2024-11-14 04:24:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466544710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:52,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:52,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:24:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956109352] [2024-11-14 04:24:52,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:52,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:24:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:24:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:52,362 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:52,455 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-14 04:24:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:24:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 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) Word has length 31 [2024-11-14 04:24:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:52,457 INFO L225 Difference]: With dead ends: 54 [2024-11-14 04:24:52,458 INFO L226 Difference]: Without dead ends: 54 [2024-11-14 04:24:52,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:24:52,459 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:52,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 69 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:24:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-14 04:24:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-14 04:24:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.542857142857143) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-11-14 04:24:52,471 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 31 [2024-11-14 04:24:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:52,471 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-14 04:24:52,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-11-14 04:24:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 04:24:52,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:52,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:52,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:24:52,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:52,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash -788155446, now seen corresponding path program 1 times [2024-11-14 04:24:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038873992] [2024-11-14 04:24:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 04:24:52,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038873992] [2024-11-14 04:24:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038873992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:52,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:24:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141278447] [2024-11-14 04:24:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:52,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:24:52,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:24:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:24:52,857 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 9 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:53,061 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-14 04:24:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:24:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 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 32 [2024-11-14 04:24:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:53,062 INFO L225 Difference]: With dead ends: 55 [2024-11-14 04:24:53,062 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 04:24:53,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:24:53,063 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:53,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 144 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:24:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 04:24:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-14 04:24:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-14 04:24:53,068 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 32 [2024-11-14 04:24:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:53,068 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-14 04:24:53,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-14 04:24:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 04:24:53,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:53,070 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:53,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:24:53,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:53,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash -788155445, now seen corresponding path program 1 times [2024-11-14 04:24:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668508650] [2024-11-14 04:24:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:24:53,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668508650] [2024-11-14 04:24:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668508650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:53,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:24:53,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362868501] [2024-11-14 04:24:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:53,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:24:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:53,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:24:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:24:53,630 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:53,811 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-14 04:24:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:24:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 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 32 [2024-11-14 04:24:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:53,813 INFO L225 Difference]: With dead ends: 53 [2024-11-14 04:24:53,813 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 04:24:53,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:24:53,814 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:53,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 135 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:24:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 04:24:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-14 04:24:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.4) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-14 04:24:53,818 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 32 [2024-11-14 04:24:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:53,819 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-14 04:24:53,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-14 04:24:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:24:53,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:53,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:53,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:24:53,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:53,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1407411862, now seen corresponding path program 1 times [2024-11-14 04:24:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:53,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528768829] [2024-11-14 04:24:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:24:55,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528768829] [2024-11-14 04:24:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528768829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709060409] [2024-11-14 04:24:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:55,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:55,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:55,495 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:55,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:24:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:55,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-14 04:24:55,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:55,774 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 9 treesize of output 5 [2024-11-14 04:24:55,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:55,991 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-14 04:24:56,013 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 04:24:56,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-14 04:24:56,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:56,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 04:24:56,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:24:56,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:24:56,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-11-14 04:24:56,452 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 27 treesize of output 19 [2024-11-14 04:24:56,611 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-14 04:24:56,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2024-11-14 04:24:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:24:56,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709060409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19] total 28 [2024-11-14 04:24:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438746351] [2024-11-14 04:24:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 04:24:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:56,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 04:24:56,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2024-11-14 04:24:56,667 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:57,567 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-11-14 04:24:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 04:24:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 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 36 [2024-11-14 04:24:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:57,569 INFO L225 Difference]: With dead ends: 55 [2024-11-14 04:24:57,569 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 04:24:57,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 04:24:57,571 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:57,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 189 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:24:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 04:24:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-14 04:24:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 46 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:24:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-14 04:24:57,580 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 36 [2024-11-14 04:24:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:57,580 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-14 04:24:57,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:24:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-14 04:24:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:24:57,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:57,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:57,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 04:24:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:57,782 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:24:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1407411861, now seen corresponding path program 1 times [2024-11-14 04:24:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:57,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438918534] [2024-11-14 04:24:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:25:00,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:25:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438918534] [2024-11-14 04:25:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438918534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:25:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976115310] [2024-11-14 04:25:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:25:00,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:25:00,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:25:00,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:25:00,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:25:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:25:00,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-14 04:25:00,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:25:00,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 04:25:00,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:25:01,158 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 11 [2024-11-14 04:25:01,166 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 7 treesize of output 3 [2024-11-14 04:25:01,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:01,460 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-14 04:25:01,473 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 04:25:01,473 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 15 [2024-11-14 04:25:01,480 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 18 treesize of output 13 [2024-11-14 04:25:01,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:01,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:25:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:01,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-14 04:25:01,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:01,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 04:25:01,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:01,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-14 04:25:01,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:01,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-11-14 04:25:02,561 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 04:25:02,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 34 [2024-11-14 04:25:02,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:25:02,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 04:25:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:25:02,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:25:05,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))) (and (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (<= 0 (+ 4 (let ((.cse3 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (let ((.cse11 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse5 .cse11 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse2 .cse11 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ 8 (select (select .cse6 .cse7) .cse8)) (select |c_#length| (select (select .cse9 .cse7) .cse8))))))))) is different from false [2024-11-14 04:25:34,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (<= 0 (+ (let ((.cse3 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse6 .cse3 .cse7)))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse2 .cse3 .cse4)))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 4))) (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (let ((.cse13 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse8 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse6 .cse13 .cse7)))) (store .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse2 .cse13 .cse4)))) (store .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (+ (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse8 .cse9) .cse10) 8) (select |c_#length| (select (select .cse11 .cse9) .cse10))))))))) is different from false [2024-11-14 04:25:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976115310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:25:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897180384] [2024-11-14 04:25:35,599 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 04:25:35,599 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:25:35,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:25:35,600 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:25:35,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:25:37,036 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 04:25:37,388 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:26:51,783 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2473#(and (or (< (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (+ 8 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)))) (< (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 4) 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_23| Int) (|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_23| (store (select (store |v_#memory_$Pointer$.base_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0))) |#memory_$Pointer$.base|) (or (and (exists ((|v_#valid_106| (Array Int Int))) (and (= (store |v_#valid_106| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 1) |#valid|) (= (select |v_#valid_106| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_101| (store |v_#memory_$Pointer$.offset_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (store (select |v_#memory_$Pointer$.offset_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0))))) (exists ((|v_#length_89| (Array Int Int))) (= (store |v_#length_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 8) |#length|)) (exists ((|v_#memory_int_73| (Array Int (Array Int Int))) (|v_#memory_int_74| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_int_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0 5))) (= (store |v_#memory_int_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_int_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_int_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4))) |v_#memory_int_74|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_37| (Array Int Int)) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int)) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |v_old(#length)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (store |v_#memory_$Pointer$.base_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_23| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_104| (store |v_#memory_$Pointer$.base_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (store (select |v_#memory_$Pointer$.base_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0)))))) (and (exists ((|v_#valid_106| (Array Int Int))) (and (= (store |v_#valid_106| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 1) |#valid|) (= (select |v_#valid_106| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_101| (store |v_#memory_$Pointer$.offset_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (store (select |v_#memory_$Pointer$.offset_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0))))) (exists ((|v_#length_89| (Array Int Int))) (= (store |v_#length_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 8) |#length|)) (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_38| (Array Int Int)) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |v_#memory_int_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (store |v_#memory_$Pointer$.base_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#memory_int_73| (Array Int (Array Int Int))) (|v_#memory_int_74| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_int_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0 5))) (= (store |v_#memory_int_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_int_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_int_74| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4))) |v_#memory_int_74|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) 0)) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_23| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_104| (store |v_#memory_$Pointer$.base_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (store (select |v_#memory_$Pointer$.base_99| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 0))))))) (= |#memory_int| (store |v_#memory_int_79| |v_ULTIMATE.start_sll_prepend_~head#1.base_23| (store (select |v_#memory_int_79| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)))) (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_23| (store (select (store |v_#memory_$Pointer$.offset_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_101| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_23|) 0 0))))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0))) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 04:26:51,783 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:26:51,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:26:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2024-11-14 04:26:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694645275] [2024-11-14 04:26:51,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:26:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 04:26:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:26:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 04:26:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3826, Unknown=20, NotChecked=250, Total=4290 [2024-11-14 04:26:51,789 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 38 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 04:27:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:00,974 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-14 04:27:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 04:27:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-11-14 04:27:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:00,975 INFO L225 Difference]: With dead ends: 56 [2024-11-14 04:27:00,976 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 04:27:00,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 113.3s TimeCoverageRelationStatistics Valid=278, Invalid=5112, Unknown=20, NotChecked=290, Total=5700 [2024-11-14 04:27:00,979 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 105 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:00,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 506 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-14 04:27:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 04:27:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-14 04:27:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 47 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:27:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-14 04:27:00,984 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 36 [2024-11-14 04:27:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-14 04:27:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 04:27:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-14 04:27:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:27:00,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:00,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:27:01,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 04:27:01,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:01,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:27:01,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1407503384, now seen corresponding path program 1 times [2024-11-14 04:27:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:27:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145100873] [2024-11-14 04:27:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:01,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:27:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:27:02,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:27:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145100873] [2024-11-14 04:27:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145100873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:27:02,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:27:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 04:27:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197710072] [2024-11-14 04:27:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:27:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:27:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:27:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:27:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:27:02,926 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:27:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:04,713 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-14 04:27:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:27:04,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 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 36 [2024-11-14 04:27:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:04,715 INFO L225 Difference]: With dead ends: 52 [2024-11-14 04:27:04,715 INFO L226 Difference]: Without dead ends: 52 [2024-11-14 04:27:04,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-14 04:27:04,716 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:04,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 206 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 04:27:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-14 04:27:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-14 04:27:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:27:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-14 04:27:04,719 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 36 [2024-11-14 04:27:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:04,719 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-14 04:27:04,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:27:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-14 04:27:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 04:27:04,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:04,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:27:04,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 04:27:04,720 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:27:04,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -644848898, now seen corresponding path program 1 times [2024-11-14 04:27:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:27:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057259539] [2024-11-14 04:27:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:27:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:27:04,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:27:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057259539] [2024-11-14 04:27:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057259539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:27:04,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:27:04,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:27:04,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368625734] [2024-11-14 04:27:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:27:04,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:27:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:27:04,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:27:04,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:27:04,951 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:27:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:27:05,216 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-14 04:27:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:27:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-14 04:27:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:27:05,217 INFO L225 Difference]: With dead ends: 62 [2024-11-14 04:27:05,217 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 04:27:05,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:27:05,218 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:27:05,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:27:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 04:27:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2024-11-14 04:27:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.358974358974359) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:27:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-14 04:27:05,223 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 39 [2024-11-14 04:27:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:27:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-14 04:27:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:27:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-14 04:27:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 04:27:05,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:27:05,227 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:27:05,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 04:27:05,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:27:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:27:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash -644948171, now seen corresponding path program 1 times [2024-11-14 04:27:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:27:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223211364] [2024-11-14 04:27:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:27:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:27:08,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:27:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223211364] [2024-11-14 04:27:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223211364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291424078] [2024-11-14 04:27:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:27:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:27:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:27:08,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:27:08,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:27:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:27:09,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 04:27:09,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:27:09,398 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 8 treesize of output 4 [2024-11-14 04:27:10,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:27:10,158 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 17 treesize of output 12 [2024-11-14 04:27:10,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:27:10,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 04:27:11,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:27:11,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:27:11,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 25 [2024-11-14 04:27:11,642 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 26 treesize of output 18 [2024-11-14 04:27:12,181 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-14 04:27:12,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2024-11-14 04:27:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:27:12,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:27:12,699 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 82 treesize of output 78 [2024-11-14 04:27:14,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse0) (not .cse1) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| Int) (v_ArrVal_1255 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (or (not (= (let ((.cse4 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| (store v_ArrVal_1255 .cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| v_ArrVal_1255) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29|))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4)) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| 1))))) (or (and .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| Int) (v_ArrVal_1255 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_47 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| 1)) (not (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| (store v_ArrVal_1255 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29| v_ArrVal_1255) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_29|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_47)) 0))))))) is different from false [2024-11-14 04:27:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291424078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:27:14,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009846838] [2024-11-14 04:27:14,858 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 04:27:14,859 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:27:14,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:27:14,859 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:27:14,859 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:27:16,700 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 04:27:16,972 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:28:27,697 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3057#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_118| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_25| Int) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_95| |v_ULTIMATE.start_sll_prepend_~head#1.base_25| (store (select |v_#memory_int_95| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)))) (= |v_#memory_int_95| (store |v_#memory_int_94| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_int_94| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_int_95| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_$Pointer$.offset_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_118| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_25| (store (select (store |v_#memory_$Pointer$.offset_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_$Pointer$.offset_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_118| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0 0))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_25| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0))) |#memory_$Pointer$.base|) (or (and (exists ((|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_77| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| (store |v_#memory_$Pointer$.base_125| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_125| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_48| (store |v_#memory_int_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (exists ((|v_#length_96| (Array Int Int))) (= |#length| (store |v_#length_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 8))) (exists ((|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_121| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (store (select |v_#memory_$Pointer$.base_121| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0))) |v_#memory_$Pointer$.base_126|)) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (store (select |v_#memory_$Pointer$.offset_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0))) |v_#memory_$Pointer$.offset_118|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 0)) (exists ((|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_int_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4))) |v_#memory_int_90|) (= |v_#memory_int_94| (store |v_#memory_int_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_int_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0 5))))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_25| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_113| (Array Int Int))) (and (= (store |v_#valid_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 1) |#valid|) (= (select |v_#valid_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0)))) (and (exists ((|v_#length_96| (Array Int Int))) (= |#length| (store |v_#length_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 8))) (exists ((|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_121| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (store (select |v_#memory_$Pointer$.base_121| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0))) |v_#memory_$Pointer$.base_126|)) (exists ((|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_49| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int)))) (and (<= 8 (select |v_old(#length)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| (store |v_#memory_$Pointer$.base_125| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_125| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_49| (store |v_#memory_int_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (store (select |v_#memory_$Pointer$.offset_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0))) |v_#memory_$Pointer$.offset_118|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 0)) (exists ((|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_int_89| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4 (select (select |v_#memory_int_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 4))) |v_#memory_int_90|) (= |v_#memory_int_94| (store |v_#memory_int_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) (store (select |v_#memory_int_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0 5))))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_25| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_113| (Array Int Int))) (and (= (store |v_#valid_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0) 1) |#valid|) (= (select |v_#valid_113| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_25|) 0)) 0))))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 04:28:27,697 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:28:27,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:28:27,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2024-11-14 04:28:27,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862990200] [2024-11-14 04:28:27,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:28:27,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 04:28:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:28:27,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 04:28:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2812, Unknown=9, NotChecked=106, Total=3080 [2024-11-14 04:28:27,699 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 29 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 04:28:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:28:34,982 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-14 04:28:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 04:28:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-14 04:28:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:28:34,984 INFO L225 Difference]: With dead ends: 52 [2024-11-14 04:28:34,984 INFO L226 Difference]: Without dead ends: 52 [2024-11-14 04:28:34,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 80.9s TimeCoverageRelationStatistics Valid=246, Invalid=4171, Unknown=9, NotChecked=130, Total=4556 [2024-11-14 04:28:34,986 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 82 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:28:34,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 538 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 04:28:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-14 04:28:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-14 04:28:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:28:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-14 04:28:34,990 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 39 [2024-11-14 04:28:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:28:34,990 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-14 04:28:34,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 04:28:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-14 04:28:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 04:28:34,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:28:34,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:28:35,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 04:28:35,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 04:28:35,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:28:35,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:28:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1263659738, now seen corresponding path program 1 times [2024-11-14 04:28:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:28:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604089127] [2024-11-14 04:28:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:28:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:28:42,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:28:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604089127] [2024-11-14 04:28:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604089127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:28:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140337830] [2024-11-14 04:28:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:28:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:28:42,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:28:42,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:28:42,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:28:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:28:43,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-14 04:28:43,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:28:43,837 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 04:28:43,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 04:28:44,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:28:45,475 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:28:45,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2024-11-14 04:28:45,488 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 7 treesize of output 3 [2024-11-14 04:28:45,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:28:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:46,796 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 04:28:46,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-14 04:28:47,024 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-11-14 04:28:47,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-11-14 04:28:47,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:47,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:28:48,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:48,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-14 04:28:48,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:48,858 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-14 04:28:48,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2024-11-14 04:28:49,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:49,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-11-14 04:28:49,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:49,685 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2024-11-14 04:28:49,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 66 [2024-11-14 04:28:51,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:28:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 142 [2024-11-14 04:28:52,029 INFO L349 Elim1Store]: treesize reduction 65, result has 11.0 percent of original size [2024-11-14 04:28:52,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 55 [2024-11-14 04:28:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:28:53,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:29:08,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1399 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 v_ArrVal_1399)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) v_ArrVal_1399) (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (< (select (select .cse3 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)))))) is different from false [2024-11-14 04:29:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140337830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:29:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60310493] [2024-11-14 04:29:20,706 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-14 04:29:20,707 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:29:20,707 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:29:20,707 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:29:20,707 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:29:22,035 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 117 for LOIs [2024-11-14 04:29:22,295 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:30:06,246 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3423#(and (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_52| Int)) (not (= 1 (select |#valid| |v_ULTIMATE.start_main_~ptr~0#1.base_52|)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 04:30:06,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:30:06,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:30:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 48 [2024-11-14 04:30:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42882689] [2024-11-14 04:30:06,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:30:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-14 04:30:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-14 04:30:06,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5594, Unknown=15, NotChecked=150, Total=6006 [2024-11-14 04:30:06,250 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 49 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 04:30:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:22,940 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-14 04:30:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 04:30:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-14 04:30:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:22,942 INFO L225 Difference]: With dead ends: 62 [2024-11-14 04:30:22,942 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 04:30:22,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2359 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=409, Invalid=8136, Unknown=15, NotChecked=182, Total=8742 [2024-11-14 04:30:22,945 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 129 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:22,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 430 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-14 04:30:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 04:30:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2024-11-14 04:30:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 50 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:30:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-11-14 04:30:22,950 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 40 [2024-11-14 04:30:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:22,950 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-11-14 04:30:22,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 04:30:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-14 04:30:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 04:30:22,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:22,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:22,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:30:23,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:30:23,156 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:30:23,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1263659737, now seen corresponding path program 1 times [2024-11-14 04:30:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905487968] [2024-11-14 04:30:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:34,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905487968] [2024-11-14 04:30:34,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905487968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:30:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516425326] [2024-11-14 04:30:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:34,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:30:34,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:30:34,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:30:34,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 04:30:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:34,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 04:30:34,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:35,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 04:30:38,332 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:30:38,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 04:30:38,520 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 04:30:38,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 04:30:39,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:30:39,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:30:41,011 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:30:41,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 41 [2024-11-14 04:30:41,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:41,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-14 04:30:41,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 04:30:41,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:30:42,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:42,978 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 04:30:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2024-11-14 04:30:43,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:43,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:43,143 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 04:30:43,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2024-11-14 04:30:43,283 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-14 04:30:43,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2024-11-14 04:30:43,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 04:30:43,653 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 04:30:43,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 04:30:46,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:46,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:46,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 49 [2024-11-14 04:30:46,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:46,165 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-14 04:30:46,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 62 [2024-11-14 04:30:46,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:46,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:46,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 53 [2024-11-14 04:30:47,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:30:47,137 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2024-11-14 04:30:47,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 74 [2024-11-14 04:31:01,265 INFO L349 Elim1Store]: treesize reduction 77, result has 9.4 percent of original size [2024-11-14 04:31:01,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 257 treesize of output 93 [2024-11-14 04:31:01,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:31:01,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:31:01,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:31:01,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 33 [2024-11-14 04:31:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:31:03,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:32:40,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (and (forall ((v_ArrVal_1562 Int) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_50| Int)) (let ((.cse7 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse10 .cse7 v_ArrVal_1562)))) (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse6 .cse7 .cse8)))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_50| 0) (< (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_50|) (< 0 (+ (select (select .cse0 (select (select .cse3 .cse1) .cse2)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_50| 4)) 5)) (< .cse4 v_ArrVal_1562)))))) (forall ((v_ArrVal_1562 Int) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_50| Int)) (let ((.cse18 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse11 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse10 .cse18 v_ArrVal_1562)))) (store .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse6 .cse18 .cse8)))) (store .cse17 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_50| 0) (< (select (select .cse11 .cse12) .cse13) |v_ULTIMATE.start_main_~ptr~0#1.offset_50|) (let ((.cse14 (select (select .cse16 .cse12) .cse13)) (.cse15 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_50| 4))) (< (+ 7 (select (select .cse11 .cse14) .cse15)) (select |c_#length| (select (select .cse16 .cse14) .cse15)))) (< .cse4 v_ArrVal_1562)))))))) is different from false [2024-11-14 04:32:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516425326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:32:43,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1143553954] [2024-11-14 04:32:43,239 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-14 04:32:43,239 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:32:43,239 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:32:43,239 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:32:43,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:32:44,529 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 04:32:44,839 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:34:45,685 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3824#(and (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 04:34:45,685 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:34:45,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:34:45,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 56 [2024-11-14 04:34:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222396851] [2024-11-14 04:34:45,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:34:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-14 04:34:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:34:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-14 04:34:45,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=7340, Unknown=33, NotChecked=172, Total=7832 [2024-11-14 04:34:45,689 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 57 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 47 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:34:49,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:34:52,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:34:54,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:02,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:06,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:08,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:13,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:24,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:27,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:29,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:32,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:34,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:39,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:44,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:49,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:57,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:01,493 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-11-14 04:36:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 04:36:01,493 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 47 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-14 04:36:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:01,494 INFO L225 Difference]: With dead ends: 73 [2024-11-14 04:36:01,494 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 04:36:01,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 278.0s TimeCoverageRelationStatistics Valid=509, Invalid=10804, Unknown=33, NotChecked=210, Total=11556 [2024-11-14 04:36:01,498 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 180 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 16 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:01,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 647 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1944 Invalid, 15 Unknown, 0 Unchecked, 47.5s Time] [2024-11-14 04:36:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 04:36:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2024-11-14 04:36:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:36:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-14 04:36:01,502 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 40 [2024-11-14 04:36:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:01,503 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-14 04:36:01,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 47 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 04:36:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-14 04:36:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 04:36:01,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:01,504 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:01,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 04:36:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:01,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:36:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash -518757973, now seen corresponding path program 1 times [2024-11-14 04:36:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726001467] [2024-11-14 04:36:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:36:08,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726001467] [2024-11-14 04:36:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726001467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624403254] [2024-11-14 04:36:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:08,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:08,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:36:08,014 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:36:08,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 04:36:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:08,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-14 04:36:08,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:36:08,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:36:10,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 04:36:10,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-14 04:36:10,921 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 7 treesize of output 3 [2024-11-14 04:36:10,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 04:36:10,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 5 treesize of output 3 [2024-11-14 04:36:12,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:12,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:36:12,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:12,497 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 38 treesize of output 29 [2024-11-14 04:36:12,630 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 04:36:12,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-14 04:36:12,728 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 04:36:12,728 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 15 [2024-11-14 04:36:14,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:14,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2024-11-14 04:36:14,587 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 20 treesize of output 15 [2024-11-14 04:36:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:14,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-14 04:36:15,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:15,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2024-11-14 04:36:15,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:15,296 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 30 treesize of output 25 [2024-11-14 04:36:15,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:15,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-11-14 04:36:16,719 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 04:36:16,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 54 [2024-11-14 04:36:16,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:16,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2024-11-14 04:36:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:36:17,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:36:22,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_59| Int) (v_ArrVal_1730 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 v_ArrVal_1724)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_59| 0) (< (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_59|) (< |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset| v_ArrVal_1724) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1727) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1730) (select (select .cse3 .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_59|))))))) is different from false [2024-11-14 04:36:52,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_59| Int) (v_ArrVal_1730 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 v_ArrVal_1724)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_59| 0) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) v_ArrVal_1724) (< (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_59|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_1727) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1730) (select (select .cse3 .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_59|))))))) is different from false [2024-11-14 04:36:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624403254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702004947] [2024-11-14 04:36:53,564 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 04:36:53,564 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:36:53,564 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:36:53,565 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:36:53,565 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:36:54,929 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 04:36:55,147 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:38:36,501 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4227#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 4)) |ULTIMATE.start_main_~temp~2#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 0))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) 1)) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) 1) (exists ((|v_#memory_$Pointer$.base_194| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_31| Int) (|v_#memory_int_150| (Array Int (Array Int Int))) (|v_#memory_int_151| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_151| |v_ULTIMATE.start_sll_prepend_~head#1.base_31| (store (select |v_#memory_int_151| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0))) |#memory_int|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_185| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_$Pointer$.offset_185| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_185| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_185| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_$Pointer$.offset_185| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_185| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0 0))) (= (store (store |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_$Pointer$.base_194| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_31| (store (select (store |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_$Pointer$.base_194| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0))) |#memory_$Pointer$.base|) (or (and (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_121| (Array Int Int))) (= |#length| (store |v_#length_121| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (store (select |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_185| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0))) |v_#memory_$Pointer$.offset_185|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_81| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_193| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_81| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#length)_AFTER_CALL_81| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_81| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_184| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_81| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_81| (store |v_#memory_int_149| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_149| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_81| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.base_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_81|))) (exists ((|v_#valid_144| (Array Int Int))) (and (= (store |v_#valid_144| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 1) |#valid|) (= (select |v_#valid_144| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0))) (exists ((|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_int_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_int_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4))) |v_#memory_int_146|) (= (store |v_#memory_int_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_int_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0 5)) |v_#memory_int_150|))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_31| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (store (select |v_#memory_$Pointer$.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0))) |v_#memory_$Pointer$.base_194|))) (and (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_121| (Array Int Int))) (= |#length| (store |v_#length_121| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (store (select |v_#memory_$Pointer$.offset_180| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_185| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0))) |v_#memory_$Pointer$.offset_185|)) (exists ((|v_#valid_144| (Array Int Int))) (and (= (store |v_#valid_144| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) 1) |#valid|) (= (select |v_#valid_144| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0))) (exists ((|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_int_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_int_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4))) |v_#memory_int_146|) (= (store |v_#memory_int_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_int_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0 5)) |v_#memory_int_150|))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_31| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_BEFORE_CALL_137| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_193| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (store |v_#memory_$Pointer$.base_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_193| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_184| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_137| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_82| (store |v_#memory_int_149| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_149| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (store (select |v_#memory_$Pointer$.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 0))) |v_#memory_$Pointer$.base_194|)))) (= (store |v_#memory_int_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0) (store (select |v_#memory_int_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4 (select (select |v_#memory_int_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_31|) 0)) 4))) |v_#memory_int_151|))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 8 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)))))' at error location [2024-11-14 04:38:36,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:38:36,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:38:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2024-11-14 04:38:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521947951] [2024-11-14 04:38:36,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:38:36,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 04:38:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:38:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 04:38:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=4229, Unknown=24, NotChecked=262, Total=4692 [2024-11-14 04:38:36,503 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 39 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 04:38:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:38:55,247 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-11-14 04:38:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 04:38:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-14 04:38:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:38:55,248 INFO L225 Difference]: With dead ends: 60 [2024-11-14 04:38:55,249 INFO L226 Difference]: Without dead ends: 60 [2024-11-14 04:38:55,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 159.4s TimeCoverageRelationStatistics Valid=282, Invalid=6342, Unknown=26, NotChecked=322, Total=6972 [2024-11-14 04:38:55,251 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:38:55,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 608 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-14 04:38:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-14 04:38:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-14 04:38:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:38:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-14 04:38:55,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 41 [2024-11-14 04:38:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:38:55,258 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-14 04:38:55,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 04:38:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-14 04:38:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 04:38:55,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:38:55,259 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-14 04:38:55,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 04:38:55,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-14 04:38:55,460 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:38:55,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:38:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash -207716926, now seen corresponding path program 1 times [2024-11-14 04:38:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:38:55,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414167201] [2024-11-14 04:38:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:38:55,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:38:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:38:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 04:38:55,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:38:55,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414167201] [2024-11-14 04:38:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414167201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:38:55,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:38:55,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:38:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225106915] [2024-11-14 04:38:55,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:38:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:38:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:38:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:38:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:38:55,790 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:38:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:38:56,409 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-14 04:38:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:38:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-14 04:38:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:38:56,410 INFO L225 Difference]: With dead ends: 57 [2024-11-14 04:38:56,410 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 04:38:56,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:38:56,412 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:38:56,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 04:38:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 04:38:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-14 04:38:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:38:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2024-11-14 04:38:56,419 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 43 [2024-11-14 04:38:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:38:56,420 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2024-11-14 04:38:56,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:38:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-14 04:38:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 04:38:56,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:38:56,421 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-14 04:38:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 04:38:56,422 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 04:38:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:38:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -207716925, now seen corresponding path program 1 times [2024-11-14 04:38:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:38:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474774087] [2024-11-14 04:38:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:38:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:38:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:38:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:38:56,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:38:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474774087] [2024-11-14 04:38:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474774087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:38:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95706412] [2024-11-14 04:38:56,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:38:56,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:38:56,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:38:56,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:38:56,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13643265-ba4b-40ed-9632-96bc667e2468/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 04:38:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:38:56,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:38:56,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:38:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:38:57,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:38:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:38:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95706412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:38:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1730991649] [2024-11-14 04:38:57,912 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 04:38:57,912 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:38:57,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:38:57,913 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:38:57,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:38:59,273 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 04:38:59,485 INFO L180 IcfgInterpreter]: Interpretation finished