./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/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_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:46:50,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:46:50,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:46:51,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:46:51,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:46:51,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:46:51,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:46:51,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:46:51,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:46:51,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:46:51,046 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:46:51,046 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:46:51,046 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:46:51,046 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:46:51,047 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:46:51,047 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:46:51,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:46:51,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:46:51,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:46:51,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:46:51,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:46:51,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:46:51,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:46:51,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:46:51,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:46:51,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:46:51,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:46:51,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:46:51,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:46:51,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:46:51,051 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:46:51,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:46:51,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:46:51,051 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:46:51,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:46:51,051 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_f43b7126-0940-42ef-a4c9-b72769c04e83/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 ! call(reach_error())) ) 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-11-14 05:46:51,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:46:51,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:46:51,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:46:51,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:46:51,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:46:51,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i Unable to find full path for "g++" [2024-11-14 05:46:53,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:46:53,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:46:53,866 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-14 05:46:53,881 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/data/06d0e8c22/d76e2a1c900b4ec2be6eb36b839b23ae/FLAG9181d927e [2024-11-14 05:46:53,904 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/data/06d0e8c22/d76e2a1c900b4ec2be6eb36b839b23ae [2024-11-14 05:46:53,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:46:53,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:46:53,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:46:53,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:46:53,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:46:53,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:46:53" (1/1) ... [2024-11-14 05:46:53,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b8c89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:53, skipping insertion in model container [2024-11-14 05:46:53,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:46:53" (1/1) ... [2024-11-14 05:46:53,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:46:54,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2024-11-14 05:46:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:46:54,448 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:46:54,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2024-11-14 05:46:54,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:46:54,541 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:46:54,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54 WrapperNode [2024-11-14 05:46:54,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:46:54,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:46:54,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:46:54,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:46:54,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,606 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-14 05:46:54,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:46:54,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:46:54,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:46:54,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:46:54,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:46:54,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:46:54,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:46:54,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:46:54,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (1/1) ... [2024-11-14 05:46:54,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:46:54,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:54,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:46:54,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:46:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:46:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:46:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:46:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:46:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:46:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:46:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:46:54,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:46:54,943 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:46:54,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:46:55,286 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-14 05:46:55,286 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:46:55,356 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:46:55,356 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 05:46:55,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:46:55 BoogieIcfgContainer [2024-11-14 05:46:55,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:46:55,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:46:55,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:46:55,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:46:55,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:46:53" (1/3) ... [2024-11-14 05:46:55,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d3e84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:46:55, skipping insertion in model container [2024-11-14 05:46:55,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:54" (2/3) ... [2024-11-14 05:46:55,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d3e84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:46:55, skipping insertion in model container [2024-11-14 05:46:55,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:46:55" (3/3) ... [2024-11-14 05:46:55,383 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-14 05:46:55,406 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:46:55,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 05:46:55,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:46:55,484 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=LoopHeads, 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;@7d72cb9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:46:55,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:46:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 05:46:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:46:55,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:46:55,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:46:55,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:46:55,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:46:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1228900903, now seen corresponding path program 1 times [2024-11-14 05:46:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:46:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755976520] [2024-11-14 05:46:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:46:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:46:55,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:46:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755976520] [2024-11-14 05:46:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755976520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:46:55,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:46:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:46:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086548352] [2024-11-14 05:46:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:46:55,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:46:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:46:56,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:46:56,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:46:56,013 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 05:46:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:46:56,092 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2024-11-14 05:46:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:46:56,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-14 05:46:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:46:56,103 INFO L225 Difference]: With dead ends: 53 [2024-11-14 05:46:56,104 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 05:46:56,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:46:56,111 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:46:56,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:46:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 05:46:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-14 05:46:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 05:46:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-14 05:46:56,170 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2024-11-14 05:46:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:46:56,173 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-14 05:46:56,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 05:46:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-14 05:46:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:46:56,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:46:56,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:46:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:46:56,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:46:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:46:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 298709349, now seen corresponding path program 1 times [2024-11-14 05:46:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:46:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137939239] [2024-11-14 05:46:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:46:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:46:56,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:46:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137939239] [2024-11-14 05:46:56,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137939239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:46:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124080513] [2024-11-14 05:46:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:56,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:56,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:56,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:46:56,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:46:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:56,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:46:56,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:46:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:46:56,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:46:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124080513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:46:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452003978] [2024-11-14 05:46:57,041 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 05:46:57,042 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:46:57,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:46:57,053 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:46:57,053 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:47:01,740 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 179 for LOIs [2024-11-14 05:47:02,059 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:47:12,239 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification. DAG size of input: 241 DAG size of output: 233 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:47:41,658 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 230 DAG size of output: 229 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:48:04,680 WARN L286 SmtUtils]: Spent 13.80s on a formula simplification. DAG size of input: 247 DAG size of output: 246 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:48:23,617 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 245 DAG size of output: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:48:23,619 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '243#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_13| Int) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_84| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_int_84| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0) (= (select (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 0))) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0))) |#memory_$Pointer$.base|) (or (and (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_72|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_41| (store |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4)))) (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0 5)) |v_#memory_int_84|) (= |v_#memory_int_40| (store |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8)))))) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_72| (store |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))))) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_30| Int) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9|) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) (= |v_#memory_int_54| |v_old(#memory_int)_AFTER_CALL_9|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30| (store (select (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|)) (= (store (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30| (store (select (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8 0)) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_30| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_9| |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8))) |v_old(#memory_int)_AFTER_CALL_9|))) (= (store |v_#memory_$Pointer$.offset_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_50|) (= (store |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_50|) (= (store |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_54| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_54|))) (= |v_ULTIMATE.start_dll_append_~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 12))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0))) (and (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_72|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_41| (store |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4)))) (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0 5)) |v_#memory_int_84|) (= |v_#memory_int_40| (store |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8)))))) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_72| (store |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))))) (= |v_ULTIMATE.start_dll_append_~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 12))) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_30| Int) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_50|) (or (and (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_30| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_10| |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30| (store (select (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (store (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30| (store (select (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) 8 0)))) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_30|) (= |v_old(#memory_int)_AFTER_CALL_10| |v_#memory_int_54|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|))) (= (store |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_54| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_54|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0)))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:48:23,620 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:48:23,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:48:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-14 05:48:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439673949] [2024-11-14 05:48:23,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:48:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:48:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:48:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=264, Unknown=2, NotChecked=0, Total=306 [2024-11-14 05:48:23,623 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:48:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:23,695 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2024-11-14 05:48:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:48:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-11-14 05:48:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:23,697 INFO L225 Difference]: With dead ends: 46 [2024-11-14 05:48:23,697 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 05:48:23,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 81.6s TimeCoverageRelationStatistics Valid=40, Invalid=264, Unknown=2, NotChecked=0, Total=306 [2024-11-14 05:48:23,698 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:23,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:48:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 05:48:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-14 05:48:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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 05:48:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-14 05:48:23,705 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2024-11-14 05:48:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:23,705 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-14 05:48:23,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:48:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-14 05:48:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:48:23,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:23,709 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:23,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:48:23,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:23,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash 695562787, now seen corresponding path program 2 times [2024-11-14 05:48:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:48:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610443924] [2024-11-14 05:48:23,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:48:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:48:25,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:48:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610443924] [2024-11-14 05:48:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610443924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863298149] [2024-11-14 05:48:25,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:48:25,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:48:25,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:48:25,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:48:25,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:48:25,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:48:25,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:48:25,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:25,504 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 05:48:25,614 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_22| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_22| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_22| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_22|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-14 05:48:25,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:25,635 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 05:48:25,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:48:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-14 05:48:25,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863298149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629514014] [2024-11-14 05:48:25,841 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 05:48:25,841 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:48:25,842 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:48:25,842 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:48:25,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:48:28,379 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 179 for LOIs [2024-11-14 05:48:28,583 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:48:42,198 WARN L286 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 241 DAG size of output: 233 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:49:18,953 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 230 DAG size of output: 229 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:49:38,430 WARN L286 SmtUtils]: Spent 12.73s on a formula simplification. DAG size of input: 247 DAG size of output: 246 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:50:02,471 WARN L286 SmtUtils]: Spent 11.30s on a formula simplification. DAG size of input: 245 DAG size of output: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:50:02,472 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '460#(and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_15| Int) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_dll_append_~head#1.base_15| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)))) (= |#memory_int| (store |v_#memory_int_111| |v_ULTIMATE.start_dll_append_~head#1.base_15| (store (select |v_#memory_int_111| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0) (= (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0) (or (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0)) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#valid|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.offset_87|)) (= |v_ULTIMATE.start_dll_append_~head#1.base_15| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8))) |v_#memory_int_40|) (= |v_#memory_int_41| (store |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 (select (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4)))) (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0 5)) |v_#memory_int_111|))) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_35| Int) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= |v_#memory_int_54| (store |v_#memory_int_110| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_110| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_54| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_50|) (= (store |v_#memory_$Pointer$.base_89| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_89| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= (store (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 0)) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21|) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_21| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8))))) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_21| |v_#memory_int_54|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))))))) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.base_90|))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_35| Int) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (or (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_20| |v_#memory_int_54|)) (and (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_35|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_20| |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35| (store (select (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_35|) 8 0))))) (= (store |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_50|) (= (store |v_#memory_int_110| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_110| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_54| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_54|) (= (store |v_#memory_$Pointer$.base_89| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_89| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#valid|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.offset_87|)) (= |v_ULTIMATE.start_dll_append_~head#1.base_15| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8))) |v_#memory_int_40|) (= |v_#memory_int_41| (store |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 (select (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4)))) (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0 5)) |v_#memory_int_111|))) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.base_90|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_15| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:50:02,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:50:02,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:50:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-14 05:50:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738509951] [2024-11-14 05:50:02,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:50:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:50:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:50:02,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:50:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=678, Unknown=5, NotChecked=52, Total=812 [2024-11-14 05:50:02,475 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 15 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:50:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:50:03,428 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-11-14 05:50:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:50:03,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 05:50:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:50:03,430 INFO L225 Difference]: With dead ends: 37 [2024-11-14 05:50:03,430 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 05:50:03,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 95.0s TimeCoverageRelationStatistics Valid=102, Invalid=889, Unknown=5, NotChecked=60, Total=1056 [2024-11-14 05:50:03,432 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:50:03,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 32 Unchecked, 0.5s Time] [2024-11-14 05:50:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 05:50:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-14 05:50:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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 05:50:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-14 05:50:03,439 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2024-11-14 05:50:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:50:03,439 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-14 05:50:03,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:50:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-14 05:50:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:50:03,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:50:03,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:50:03,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:50:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:50:03,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:50:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:50:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -456605411, now seen corresponding path program 1 times [2024-11-14 05:50:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:50:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944593243] [2024-11-14 05:50:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:50:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:50:06,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:50:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944593243] [2024-11-14 05:50:06,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944593243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:50:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227587382] [2024-11-14 05:50:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:50:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:50:06,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:50:06,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:50:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:06,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 05:50:06,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:06,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:50:07,056 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:50:07,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:50:07,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-14 05:50:07,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:50:07,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 86 [2024-11-14 05:50:07,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-11-14 05:50:07,703 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 05:50:07,703 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 86 treesize of output 31 [2024-11-14 05:50:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:50:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:50:07,936 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:50:07,936 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 94 treesize of output 75 [2024-11-14 05:50:07,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:50:07,963 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 68 treesize of output 59 [2024-11-14 05:50:08,034 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-14 05:50:08,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-14 05:50:09,099 INFO L349 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2024-11-14 05:50:09,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 93 [2024-11-14 05:50:09,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:50:09,170 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:50:09,170 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 109 treesize of output 88 [2024-11-14 05:50:09,262 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 05:50:09,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2024-11-14 05:50:09,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:50:09,279 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 84 treesize of output 73 [2024-11-14 05:50:09,458 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 05:50:09,459 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 75 treesize of output 24 [2024-11-14 05:50:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:50:09,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:50:09,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_528 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_528)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_526))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2024-11-14 05:50:12,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227587382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:50:12,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367533712] [2024-11-14 05:50:12,904 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:50:12,904 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:50:12,904 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:50:12,904 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:50:12,904 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:50:15,857 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 189 for LOIs [2024-11-14 05:50:16,159 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:51:36,599 WARN L286 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 252 DAG size of output: 251 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:51:59,948 WARN L286 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 269 DAG size of output: 268 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:51:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [367533712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:59,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:51:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19, 22] total 45 [2024-11-14 05:51:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395069186] [2024-11-14 05:51:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:51:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:51:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2285, Unknown=11, NotChecked=96, Total=2550 [2024-11-14 05:51:59,952 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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 05:52:07,050 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 05:52:12,776 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 05:52:15,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:52:19,253 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 05:52:23,168 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 05:52:26,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:52:27,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:52:28,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:52:30,662 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 05:52:31,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:52:34,876 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 05:52:39,530 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 05:52:43,561 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 05:52:48,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:52:49,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:00,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:01,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:03,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:05,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:06,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:07,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:09,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:10,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:12,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:14,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:17,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:19,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:53:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:53:20,041 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-14 05:53:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:53:20,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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 27 [2024-11-14 05:53:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:53:20,043 INFO L225 Difference]: With dead ends: 35 [2024-11-14 05:53:20,043 INFO L226 Difference]: Without dead ends: 32 [2024-11-14 05:53:20,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 109.2s TimeCoverageRelationStatistics Valid=158, Invalid=2285, Unknown=11, NotChecked=96, Total=2550 [2024-11-14 05:53:20,045 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:53:20,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 10 Unknown, 0 Unchecked, 80.0s Time] [2024-11-14 05:53:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-14 05:53:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-14 05:53:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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 05:53:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-14 05:53:20,057 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2024-11-14 05:53:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:53:20,058 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-14 05:53:20,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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 05:53:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-14 05:53:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:53:20,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:53:20,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:53:20,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:53:20,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:53:20,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:53:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:53:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash -735001158, now seen corresponding path program 1 times [2024-11-14 05:53:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:53:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263063474] [2024-11-14 05:53:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:53:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:53:23,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:53:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263063474] [2024-11-14 05:53:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263063474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:53:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423740859] [2024-11-14 05:53:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:23,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:53:23,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:53:23,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:53:23,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:53:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:24,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-14 05:53:24,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:53:24,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:53:24,899 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:53:24,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:53:25,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 05:53:25,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 05:53:25,191 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 31 treesize of output 15 [2024-11-14 05:53:25,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:53:25,704 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 38 treesize of output 22 [2024-11-14 05:53:25,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2024-11-14 05:53:25,726 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 05:53:25,736 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 05:53:25,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:53:26,000 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 05:53:26,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:53:26,018 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 20 treesize of output 15 [2024-11-14 05:53:26,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:53:26,030 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 46 treesize of output 35 [2024-11-14 05:53:26,090 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 05:53:26,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 05:53:26,894 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 71 [2024-11-14 05:53:26,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:53:26,909 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 82 treesize of output 65 [2024-11-14 05:53:26,927 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-14 05:53:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:53:26,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:53:26,950 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 29 treesize of output 11 [2024-11-14 05:53:26,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:53:27,190 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 28 treesize of output 16 [2024-11-14 05:53:27,200 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 05:53:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:53:27,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:53:27,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_748 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_748)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_744) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_750)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-14 05:53:27,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_748 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (select (let ((.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_748)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_744) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_750)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-14 05:53:27,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_748 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (select (let ((.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_748)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_744) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_750)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-14 05:53:27,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| Int) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_763))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (select (let ((.cse1 (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_762) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (store (store |c_#memory_int| .cse0 (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_761) .cse0) .cse1 v_ArrVal_748)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_744) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select .cse2 .cse0) .cse1 v_ArrVal_750)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_747) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_745) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_746) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28|) 0)))) is different from false [2024-11-14 05:53:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423740859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:53:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [611006184] [2024-11-14 05:53:28,001 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:53:28,001 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:53:28,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:53:28,001 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:53:28,001 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:53:32,917 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 189 for LOIs [2024-11-14 05:53:33,080 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:54:06,492 WARN L286 SmtUtils]: Spent 24.77s on a formula simplification. DAG size of input: 272 DAG size of output: 261 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:55:34,820 WARN L286 SmtUtils]: Spent 14.37s on a formula simplification. DAG size of input: 252 DAG size of output: 251 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:55:59,819 WARN L286 SmtUtils]: Spent 13.87s on a formula simplification. DAG size of input: 269 DAG size of output: 268 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:56:34,827 WARN L286 SmtUtils]: Spent 16.25s on a formula simplification. DAG size of input: 270 DAG size of output: 259 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:57:12,708 WARN L286 SmtUtils]: Spent 15.94s on a formula simplification. DAG size of input: 274 DAG size of output: 268 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:57:54,771 WARN L286 SmtUtils]: Spent 15.47s on a formula simplification. DAG size of input: 274 DAG size of output: 263 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:57:54,772 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '975#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_20| Int) (|v_#memory_int_182| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| Int) (|v_#memory_int_25| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0))) 0) (= (select (select |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0))) 0) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8)))) (= (store |v_#memory_int_182| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) (store (select |v_#memory_int_182| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (select (select |v_#memory_int_25| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0))))) |v_#memory_int_25|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) (store (select |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select (store |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) (store (select |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)))) (or (not (= (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) 0))) (or (and (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0))) |v_#memory_$Pointer$.base_130|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0 5)) |v_#memory_int_182|) (= |v_#memory_int_41| (store |v_#memory_int_178| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_178| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4 (select (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4)))) (= |v_#memory_int_40| (store |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8)))))) (exists ((|v_#valid_62| (Array Int Int))) (and (= (store |v_#valid_62| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 1) |#valid|) (= (select |v_#valid_62| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0))) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_181| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_47| Int) (|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_129| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_129| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_50|) (or (and (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|)) (= |v_old(#memory_int)_AFTER_CALL_43| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_47| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_43| |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47| (store (select (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47| (store (select (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8 0)))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_43| |v_#memory_int_54|) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) (= (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|))) (= (store |v_#memory_$Pointer$.offset_126| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_50|) (= |v_#memory_int_54| (store |v_#memory_int_181| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_181| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_54| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#length_44| (Array Int Int))) (= |#length| (store |v_#length_44| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_127| (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (store (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0))))) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 0))) (and (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0))) |v_#memory_$Pointer$.base_130|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0 5)) |v_#memory_int_182|) (= |v_#memory_int_41| (store |v_#memory_int_178| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_178| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4 (select (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4)))) (= |v_#memory_int_40| (store |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8)))))) (exists ((|v_#valid_62| (Array Int Int))) (and (= (store |v_#valid_62| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 1) |#valid|) (= (select |v_#valid_62| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_181| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_47| Int)) (and (= (store |v_#memory_$Pointer$.base_129| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_129| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_50|) (= |v_#memory_int_54| (store |v_#memory_int_181| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_181| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_54| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.offset_126| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (store (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47| (store (select (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| (store (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47| (store (select (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_42| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_47| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_42| |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) 8))))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (store |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_42| |v_#memory_int_54|) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_47|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| (store |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))))))) (exists ((|v_#length_44| (Array Int Int))) (= |#length| (store |v_#length_44| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_127| (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (store (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 0))))) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| 0)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) (store (select |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24| (store (select (store |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0) (store (select |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_24|) 8 (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 0)))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:57:54,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:57:54,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:57:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2024-11-14 05:57:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846657893] [2024-11-14 05:57:54,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:57:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 05:57:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:57:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 05:57:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2803, Unknown=17, NotChecked=436, Total=3422 [2024-11-14 05:57:54,776 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 37 states, 30 states have (on average 1.4) internal successors, (42), 28 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:57:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:57:58,802 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-11-14 05:57:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:57:58,802 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.4) internal successors, (42), 28 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-11-14 05:57:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:57:58,804 INFO L225 Difference]: With dead ends: 48 [2024-11-14 05:57:58,804 INFO L226 Difference]: Without dead ends: 46 [2024-11-14 05:57:58,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 267.5s TimeCoverageRelationStatistics Valid=244, Invalid=3787, Unknown=17, NotChecked=508, Total=4556 [2024-11-14 05:57:58,806 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:57:58,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 405 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 05:57:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-14 05:57:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2024-11-14 05:57:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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 05:57:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-14 05:57:58,819 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 29 [2024-11-14 05:57:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:57:58,820 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-14 05:57:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.4) internal successors, (42), 28 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:57:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-14 05:57:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:57:58,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:57:58,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:57:58,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:57:59,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:57:59,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:57:59,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:57:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1175789768, now seen corresponding path program 1 times [2024-11-14 05:57:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:57:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699294289] [2024-11-14 05:57:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:57:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:57:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:58:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:58:03,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:58:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699294289] [2024-11-14 05:58:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699294289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:58:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717914179] [2024-11-14 05:58:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:58:03,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:58:03,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:58:03,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:58:03,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:58:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:58:03,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 05:58:03,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:58:03,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:58:04,391 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:58:04,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:58:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-14 05:58:04,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:58:04,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 86 [2024-11-14 05:58:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-11-14 05:58:05,086 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 05:58:05,086 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 86 treesize of output 31 [2024-11-14 05:58:05,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:58:05,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:05,491 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:58:05,491 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 94 treesize of output 75 [2024-11-14 05:58:05,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:05,506 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 68 treesize of output 59 [2024-11-14 05:58:05,568 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-14 05:58:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-14 05:58:06,763 INFO L349 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2024-11-14 05:58:06,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 93 [2024-11-14 05:58:06,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:06,805 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:58:06,806 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 109 treesize of output 88 [2024-11-14 05:58:06,865 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 05:58:06,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2024-11-14 05:58:06,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:06,886 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 84 treesize of output 73 [2024-11-14 05:58:07,070 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 05:58:07,071 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 75 treesize of output 24 [2024-11-14 05:58:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:58:07,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:58:07,371 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_970 Int) (v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_970)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_968))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2024-11-14 05:58:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717914179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:58:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [535346872] [2024-11-14 05:58:08,668 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:58:08,668 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:58:08,669 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:58:08,669 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:58:08,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:58:10,286 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 179 for LOIs [2024-11-14 05:58:10,463 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:58:41,626 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1285#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (exists ((|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_#memory_int_25| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (= |v_#memory_int_25| (store |v_#memory_int_212| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_int_212| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select (store |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select (store |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))' at error location [2024-11-14 05:58:41,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:58:41,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:58:41,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-11-14 05:58:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273152624] [2024-11-14 05:58:41,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:58:41,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 05:58:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:58:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 05:58:41,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3243, Unknown=7, NotChecked=114, Total=3540 [2024-11-14 05:58:41,629 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:58:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:58:48,930 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-14 05:58:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 05:58:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-11-14 05:58:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:58:48,935 INFO L225 Difference]: With dead ends: 48 [2024-11-14 05:58:48,935 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 05:58:48,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=436, Invalid=5722, Unknown=8, NotChecked=154, Total=6320 [2024-11-14 05:58:48,938 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 72 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:58:48,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 335 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:58:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 05:58:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-11-14 05:58:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 05:58:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-14 05:58:48,953 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2024-11-14 05:58:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:58:48,953 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-14 05:58:48,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:58:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-14 05:58:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:58:48,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:58:48,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:58:48,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:58:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:58:49,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:58:49,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:58:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -381433579, now seen corresponding path program 1 times [2024-11-14 05:58:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:58:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429391377] [2024-11-14 05:58:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:58:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:58:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:58:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:58:53,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:58:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429391377] [2024-11-14 05:58:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429391377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:58:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876331093] [2024-11-14 05:58:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:58:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:58:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:58:53,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:58:53,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:58:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:58:54,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-14 05:58:54,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:58:54,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:58:55,321 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 05:58:55,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:58:55,749 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:58:55,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:58:56,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-14 05:58:56,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-14 05:58:56,170 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 46 treesize of output 21 [2024-11-14 05:58:56,179 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 21 treesize of output 11 [2024-11-14 05:58:56,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:58:56,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2024-11-14 05:58:56,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:58:56,775 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 1 case distinctions, treesize of input 83 treesize of output 38 [2024-11-14 05:58:56,785 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 05:58:56,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:58:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:57,090 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:58:57,091 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 91 treesize of output 66 [2024-11-14 05:58:57,152 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:58:57,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:58:57,179 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 20 treesize of output 15 [2024-11-14 05:58:57,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:57,226 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 05:58:59,253 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-14 05:58:59,254 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 190 treesize of output 99 [2024-11-14 05:58:59,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:59,296 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:58:59,297 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 147 treesize of output 98 [2024-11-14 05:58:59,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2024-11-14 05:58:59,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:59,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:58:59,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-14 05:58:59,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:58:59,598 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 1 case distinctions, treesize of input 68 treesize of output 31 [2024-11-14 05:59:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:59:00,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:59:00,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1191 Int) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1194) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1193) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_1191)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1190) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-14 05:59:01,606 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_36| Int) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1191 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1205))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1206) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_36| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1194) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1193) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1191)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1190) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1189) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2024-11-14 05:59:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876331093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:59:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1163411746] [2024-11-14 05:59:01,611 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:59:01,611 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:59:01,612 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:59:01,612 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:59:01,612 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:59:03,756 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 179 for LOIs [2024-11-14 05:59:03,885 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:59:34,839 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1627#(and (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| Int) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_167| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| (store (select (store |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)))) (= (store (store |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| (store (select (store |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_int_253| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4)))) |v_#memory_int_25|) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)))))) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:59:34,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:59:34,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:59:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2024-11-14 05:59:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803600126] [2024-11-14 05:59:34,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:59:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 05:59:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:59:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 05:59:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4201, Unknown=3, NotChecked=262, Total=4692 [2024-11-14 05:59:34,843 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 45 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 6 states have call successors, (6), 3 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 05:59:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:59:39,309 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-14 05:59:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:59:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 6 states have call successors, (6), 3 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 31 [2024-11-14 05:59:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:59:39,312 INFO L225 Difference]: With dead ends: 50 [2024-11-14 05:59:39,313 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 05:59:39,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=308, Invalid=5397, Unknown=3, NotChecked=298, Total=6006 [2024-11-14 05:59:39,319 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:59:39,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 309 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:59:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 05:59:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2024-11-14 05:59:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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 05:59:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-14 05:59:39,339 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 31 [2024-11-14 05:59:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:59:39,339 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-14 05:59:39,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 6 states have call successors, (6), 3 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 05:59:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-14 05:59:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:59:39,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:59:39,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:59:39,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:59:39,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:59:39,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:59:39,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:59:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1060406474, now seen corresponding path program 1 times [2024-11-14 05:59:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:59:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938799872] [2024-11-14 05:59:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:59:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:59:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:59:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:59:39,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:59:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938799872] [2024-11-14 05:59:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938799872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:59:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:59:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:59:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603872731] [2024-11-14 05:59:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:59:39,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:59:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:59:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:59:39,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:59:39,779 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 05:59:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:59:40,034 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-14 05:59:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:59:40,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 32 [2024-11-14 05:59:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:59:40,036 INFO L225 Difference]: With dead ends: 47 [2024-11-14 05:59:40,036 INFO L226 Difference]: Without dead ends: 42 [2024-11-14 05:59:40,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:59:40,037 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:59:40,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:59:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-14 05:59:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-14 05:59:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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 05:59:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-14 05:59:40,060 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2024-11-14 05:59:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:59:40,061 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-14 05:59:40,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 05:59:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-14 05:59:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:59:40,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:59:40,062 INFO L215 NwaCegarLoop]: trace histogram [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 05:59:40,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:59:40,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:59:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:59:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 94593456, now seen corresponding path program 2 times [2024-11-14 05:59:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:59:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028950260] [2024-11-14 05:59:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:59:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:59:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:59:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:59:43,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:59:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028950260] [2024-11-14 05:59:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028950260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:59:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860721718] [2024-11-14 05:59:43,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:59:43,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:59:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:59:43,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:59:43,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:59:43,681 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:59:43,681 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:59:43,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-14 05:59:43,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:59:43,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:59:44,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:59:44,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:59:45,020 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:59:45,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:59:45,094 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:59:45,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:59:45,158 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:59:45,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:59:45,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:45,386 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 29 treesize of output 26 [2024-11-14 05:59:45,392 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 7 [2024-11-14 05:59:45,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-11-14 05:59:45,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:45,424 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 28 treesize of output 21 [2024-11-14 05:59:45,461 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 26 treesize of output 15 [2024-11-14 05:59:45,481 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 26 [2024-11-14 05:59:45,977 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:59:45,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 45 [2024-11-14 05:59:45,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:59:45,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:59:48,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:48,515 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 05:59:48,516 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 05:59:48,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:48,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:48,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:48,591 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 05:59:48,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 43 [2024-11-14 05:59:48,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:59:48,679 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:59:48,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:59:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:59:51,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:59:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860721718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:59:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924116108] [2024-11-14 05:59:53,181 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 05:59:53,181 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:59:53,182 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:59:53,182 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:59:53,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:59:55,472 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 189 for LOIs [2024-11-14 05:59:55,661 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 06:00:32,024 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2086#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_#memory_$Pointer$.base_194| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_35| Int) (|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_int_293| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)))) (= |v_#memory_int_25| (store |v_#memory_int_293| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) (store (select |v_#memory_int_293| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) 4) (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) 4))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) (store (select |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35| (store (select (store |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) (store (select |v_#memory_$Pointer$.base_194| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) (store (select |v_#memory_$Pointer$.offset_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35| (store (select (store |v_#memory_$Pointer$.offset_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) (store (select |v_#memory_$Pointer$.offset_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_35|) 8)))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 06:00:32,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 06:00:32,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 06:00:32,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2024-11-14 06:00:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929129340] [2024-11-14 06:00:32,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 06:00:32,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 06:00:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 06:00:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 06:00:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3437, Unknown=3, NotChecked=0, Total=3660 [2024-11-14 06:00:32,027 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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 06:00:35,087 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 06:00:37,595 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 06:00:40,753 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 06:00:43,925 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 06:00:46,468 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 06:00:49,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 06:00:51,532 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 06:00:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 06:00:51,998 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2024-11-14 06:00:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 06:00:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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 33 [2024-11-14 06:00:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 06:00:52,000 INFO L225 Difference]: With dead ends: 67 [2024-11-14 06:00:52,000 INFO L226 Difference]: Without dead ends: 52 [2024-11-14 06:00:52,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=289, Invalid=4400, Unknown=3, NotChecked=0, Total=4692 [2024-11-14 06:00:52,002 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 12 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-14 06:00:52,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 296 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 493 Invalid, 7 Unknown, 0 Unchecked, 17.0s Time] [2024-11-14 06:00:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-14 06:00:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-14 06:00:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 06:00:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-14 06:00:52,025 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 33 [2024-11-14 06:00:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 06:00:52,026 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-14 06:00:52,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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 06:00:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-14 06:00:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 06:00:52,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 06:00:52,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 06:00:52,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 06:00:52,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 06:00:52,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 06:00:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 06:00:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1196397554, now seen corresponding path program 1 times [2024-11-14 06:00:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 06:00:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532890779] [2024-11-14 06:00:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 06:00:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 06:00:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 06:00:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 06:00:59,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 06:00:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532890779] [2024-11-14 06:00:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532890779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 06:00:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770803021] [2024-11-14 06:00:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 06:00:59,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 06:00:59,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 06:00:59,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 06:00:59,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f43b7126-0940-42ef-a4c9-b72769c04e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 06:00:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 06:00:59,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 155 conjuncts are in the unsatisfiable core [2024-11-14 06:01:00,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 06:01:00,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 06:01:01,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 06:01:01,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 06:01:01,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 06:01:03,027 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 06:01:03,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 06:01:03,108 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 06:01:03,132 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 06:01:03,156 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 06:01:03,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:03,620 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 25 treesize of output 22 [2024-11-14 06:01:03,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:03,646 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 26 treesize of output 23 [2024-11-14 06:01:03,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-11-14 06:01:03,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:03,687 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 28 treesize of output 21 [2024-11-14 06:01:03,702 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 26 treesize of output 15 [2024-11-14 06:01:03,735 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 26 [2024-11-14 06:01:03,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2024-11-14 06:01:03,855 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 7 [2024-11-14 06:01:05,194 INFO L349 Elim1Store]: treesize reduction 22, result has 51.1 percent of original size [2024-11-14 06:01:05,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 81 [2024-11-14 06:01:05,271 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 06:01:05,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 06:01:05,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 06:01:05,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-14 06:01:06,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:06,447 INFO L349 Elim1Store]: treesize reduction 96, result has 18.6 percent of original size [2024-11-14 06:01:06,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 158 treesize of output 94 [2024-11-14 06:01:06,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:06,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:06,533 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 06:01:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-11-14 06:01:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:06,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:06,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:06,629 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-14 06:01:06,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 52 [2024-11-14 06:01:06,666 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 06:01:10,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2024-11-14 06:01:10,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,391 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-14 06:01:10,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 70 [2024-11-14 06:01:10,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 06:01:10,565 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2024-11-14 06:01:10,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 65 [2024-11-14 06:01:10,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2024-11-14 06:01:10,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:10,996 INFO L349 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2024-11-14 06:01:10,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 68 [2024-11-14 06:01:11,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:11,359 INFO L349 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2024-11-14 06:01:11,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 77 [2024-11-14 06:01:11,795 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2024-11-14 06:01:11,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 55 [2024-11-14 06:01:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:12,613 INFO L349 Elim1Store]: treesize reduction 237, result has 25.7 percent of original size [2024-11-14 06:01:12,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 140 treesize of output 118 [2024-11-14 06:01:12,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:12,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:12,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 06:01:13,016 INFO L349 Elim1Store]: treesize reduction 248, result has 16.5 percent of original size [2024-11-14 06:01:13,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 84 [2024-11-14 06:01:13,060 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 24 treesize of output 1 [2024-11-14 06:01:13,192 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-14 06:01:13,193 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 30 treesize of output 21