./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX --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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:10:54,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:10:54,127 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:10:54,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:10:54,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:10:54,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:10:54,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:10:54,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:10:54,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:10:54,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:10:54,164 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:10:54,165 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:10:54,166 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:10:54,166 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:10:54,167 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:10:54,167 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:10:54,168 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:10:54,169 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:10:54,169 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:10:54,170 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:10:54,170 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:10:54,175 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:10:54,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:10:54,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:10:54,177 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:10:54,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:10:54,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:10:54,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:10:54,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:10:54,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:10:54,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:10:54,181 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:10:54,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:10:54,181 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:10:54,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:10:54,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:10:54,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:10:54,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:10:54,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:10:54,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:10:54,183 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:10:54,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:10:54,183 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:10:54,183 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:10:54,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:10:54,184 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_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/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_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-12 00:10:54,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:10:54,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:10:54,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:10:54,596 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:10:54,597 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:10:54,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-12 00:10:57,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:10:58,149 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:10:58,149 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-12 00:10:58,163 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/data/6aec49486/e0add4d5e34e4db3bf1c8d835e665a61/FLAG472e4ebd6 [2023-11-12 00:10:58,178 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/data/6aec49486/e0add4d5e34e4db3bf1c8d835e665a61 [2023-11-12 00:10:58,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:10:58,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:10:58,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:10:58,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:10:58,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:10:58,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463e352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58, skipping insertion in model container [2023-11-12 00:10:58,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:10:58,620 WARN L240 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_8d09df21-e14f-4fa8-af59-462b8a4782f0/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-12 00:10:58,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:10:58,634 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:10:58,722 WARN L240 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_8d09df21-e14f-4fa8-af59-462b8a4782f0/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-12 00:10:58,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:10:58,762 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:10:58,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58 WrapperNode [2023-11-12 00:10:58,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:10:58,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:10:58,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:10:58,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:10:58,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,842 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2023-11-12 00:10:58,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:10:58,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:10:58,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:10:58,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:10:58,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:10:58,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:10:58,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:10:58,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:10:58,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (1/1) ... [2023-11-12 00:10:58,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:10:58,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:58,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:10:58,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:10:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:10:58,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:10:58,971 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:10:58,971 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:10:58,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:10:58,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:10:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:10:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:10:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:10:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:10:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:10:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:10:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:10:58,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:10:59,167 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:10:59,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:10:59,527 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:10:59,606 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:10:59,607 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:10:59,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:59 BoogieIcfgContainer [2023-11-12 00:10:59,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:10:59,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:10:59,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:10:59,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:10:59,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:10:58" (1/3) ... [2023-11-12 00:10:59,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140788a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:10:59, skipping insertion in model container [2023-11-12 00:10:59,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:58" (2/3) ... [2023-11-12 00:10:59,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140788a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:10:59, skipping insertion in model container [2023-11-12 00:10:59,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:59" (3/3) ... [2023-11-12 00:10:59,620 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-12 00:10:59,641 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:10:59,641 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:10:59,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:10:59,698 INFO L357 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, mHoare=true, 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;@323eaec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:10:59,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:10:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 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) [2023-11-12 00:10:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:10:59,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:59,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:59,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:59,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash -165851543, now seen corresponding path program 1 times [2023-11-12 00:10:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:59,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443994854] [2023-11-12 00:10:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:11:00,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443994854] [2023-11-12 00:11:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443994854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:00,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:11:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306878426] [2023-11-12 00:11:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:00,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:00,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:00,434 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-12 00:11:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:00,540 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2023-11-12 00:11:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2023-11-12 00:11:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:00,550 INFO L225 Difference]: With dead ends: 55 [2023-11-12 00:11:00,550 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:11:00,553 INFO L412 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 [2023-11-12 00:11:00,558 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:00,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:11:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-12 00:11:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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) [2023-11-12 00:11:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-12 00:11:00,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2023-11-12 00:11:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:00,603 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-12 00:11:00,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-12 00:11:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-12 00:11:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:11:00,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:00,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:00,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:11:00,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:11:00,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1569845982, now seen corresponding path program 1 times [2023-11-12 00:11:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715574674] [2023-11-12 00:11:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:11:01,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:01,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715574674] [2023-11-12 00:11:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715574674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:01,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:11:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805217466] [2023-11-12 00:11:01,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:01,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:11:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:11:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:11:01,033 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:11:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:01,112 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-12 00:11:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:11:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-11-12 00:11:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:01,114 INFO L225 Difference]: With dead ends: 36 [2023-11-12 00:11:01,114 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:11:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:01,117 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:01,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:11:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:11:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-12 00:11:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-12 00:11:01,125 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2023-11-12 00:11:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:01,125 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-12 00:11:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:11:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-12 00:11:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:11:01,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:01,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:01,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:11:01,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:11:01,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1308238578, now seen corresponding path program 1 times [2023-11-12 00:11:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660462853] [2023-11-12 00:11:01,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:04,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660462853] [2023-11-12 00:11:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660462853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392708010] [2023-11-12 00:11:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:04,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:04,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:04,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:11:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:05,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-12 00:11:05,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:05,553 INFO L351 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 [2023-11-12 00:11:05,634 INFO L351 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 [2023-11-12 00:11:05,786 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:11:05,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 00:11:06,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:11:06,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:11:06,236 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-12 00:11:06,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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 [2023-11-12 00:11:06,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:11:06,458 INFO L351 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 23 treesize of output 11 [2023-11-12 00:11:06,676 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-12 00:11:06,677 INFO L351 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 90 treesize of output 59 [2023-11-12 00:11:06,692 INFO L351 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 36 treesize of output 15 [2023-11-12 00:11:06,862 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:11:06,862 INFO L351 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 70 treesize of output 37 [2023-11-12 00:11:06,880 INFO L351 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 [2023-11-12 00:11:06,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-12 00:11:07,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:07,149 INFO L351 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 [2023-11-12 00:11:07,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:07,194 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 00:11:07,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 59 [2023-11-12 00:11:07,225 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:11:07,225 INFO L351 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-12 00:11:07,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:07,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:07,281 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-12 00:11:07,282 INFO L351 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 [2023-11-12 00:11:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:07,933 INFO L322 Elim1Store]: treesize reduction 47, result has 17.5 percent of original size [2023-11-12 00:11:07,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 97 [2023-11-12 00:11:07,949 INFO L351 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 104 treesize of output 60 [2023-11-12 00:11:07,972 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-12 00:11:08,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:08,005 INFO L351 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 15 treesize of output 7 [2023-11-12 00:11:08,025 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-12 00:11:08,040 INFO L351 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 16 treesize of output 11 [2023-11-12 00:11:08,047 INFO L351 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 6 treesize of output 4 [2023-11-12 00:11:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:11:08,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:13,577 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) (and (or (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_22 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_21) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_22) |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_sll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse2)) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_23 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_21) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_24) |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_sll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) .cse2))) (and .cse3 .cse4)) (or (not .cse3) (not .cse4) (let ((.cse5 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (.cse11 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (not .cse5) (and (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (not (= v_DerPreprocessor_82 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_85))) (or (not (= v_DerPreprocessor_84 (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_88))) (or (not (= v_DerPreprocessor_87 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))))))) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (not (= v_DerPreprocessor_82 (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_85))) (or (forall ((v_DerPreprocessor_86 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_DerPreprocessor_84 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))))))) (not .cse11)) (or (and .cse5 .cse11) (and (forall ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select (store (store |c_#memory_int| .cse12 v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81) (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_78) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse12 v_DerPreprocessor_76) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (or (let ((.cse28 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse22 (not .cse28))) (and (or (and (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse15) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_37) .cse13 v_DerPreprocessor_38) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39))) (or (not (= .cse13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_9) .cse13 v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_9)) (not (= v_DerPreprocessor_38 (select .cse14 .cse13))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_40) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_37)) (not (= .cse15 v_DerPreprocessor_16))))))) (forall ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse17 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse18) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_33) .cse17 v_DerPreprocessor_34) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_35))) (or (not (= v_DerPreprocessor_34 (select .cse16 .cse17))) (not (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_36) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_33 (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_19) .cse17 v_prenex_18) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_19)) (not (= .cse18 v_DerPreprocessor_16))))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_15 v_DerPreprocessor_25) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_26))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) v_DerPreprocessor_15 (select .cse21 v_DerPreprocessor_15)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_29) .cse20 v_DerPreprocessor_30) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31))) (or (= v_DerPreprocessor_15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= v_DerPreprocessor_29 (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse20 v_DerPreprocessor_27) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_28) (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse20 v_DerPreprocessor_15)))))))) .cse22) (or (and (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_48) v_DerPreprocessor_15 v_DerPreprocessor_49) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_50))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_15 (select .cse24 v_DerPreprocessor_15)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_DerPreprocessor_15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_51) .cse23 v_DerPreprocessor_52) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_53) (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_54) .cse23 v_DerPreprocessor_55) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse23 v_DerPreprocessor_15)) (= v_DerPreprocessor_15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_42))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_45) .cse26 v_DerPreprocessor_46) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_47))) (or (not (= v_DerPreprocessor_46 (select .cse25 .cse26))) (not (= .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_44) (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse28) (or (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_58))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse30 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse29 (store (store |c_#memory_int| .cse32 v_DerPreprocessor_59) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_60)) (.cse31 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_61) .cse32 v_DerPreprocessor_62) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_63))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse32 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_17) .cse32 (select .cse29 .cse32)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_17)) (not (= v_DerPreprocessor_61 (select .cse31 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))))) .cse28) (or (and (forall ((v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_70) .cse34 v_DerPreprocessor_71) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_72))) (or (not (= v_DerPreprocessor_71 (select .cse33 .cse34))) (not (= (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_70)) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_69) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_9) .cse34 v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_9)))))) (forall ((v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse36 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_65) .cse36 v_DerPreprocessor_66) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_67))) (or (not (= v_DerPreprocessor_65 (select .cse35 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_68) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_66 (select .cse35 .cse36))) (not (= .cse36 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_19) .cse36 v_prenex_18) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_19))))))) .cse22)))) (forall ((v_ArrVal_341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (forall ((v_ArrVal_341 (Array Int Int))) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse37 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= .cse37 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_74) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2023-11-12 00:11:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392708010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452665903] [2023-11-12 00:11:18,139 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:11:18,139 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:18,143 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:18,151 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:18,152 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:19,861 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:11:19,872 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:50,767 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '359#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |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_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| Int) (|v_#memory_int_139| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_36| Int) (|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_36| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21| Int) (|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_23| Int) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| Int) (|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_23| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22| Int) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (or (and (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_36| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22|) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_23|))) (= (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| (select (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|))) |v_#memory_int_83|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| 0))) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_36| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (= |#memory_int| (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_23|)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|))) (= |#memory_int| (store |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25| (store (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)))) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| 0) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_28| 0) (or (and (= (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0))) |v_#memory_int_85|) (= |v_#memory_int_84| (store |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (store (select |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (select (select |v_#memory_int_84| (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))))) (or (not (= (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0))) (= |v_#memory_$Pointer$.offset_73| (store (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (store (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0))) (= (store (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) (store (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) (select (select (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0)) (select (select (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|)) |v_#memory_$Pointer$.base_73|)) (and (= (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|)) |v_#memory_$Pointer$.base_73|) (= (select (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 0)) |v_#memory_$Pointer$.offset_73|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (= (select (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|) 0) 0) (= (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0 (select (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_26|) 0))) |v_#memory_int_84|))))) (<= 2 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_25|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (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 [2023-11-12 00:11:50,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:50,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:11:50,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2023-11-12 00:11:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378145091] [2023-11-12 00:11:50,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-12 00:11:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:50,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-12 00:11:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2881, Unknown=39, NotChecked=108, Total=3192 [2023-11-12 00:11:50,778 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 37 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 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) [2023-11-12 00:11:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:54,097 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-11-12 00:11:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-12 00:11:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 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 23 [2023-11-12 00:11:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:54,104 INFO L225 Difference]: With dead ends: 40 [2023-11-12 00:11:54,104 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:11:54,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=275, Invalid=4517, Unknown=42, NotChecked=136, Total=4970 [2023-11-12 00:11:54,108 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:54,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 237 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 00:11:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:11:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2023-11-12 00:11:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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) [2023-11-12 00:11:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-11-12 00:11:54,136 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 23 [2023-11-12 00:11:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:54,136 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-11-12 00:11:54,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 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) [2023-11-12 00:11:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-11-12 00:11:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:11:54,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:54,138 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:54,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:54,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:54,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:11:54,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1788343646, now seen corresponding path program 2 times [2023-11-12 00:11:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:54,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264092938] [2023-11-12 00:11:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:11:54,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264092938] [2023-11-12 00:11:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264092938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:54,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671739817] [2023-11-12 00:11:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:54,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:11:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:11:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:54,537 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:11:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:54,730 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-11-12 00:11:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:11:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-12 00:11:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:54,731 INFO L225 Difference]: With dead ends: 39 [2023-11-12 00:11:54,732 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:11:54,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:11:54,733 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:54,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:11:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:11:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:11:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:11:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-11-12 00:11:54,751 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2023-11-12 00:11:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:54,752 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-11-12 00:11:54,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:11:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-11-12 00:11:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:11:54,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:54,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:54,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:11:54,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:11:54,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1284687989, now seen corresponding path program 1 times [2023-11-12 00:11:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564755444] [2023-11-12 00:11:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:11:55,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564755444] [2023-11-12 00:11:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564755444] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401391187] [2023-11-12 00:11:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:55,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:55,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:55,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d09df21-e14f-4fa8-af59-462b8a4782f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:11:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:55,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 00:11:55,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:11:55,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:11:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401391187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:11:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930117797] [2023-11-12 00:11:55,469 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:11:55,470 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:55,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:55,471 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:55,471 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs