./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje --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.2.5-dev-a016563 [2024-11-09 04:30:14,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:30:14,643 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:30:14,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:30:14,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:30:14,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:30:14,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:30:14,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:30:14,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:30:14,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:30:14,673 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:30:14,673 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:30:14,674 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:30:14,674 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:30:14,674 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:30:14,675 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:30:14,675 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:30:14,676 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:30:14,676 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:30:14,676 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:30:14,677 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:30:14,678 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:30:14,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:30:14,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:30:14,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:30:14,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:30:14,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:30:14,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:30:14,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:30:14,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:30:14,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:30:14,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:30:14,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:30:14,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:30:14,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:30:14,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:30:14,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:30:14,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:30:14,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:14,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:30:14,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:30:14,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:30:14,686 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:30:14,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:30:14,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:30:14,686 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:30:14,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:30:14,687 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-09 04:30:14,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:30:14,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:30:14,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:30:14,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:30:14,982 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:30:14,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i Unable to find full path for "g++" [2024-11-09 04:30:17,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:30:17,521 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:30:17,522 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-09 04:30:17,539 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/data/07682d8d0/2c6c59a65eb14c5490b3ee80812396d8/FLAGd901c70d3 [2024-11-09 04:30:17,560 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/data/07682d8d0/2c6c59a65eb14c5490b3ee80812396d8 [2024-11-09 04:30:17,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:30:17,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:30:17,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:17,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:30:17,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:30:17,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:17" (1/1) ... [2024-11-09 04:30:17,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788dd49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:17, skipping insertion in model container [2024-11-09 04:30:17,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:17" (1/1) ... [2024-11-09 04:30:17,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:30:18,124 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_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2024-11-09 04:30:18,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:18,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:30:18,213 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_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2024-11-09 04:30:18,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:18,246 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:30:18,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18 WrapperNode [2024-11-09 04:30:18,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:18,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:18,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:30:18,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:30:18,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,296 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-09 04:30:18,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:18,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:30:18,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:30:18,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:30:18,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:30:18,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:30:18,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:30:18,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:30:18,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (1/1) ... [2024-11-09 04:30:18,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:18,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:18,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:30:18,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:30:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:30:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:30:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 04:30:18,440 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 04:30:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:30:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:30:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:30:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:30:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:30:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:30:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:30:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:30:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:30:18,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:30:18,572 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:30:18,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:30:18,903 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-09 04:30:18,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:30:18,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:30:18,994 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 04:30:18,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:18 BoogieIcfgContainer [2024-11-09 04:30:18,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:30:19,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:30:19,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:30:19,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:30:19,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:30:17" (1/3) ... [2024-11-09 04:30:19,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618fb9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:19, skipping insertion in model container [2024-11-09 04:30:19,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:18" (2/3) ... [2024-11-09 04:30:19,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618fb9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:19, skipping insertion in model container [2024-11-09 04:30:19,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:18" (3/3) ... [2024-11-09 04:30:19,012 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-09 04:30:19,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:30:19,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:30:19,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:30:19,125 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;@2a522591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:30:19,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:30:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:30:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:30:19,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:19,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:19,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:19,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash -689328685, now seen corresponding path program 1 times [2024-11-09 04:30:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410944347] [2024-11-09 04:30:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:19,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410944347] [2024-11-09 04:30:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410944347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:30:19,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483378120] [2024-11-09 04:30:19,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:19,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:19,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:19,643 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:30:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:19,737 INFO L93 Difference]: Finished difference Result 61 states and 89 transitions. [2024-11-09 04:30:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-09 04:30:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:19,754 INFO L225 Difference]: With dead ends: 61 [2024-11-09 04:30:19,755 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 04:30:19,758 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-09 04:30:19,764 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:19,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:30:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 04:30:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-09 04:30:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:30:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-09 04:30:19,817 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2024-11-09 04:30:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:19,817 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-09 04:30:19,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:30:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-09 04:30:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:30:19,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:19,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:19,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:30:19,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:19,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash 822503764, now seen corresponding path program 1 times [2024-11-09 04:30:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:19,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367387065] [2024-11-09 04:30:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:20,138 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-09 04:30:20,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:20,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367387065] [2024-11-09 04:30:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367387065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:20,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203643646] [2024-11-09 04:30:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:20,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:20,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:20,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:30:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:20,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:30:20,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:20,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:20,560 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-09 04:30:20,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203643646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [103918984] [2024-11-09 04:30:20,594 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:30:20,594 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:20,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:20,606 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:20,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:24,172 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 178 for LOIs [2024-11-09 04:30:24,528 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:32,365 WARN L286 SmtUtils]: Spent 7.36s 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-09 04:31:06,669 WARN L286 SmtUtils]: Spent 7.23s 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-09 04:31:29,931 WARN L286 SmtUtils]: Spent 13.82s 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-09 04:31:53,197 WARN L286 SmtUtils]: Spent 11.11s 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-09 04:31:53,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '270#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_11| Int) (|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 0) (= (select (select |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_dll_append_~head#1.base_11| (store (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0 0))) (or (and (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (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_69| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_26| Int) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_69| (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) (or (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) (= |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|)) (and (= (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_26|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_26| (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_26|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_26| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_10| |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_26|)) (= |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_26| (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_26|) 8 0))))) (= |v_#memory_$Pointer$.base_50| (store |v_#memory_$Pointer$.base_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_69| (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)))) (= (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|))) (= |v_ULTIMATE.start_dll_append_~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 12) |#length|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_66| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (store (store (select |v_#memory_$Pointer$.base_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 0))) |v_#memory_$Pointer$.base_70|)) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 0))) |v_#memory_$Pointer$.offset_70|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 0)) (exists ((|v_#valid_29| (Array Int Int))) (and (= (store |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 1) |#valid|) (= (select |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 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_11|) 0) (store (select |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4 (select (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4)))) (= |v_#memory_int_84| (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 0 5))) (= |v_#memory_int_40| (store |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 8))))))) (and (= |v_ULTIMATE.start_dll_append_~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 12) |#length|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_66| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (store (store (select |v_#memory_$Pointer$.base_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 0))) |v_#memory_$Pointer$.base_70|)) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (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_ULTIMATE.start_dll_create_~head~0#1.base_26| Int) (|v_#memory_int_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_69| (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_26|) (= |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$.offset)_AFTER_CALL_9| (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_26| (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_26|) 8 0))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_26|)) (= |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_26|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_26| (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_26|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_26| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_9| |v_ULTIMATE.start_dll_create_~head~0#1.base_26|) 8))) |v_old(#memory_int)_AFTER_CALL_9|))) (= (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|) (= (store |v_#memory_$Pointer$.base_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_69| (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_$Pointer$.offset_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_69| (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|))) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_66| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 0))) |v_#memory_$Pointer$.offset_70|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 0)) (exists ((|v_#valid_29| (Array Int Int))) (and (= (store |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) 1) |#valid|) (= (select |v_#valid_29| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 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_11|) 0) (store (select |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4 (select (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 4)))) (= |v_#memory_int_84| (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 0 5))) (= |v_#memory_int_40| (store |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0) (store (select |v_#memory_int_41| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)) 8)))))))) (= |#memory_int| (store |v_#memory_int_84| |v_ULTIMATE.start_dll_append_~head#1.base_11| (store (select |v_#memory_int_84| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0)))) (= (store |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_dll_append_~head#1.base_11| (store (select |v_#memory_$Pointer$.base_70| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_11|) 0))) |#memory_$Pointer$.base|))) (= |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-09 04:31:53,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:53,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:53,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 04:31:53,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019263001] [2024-11-09 04:31:53,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:31:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:53,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:31:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=297, Unknown=3, NotChecked=0, Total=342 [2024-11-09 04:31:53,208 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09 04:31:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:53,303 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-11-09 04:31:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:31:53,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-11-09 04:31:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:53,304 INFO L225 Difference]: With dead ends: 50 [2024-11-09 04:31:53,305 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 04:31:53,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 88.7s TimeCoverageRelationStatistics Valid=42, Invalid=297, Unknown=3, NotChecked=0, Total=342 [2024-11-09 04:31:53,307 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:53,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:31:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 04:31:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 04:31:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:31:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 04:31:53,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 20 [2024-11-09 04:31:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:53,324 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 04:31:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09 04:31:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 04:31:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 04:31:53,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:53,326 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:53,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:31:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:53,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1403579059, now seen corresponding path program 2 times [2024-11-09 04:31:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082016432] [2024-11-09 04:31:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:31:54,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082016432] [2024-11-09 04:31:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082016432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240565031] [2024-11-09 04:31:54,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:31:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:54,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:54,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:31:54,697 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:31:54,697 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:31:54,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 04:31:54,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:54,865 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-09 04:31:54,930 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-09 04:31:54,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:54,982 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-09 04:31:54,995 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-09 04:31:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-11-09 04:31:55,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240565031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [528505673] [2024-11-09 04:31:55,138 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:31:55,138 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:55,139 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:55,139 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:55,139 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:58,753 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 188 for LOIs [2024-11-09 04:31:59,118 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:32:13,861 WARN L286 SmtUtils]: Spent 11.23s 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-09 04:32:55,307 WARN L286 SmtUtils]: Spent 8.46s 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-09 04:33:16,375 WARN L286 SmtUtils]: Spent 11.06s 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-09 04:33:40,116 WARN L286 SmtUtils]: Spent 10.07s 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-09 04:33:40,118 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '504#(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|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_13| Int) (|v_#memory_int_111| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_111| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_int_111| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)))) (or (and (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.base_84| (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_88| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_88|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_30| (Array Int Int))) (= |#length| (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 12))) (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 (= |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)))) (= |v_#memory_int_41| (store |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_107| (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_111|))) (= |v_ULTIMATE.start_dll_append_~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1)) (= (select |v_#valid_36| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_81| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_81| (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_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_85|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_31| Int) (|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (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_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_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_84| (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_87| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_87| (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 (= |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))) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) (= |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)))) (and (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_21| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8)))) (= (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_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (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_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| (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_31| (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_31|) 8 0)))))))) (and (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.base_84| (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_88| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_88|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_30| (Array Int Int))) (= |#length| (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 12))) (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 (= |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)))) (= |v_#memory_int_41| (store |v_#memory_int_107| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_107| (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_111|))) (= |v_ULTIMATE.start_dll_append_~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_31| Int) (|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (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_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_50| (store |v_#memory_$Pointer$.base_87| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_87| (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)))) (= (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$.offset_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_84| (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|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= |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))) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) (= |v_old(#memory_int)_AFTER_CALL_20| |v_#memory_int_54|)) (and (= |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_31| (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_31|) 8 0))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_20| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (= |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_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (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_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))))) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1)) (= (select |v_#valid_36| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_81| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_81| (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_85| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_85|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 0))) (= (select (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0) (= (store |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_88| |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|))))' at error location [2024-11-09 04:33:40,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:33:40,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:33:40,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-09 04:33:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309665804] [2024-11-09 04:33:40,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:33:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:33:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:33:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=734, Unknown=5, NotChecked=54, Total=870 [2024-11-09 04:33:40,123 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 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-09 04:33:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:41,131 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-11-09 04:33:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:33:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 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 27 [2024-11-09 04:33:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:41,133 INFO L225 Difference]: With dead ends: 40 [2024-11-09 04:33:41,133 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 04:33:41,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 101.9s TimeCoverageRelationStatistics Valid=102, Invalid=953, Unknown=5, NotChecked=62, Total=1122 [2024-11-09 04:33:41,136 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:41,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 35 Unchecked, 0.4s Time] [2024-11-09 04:33:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 04:33:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 04:33:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:33:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 04:33:41,146 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2024-11-09 04:33:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:41,147 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 04:33:41,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 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-09 04:33:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-09 04:33:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:33:41,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:41,148 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] [2024-11-09 04:33:41,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:33:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:41,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -528265712, now seen corresponding path program 1 times [2024-11-09 04:33:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189860007] [2024-11-09 04:33:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:33:43,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189860007] [2024-11-09 04:33:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189860007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126117590] [2024-11-09 04:33:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:33:43,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:33:43,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:33:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:44,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-09 04:33:44,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:44,323 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-09 04:33:44,819 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:33:44,819 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-09 04:33:45,074 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 13 treesize of output 1 [2024-11-09 04:33:45,088 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-09 04:33:45,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 04:33:45,117 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 58 treesize of output 51 [2024-11-09 04:33:45,511 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 04:33:45,511 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 59 treesize of output 35 [2024-11-09 04:33:45,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:33:45,540 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-09 04:33:45,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:33:45,855 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 04:33:45,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 47 [2024-11-09 04:33:45,917 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 04:33:45,918 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-09 04:33:45,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:33:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:33:46,987 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-09 04:33:46,988 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 34 treesize of output 32 [2024-11-09 04:33:47,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:33:47,245 INFO L349 Elim1Store]: treesize reduction 172, result has 14.0 percent of original size [2024-11-09 04:33:47,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 57 [2024-11-09 04:33:47,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:33:47,303 INFO L349 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2024-11-09 04:33:47,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-09 04:33:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:33:48,154 INFO L349 Elim1Store]: treesize reduction 3, result has 98.1 percent of original size [2024-11-09 04:33:48,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 225 [2024-11-09 04:33:48,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:33:48,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2024-11-09 04:33:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:33:49,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126117590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723216351] [2024-11-09 04:33:52,415 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 04:33:52,415 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:33:52,416 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:33:52,416 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:33:52,416 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:33:55,407 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 188 for LOIs [2024-11-09 04:33:55,673 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:35:38,758 WARN L286 SmtUtils]: Spent 19.84s 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-09 04:36:13,932 WARN L286 SmtUtils]: Spent 20.81s 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-09 04:36:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1723216351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:36:13,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:36:13,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [19, 22] total 50 [2024-11-09 04:36:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462094005] [2024-11-09 04:36:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:36:13,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 04:36:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:36:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 04:36:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2887, Unknown=10, NotChecked=0, Total=3080 [2024-11-09 04:36:13,938 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:36:22,148 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-09 04:36:24,895 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-09 04:36:27,277 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-09 04:36:36,189 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-09 04:36:38,962 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-09 04:36:41,718 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-09 04:36:46,503 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-09 04:36:51,261 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-09 04:36:52,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:55,639 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-09 04:36:58,869 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-09 04:37:03,406 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-09 04:37:07,848 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-09 04:37:12,780 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-09 04:37:15,987 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-09 04:37:19,292 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-09 04:37:24,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:25,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:30,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:32,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:35,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:37,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:39,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:41,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:42,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:43,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:47,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:49,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:50,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:52,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:53,293 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-09 04:37:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 04:37:53,295 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 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 30 [2024-11-09 04:37:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:53,296 INFO L225 Difference]: With dead ends: 38 [2024-11-09 04:37:53,296 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 04:37:53,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 145.9s TimeCoverageRelationStatistics Valid=193, Invalid=3103, Unknown=10, NotChecked=0, Total=3306 [2024-11-09 04:37:53,299 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 93.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:53,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 15 Unknown, 0 Unchecked, 97.4s Time] [2024-11-09 04:37:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 04:37:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 04:37:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:37:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-09 04:37:53,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 30 [2024-11-09 04:37:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:53,324 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-09 04:37:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:37:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-09 04:37:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:37:53,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:53,325 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-09 04:37:53,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:53,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:53,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:37:53,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash -881074611, now seen corresponding path program 1 times [2024-11-09 04:37:53,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:53,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622760604] [2024-11-09 04:37:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:37:56,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622760604] [2024-11-09 04:37:56,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622760604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:56,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249515100] [2024-11-09 04:37:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:56,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:56,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:56,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:56,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:37:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:57,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-09 04:37:57,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:57,541 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-09 04:37:58,173 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:37:58,174 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-09 04:37:58,381 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 13 treesize of output 1 [2024-11-09 04:37:58,392 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 31 treesize of output 15 [2024-11-09 04:37:58,400 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 13 treesize of output 1 [2024-11-09 04:37:58,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 15 treesize of output 7 [2024-11-09 04:37:58,957 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 37 treesize of output 21 [2024-11-09 04:37:58,975 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-09 04:37:59,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:59,259 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-09 04:37:59,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:59,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-11-09 04:37:59,363 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 04:37:59,363 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 20 treesize of output 22 [2024-11-09 04:37:59,382 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-09 04:38:00,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 04:38:00,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:38:00,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-11-09 04:38:00,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 04:38:00,544 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-09 04:38:00,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:00,556 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 36 treesize of output 27 [2024-11-09 04:38:00,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:00,572 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-09 04:38:00,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 04:38:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:38:01,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:03,060 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_757 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (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_753)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_757) (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_755)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_752) |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|) .cse0 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-09 04:38:04,179 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| Int) (v_ArrVal_766 (Array Int Int)) (v_ArrVal_753 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_752 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_766))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_767) |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26|) 0)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_768) |ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_753)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_757) (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_755)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| 1)))))) is different from false [2024-11-09 04:38:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249515100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585503118] [2024-11-09 04:38:04,186 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 04:38:04,187 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:38:04,187 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:38:04,187 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:38:04,188 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:38:08,023 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 188 for LOIs [2024-11-09 04:38:08,278 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:38:43,863 WARN L286 SmtUtils]: Spent 25.04s 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-09 04:40:21,704 WARN L286 SmtUtils]: Spent 16.65s 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-09 04:41:02,447 WARN L286 SmtUtils]: Spent 22.48s 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-09 04:41:55,182 WARN L286 SmtUtils]: Spent 21.52s 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-09 04:42:44,407 WARN L286 SmtUtils]: Spent 20.43s 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-09 04:43:33,644 WARN L286 SmtUtils]: Spent 19.76s 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-09 04:43:33,645 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1064#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_181| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_#memory_$Pointer$.base_128| (Array Int (Array Int Int))) (|v_#memory_int_25| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_18| Int) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (and (or (and (exists ((|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_128|)) (= |v_ULTIMATE.start_dll_append_~head#1.base_18| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_180| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_43| Int) (|v_#memory_int_54| (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_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_124| (Array Int (Array Int Int)))) (and (or (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))) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) (= |v_old(#memory_int)_AFTER_CALL_42| |v_#memory_int_54|) (= |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)))) (and (= |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_43| (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_43|) 8 0))) (= |v_old(#memory_int)_AFTER_CALL_42| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_43| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_42| |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) 8)))) (= |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_43|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_43| (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_43|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_43|)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_54| (store |v_#memory_int_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_180| (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)))) (= |v_#memory_$Pointer$.offset_50| (store |v_#memory_$Pointer$.offset_124| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_124| (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)))) (= (store |v_#memory_$Pointer$.base_127| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_127| (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|))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int)))) (and (= |v_#memory_int_40| (store |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8)))) (= |v_#memory_int_41| (store |v_#memory_int_177| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_177| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 (select (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4)))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0 5)) |v_#memory_int_181|))) (exists ((|v_#length_44| (Array Int Int))) (= |#length| (store |v_#length_44| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 12))) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1) |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 0)) (exists ((|v_#valid_58| (Array Int Int))) (and (= |#valid| (store |v_#valid_58| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1)) (= 0 (select |v_#valid_58| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|)))) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_125| (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0)))))) (and (exists ((|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_128|)) (= |v_ULTIMATE.start_dll_append_~head#1.base_18| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int)))) (and (= |v_#memory_int_40| (store |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8)))) (= |v_#memory_int_41| (store |v_#memory_int_177| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_177| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 (select (select |v_#memory_int_41| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4)))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0 5)) |v_#memory_int_181|))) (exists ((|v_#length_44| (Array Int Int))) (= |#length| (store |v_#length_44| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 12))) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_180| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_43| Int) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (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_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_124| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (and (or (and (= |v_old(#memory_int)_AFTER_CALL_43| (store |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_43| (store (select |v_#memory_int_54| |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_43| |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) 8)))) (= |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_43| (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_43|) 8 0))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_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_43|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_43| (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_43|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|)) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_43|) (= |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|) (= (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|))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_127| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_127| (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|) (= |v_#memory_int_54| (store |v_#memory_int_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_180| (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)))) (= |v_#memory_$Pointer$.offset_50| (store |v_#memory_$Pointer$.offset_124| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_124| (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_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1) |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 0)) (exists ((|v_#valid_58| (Array Int Int))) (and (= |#valid| (store |v_#valid_58| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1)) (= 0 (select |v_#valid_58| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|)))) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_125| (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))))))) (= (select (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4)) 0) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_125| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_125| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_125| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_125| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_125| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4)) 0) (= |v_#memory_int_25| (store |v_#memory_int_181| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) (store (select |v_#memory_int_181| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4) (select (select |v_#memory_int_25| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4))))) (= (store (store |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0))) |#memory_$Pointer$.base|) (or (not (= (select (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_dll_append_~head#1.base_18|) 0) 0))))) (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|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 04:43:33,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:43:33,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:43:33,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 39 [2024-11-09 04:43:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387154524] [2024-11-09 04:43:33,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:43:33,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:43:33,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:43:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:43:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3586, Unknown=14, NotChecked=242, Total=4032 [2024-11-09 04:43:33,648 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 39 states, 32 states have (on average 1.5) internal successors, (48), 30 states have internal predecessors, (48), 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-09 04:43:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:43:37,864 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-09 04:43:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 04:43:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.5) internal successors, (48), 30 states have internal predecessors, (48), 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 32 [2024-11-09 04:43:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:43:37,867 INFO L225 Difference]: With dead ends: 52 [2024-11-09 04:43:37,868 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 04:43:37,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 334.3s TimeCoverageRelationStatistics Valid=306, Invalid=5238, Unknown=14, NotChecked=294, Total=5852 [2024-11-09 04:43:37,871 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:43:37,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 451 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 04:43:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 04:43:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2024-11-09 04:43:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:43:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 04:43:37,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 32 [2024-11-09 04:43:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:43:37,890 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 04:43:37,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.5) internal successors, (48), 30 states have internal predecessors, (48), 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-09 04:43:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-09 04:43:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:43:37,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:43:37,891 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:43:37,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:43:38,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:43:38,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:43:38,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:43:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1321863221, now seen corresponding path program 1 times [2024-11-09 04:43:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:43:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979024206] [2024-11-09 04:43:38,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:43:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:43:41,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:43:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979024206] [2024-11-09 04:43:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979024206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:43:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292060173] [2024-11-09 04:43:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:41,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:43:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:43:41,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:43:41,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:43:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:42,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 04:43:42,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:42,311 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-09 04:43:43,122 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:43:43,122 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-09 04:43:43,309 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-09 04:43:43,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:43:43,333 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-09 04:43:43,360 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-09 04:43:43,815 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 04:43:43,815 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-09 04:43:43,823 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-09 04:43:44,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:44,152 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:43:44,152 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-09 04:43:44,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:44,163 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-09 04:43:44,215 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 04:43:44,216 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-09 04:43:45,262 INFO L349 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2024-11-09 04:43:45,262 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-09 04:43:45,304 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 04:43:45,304 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-09 04:43:45,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:45,337 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:43:45,337 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-09 04:43:45,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:45,366 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-09 04:43:45,535 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 04:43:45,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 24 [2024-11-09 04:43:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:43:45,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:43:45,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_972 Int) (v_ArrVal_976 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_973 (Array Int 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_972)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_973))) (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_976) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2024-11-09 04:43:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292060173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:43:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767825247] [2024-11-09 04:43:48,816 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 04:43:48,817 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:43:48,817 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:43:48,817 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:43:48,817 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:43:50,883 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 178 for LOIs [2024-11-09 04:43:51,069 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:44:26,736 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1401#(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|) (exists ((|v_#memory_int_25| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_26| Int) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) (store (select |v_#memory_$Pointer$.offset_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26| (store (select (store |v_#memory_$Pointer$.offset_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) (store (select |v_#memory_$Pointer$.offset_145| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)))) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)))) (= (store |v_#memory_int_211| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) (store (select |v_#memory_int_211| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) 4) (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) 4)))) |v_#memory_int_25|) (= (store (store |v_#memory_$Pointer$.base_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) (store (select |v_#memory_$Pointer$.base_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26| (store (select (store |v_#memory_$Pointer$.base_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) (store (select |v_#memory_$Pointer$.base_148| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_26|) 8))) |#memory_$Pointer$.base|))) (= |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|) (= (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-09 04:44:26,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:44:26,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:44:26,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2024-11-09 04:44:26,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046337083] [2024-11-09 04:44:26,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:44:26,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 04:44:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 04:44:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3577, Unknown=8, NotChecked=120, Total=3906 [2024-11-09 04:44:26,739 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 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-09 04:44:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:31,835 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-11-09 04:44:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 04:44:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 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 32 [2024-11-09 04:44:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:31,838 INFO L225 Difference]: With dead ends: 52 [2024-11-09 04:44:31,838 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 04:44:31,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=464, Invalid=6173, Unknown=9, NotChecked=160, Total=6806 [2024-11-09 04:44:31,840 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:31,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 438 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 04:44:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 04:44:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-11-09 04:44:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-09 04:44:31,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 32 [2024-11-09 04:44:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:31,855 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 04:44:31,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 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-09 04:44:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-09 04:44:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 04:44:31,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:31,857 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:31,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 04:44:32,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:44:32,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:44:32,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 975897928, now seen corresponding path program 1 times [2024-11-09 04:44:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315723466] [2024-11-09 04:44:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:35,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315723466] [2024-11-09 04:44:35,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315723466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:44:35,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526274835] [2024-11-09 04:44:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:35,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:44:35,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:44:35,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:44:35,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:44:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:36,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-09 04:44:36,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:36,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:44:36,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:44:36,686 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:44:36,686 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-09 04:44:37,014 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-09 04:44:37,268 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-09 04:44:37,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:44:37,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2024-11-09 04:44:37,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-09 04:44:37,511 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 39 treesize of output 15 [2024-11-09 04:44:37,519 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-09 04:44:37,543 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 04:44:37,543 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 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 04:44:38,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:38,046 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 90 treesize of output 41 [2024-11-09 04:44:38,054 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-09 04:44:38,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2024-11-09 04:44:38,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:38,364 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-09 04:44:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:38,401 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:44:38,401 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 98 treesize of output 71 [2024-11-09 04:44:38,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:38,446 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 04:44:38,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2024-11-09 04:44:38,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-09 04:44:39,979 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-09 04:44:39,979 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 214 treesize of output 111 [2024-11-09 04:44:39,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:40,008 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:44:40,009 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 171 treesize of output 114 [2024-11-09 04:44:40,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:40,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 18 [2024-11-09 04:44:40,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-09 04:44:40,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:40,202 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 75 treesize of output 34 [2024-11-09 04:44:40,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:44:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:44:40,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:44:40,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 Int) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1194 (Array Int 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_1191) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1192) (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_1190)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1193) |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_1195) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1194) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-09 04:44:41,639 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_34| Int) (v_ArrVal_1190 Int) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1204)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1205))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_34| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select .cse2 .cse3) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 v_ArrVal_1191) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_1190)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1195) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1194) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2024-11-09 04:44:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526274835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:44:41,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969334277] [2024-11-09 04:44:41,644 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 04:44:41,645 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:44:41,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:44:41,645 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:44:41,645 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:44:43,324 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 188 for LOIs [2024-11-09 04:44:43,489 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:45:17,897 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1761#(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|) (exists ((|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_165| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_168| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_30| Int) (|v_#memory_int_251| (Array Int (Array Int Int)))) (and (= |v_#memory_int_25| (store |v_#memory_int_251| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8) (store (select |v_#memory_int_251| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)))))) (= |#memory_int| (store |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30| (store (select |v_#memory_int_25| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_165| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8) (store (select |v_#memory_$Pointer$.offset_165| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30| (store (select (store |v_#memory_$Pointer$.offset_165| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8) (store (select |v_#memory_$Pointer$.offset_165| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8) (store (select |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30| (store (select (store |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8) (store (select |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_30|) 8)))))) (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-09 04:45:17,897 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:45:17,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:45:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2024-11-09 04:45:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193798639] [2024-11-09 04:45:17,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:45:17,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 04:45:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 04:45:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=4461, Unknown=4, NotChecked=270, Total=4970 [2024-11-09 04:45:17,900 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 46 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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-09 04:45:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:20,679 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-11-09 04:45:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 04:45:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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 34 [2024-11-09 04:45:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:20,682 INFO L225 Difference]: With dead ends: 54 [2024-11-09 04:45:20,683 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 04:45:20,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=307, Invalid=5549, Unknown=4, NotChecked=302, Total=6162 [2024-11-09 04:45:20,685 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:20,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 374 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 04:45:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 04:45:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2024-11-09 04:45:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-09 04:45:20,710 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 34 [2024-11-09 04:45:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:20,711 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-09 04:45:20,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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-09 04:45:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-09 04:45:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 04:45:20,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:20,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:45:20,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 04:45:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac4558f8-bf63-4ee4-a184-c9c6ce65861d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:20,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:45:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash 188010202, now seen corresponding path program 1 times [2024-11-09 04:45:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:20,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284952465] [2024-11-09 04:45:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 04:45:21,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284952465] [2024-11-09 04:45:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284952465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:21,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:45:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968687552] [2024-11-09 04:45:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:45:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:45:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:45:21,091 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-09 04:45:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:21,255 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-09 04:45:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:45:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 35 [2024-11-09 04:45:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:21,257 INFO L225 Difference]: With dead ends: 50 [2024-11-09 04:45:21,257 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 04:45:21,257 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-09 04:45:21,258 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:21,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:45:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 04:45:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-09 04:45:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-09 04:45:21,274 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 35 [2024-11-09 04:45:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:21,275 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-09 04:45:21,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-09 04:45:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-09 04:45:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:45:21,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:21,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:45:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:45:21,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:45:21,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1179887229, now seen corresponding path program 2 times [2024-11-09 04:45:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351798940] [2024-11-09 04:45:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat