./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:32:36,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:32:36,961 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:32:36,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:32:36,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:32:37,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:32:37,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:32:37,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:32:37,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:32:37,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:32:37,021 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:32:37,023 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:32:37,023 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:32:37,026 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:32:37,026 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:32:37,027 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:32:37,028 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:32:37,028 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:32:37,029 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:32:37,029 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:32:37,031 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:32:37,031 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:32:37,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:32:37,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:32:37,033 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:32:37,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:32:37,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:32:37,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:32:37,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:32:37,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:32:37,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:32:37,036 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:32:37,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:32:37,037 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:32:37,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:32:37,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:32:37,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:32:37,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:32:37,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:32:37,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:32:37,040 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:32:37,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:32:37,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:32:37,041 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:32:37,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:32:37,041 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_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/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_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-06 20:32:37,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:32:37,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:32:37,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:32:37,386 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:32:37,387 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:32:37,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-06 20:32:40,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:32:40,904 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:32:40,904 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-06 20:32:40,919 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/data/29be80e6e/8437d5b812014ac4a688b9dafcf84c2b/FLAG4c82dbf83 [2023-11-06 20:32:40,935 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/data/29be80e6e/8437d5b812014ac4a688b9dafcf84c2b [2023-11-06 20:32:40,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:32:40,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:32:40,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:32:40,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:32:40,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:32:40,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:32:40" (1/1) ... [2023-11-06 20:32:40,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692c822e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:40, skipping insertion in model container [2023-11-06 20:32:40,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:32:40" (1/1) ... [2023-11-06 20:32:40,991 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:32:41,375 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_723aae0e-1d3b-4956-8c15-73218f4fc095/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-06 20:32:41,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:32:41,394 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:32:41,459 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_723aae0e-1d3b-4956-8c15-73218f4fc095/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-06 20:32:41,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:32:41,494 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:32:41,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41 WrapperNode [2023-11-06 20:32:41,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:32:41,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:32:41,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:32:41,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:32:41,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,557 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-11-06 20:32:41,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:32:41,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:32:41,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:32:41,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:32:41,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:32:41,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:32:41,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:32:41,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:32:41,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (1/1) ... [2023-11-06 20:32:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:32:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:32:41,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:32:41,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:32:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-06 20:32:41,727 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-06 20:32:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:32:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:32:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:32:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:32:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:32:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:32:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:32:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:32:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:32:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:32:41,892 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:32:41,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:32:41,949 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-06 20:32:42,172 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:32:42,243 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:32:42,243 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 20:32:42,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:32:42 BoogieIcfgContainer [2023-11-06 20:32:42,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:32:42,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:32:42,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:32:42,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:32:42,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:32:40" (1/3) ... [2023-11-06 20:32:42,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41866c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:32:42, skipping insertion in model container [2023-11-06 20:32:42,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:32:41" (2/3) ... [2023-11-06 20:32:42,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41866c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:32:42, skipping insertion in model container [2023-11-06 20:32:42,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:32:42" (3/3) ... [2023-11-06 20:32:42,264 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-06 20:32:42,286 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:32:42,286 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:32:42,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:32:42,356 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=LoopsAndPotentialCycles, 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;@23e49c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:32:42,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:32:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 20:32:42,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:32:42,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:32:42,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:32:42,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:32:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash 545307248, now seen corresponding path program 1 times [2023-11-06 20:32:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:32:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822553859] [2023-11-06 20:32:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:32:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:32:42,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:32:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822553859] [2023-11-06 20:32:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822553859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:32:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:32:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:32:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800377880] [2023-11-06 20:32:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:32:42,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:32:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:32:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:32:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:32:42,782 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:32:42,824 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2023-11-06 20:32:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:32:42,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-06 20:32:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:32:42,833 INFO L225 Difference]: With dead ends: 38 [2023-11-06 20:32:42,833 INFO L226 Difference]: Without dead ends: 18 [2023-11-06 20:32:42,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:32:42,839 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:32:42,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:32:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-06 20:32:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-06 20:32:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-06 20:32:42,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2023-11-06 20:32:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:32:42,870 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-06 20:32:42,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-06 20:32:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:32:42,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:32:42,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:32:42,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:32:42,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:32:42,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:32:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash 76022282, now seen corresponding path program 1 times [2023-11-06 20:32:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:32:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61865675] [2023-11-06 20:32:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:32:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:32:43,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:32:43,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61865675] [2023-11-06 20:32:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61865675] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:32:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302999335] [2023-11-06 20:32:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:32:43,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:32:43,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:32:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:43,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:32:43,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:32:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:32:43,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:32:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:32:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302999335] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:32:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817302777] [2023-11-06 20:32:43,253 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:32:43,253 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:32:43,257 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:32:43,264 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:32:43,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:32:44,636 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:32:45,050 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '162#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_30| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_30| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |#memory_int| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0))))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-06 20:32:45,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:32:45,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:32:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-06 20:32:45,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514458336] [2023-11-06 20:32:45,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:32:45,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:32:45,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:32:45,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:32:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-06 20:32:45,056 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:32:45,117 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-06 20:32:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:32:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 20:32:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:32:45,120 INFO L225 Difference]: With dead ends: 34 [2023-11-06 20:32:45,120 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 20:32:45,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-06 20:32:45,124 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:32:45,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:32:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 20:32:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-06 20:32:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-06 20:32:45,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2023-11-06 20:32:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:32:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-06 20:32:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-06 20:32:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 20:32:45,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:32:45,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:32:45,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:32:45,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:45,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:32:45,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:32:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash 633974256, now seen corresponding path program 2 times [2023-11-06 20:32:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:32:45,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109296322] [2023-11-06 20:32:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:32:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:32:46,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:32:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109296322] [2023-11-06 20:32:46,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109296322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:32:46,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948023719] [2023-11-06 20:32:46,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:32:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:32:46,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:32:46,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:32:46,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 20:32:46,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:32:46,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 20:32:46,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:32:46,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:32:46,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 20:32:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 20:32:46,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:32:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 20:32:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948023719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:32:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [829686346] [2023-11-06 20:32:47,129 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-06 20:32:47,130 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:32:47,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:32:47,130 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:32:47,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:32:47,879 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:32:48,452 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '374#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_42| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0))) (= |#memory_int| (store |v_#memory_int_63| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_63| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (store |v_#memory_$Pointer$.base_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-06 20:32:48,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:32:48,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:32:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2023-11-06 20:32:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328161169] [2023-11-06 20:32:48,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:32:48,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 20:32:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:32:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 20:32:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2023-11-06 20:32:48,456 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:32:48,845 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-06 20:32:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 20:32:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 20:32:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:32:48,847 INFO L225 Difference]: With dead ends: 29 [2023-11-06 20:32:48,847 INFO L226 Difference]: Without dead ends: 27 [2023-11-06 20:32:48,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2023-11-06 20:32:48,849 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:32:48,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:32:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-06 20:32:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-06 20:32:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-06 20:32:48,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2023-11-06 20:32:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:32:48,856 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-06 20:32:48,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-06 20:32:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 20:32:48,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:32:48,857 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:32:48,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:32:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:49,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:32:49,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:32:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1756795556, now seen corresponding path program 1 times [2023-11-06 20:32:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:32:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59228804] [2023-11-06 20:32:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:32:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:32:50,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:32:50,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59228804] [2023-11-06 20:32:50,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59228804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:32:50,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850935897] [2023-11-06 20:32:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:50,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:32:50,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:32:50,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:32:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:50,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-06 20:32:50,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:32:50,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:32:50,982 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 18 treesize of output 7 [2023-11-06 20:32:51,014 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 20:32:51,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-06 20:32:51,031 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 22 treesize of output 1 [2023-11-06 20:32:51,110 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 20:32:51,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-11-06 20:32:51,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-06 20:32:51,137 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 20:32:51,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 20:32:51,316 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 20:32:51,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2023-11-06 20:32:51,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:51,330 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-11-06 20:32:51,395 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 20:32:51,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-06 20:32:51,416 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 20:32:51,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-11-06 20:32:51,429 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:51,430 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2023-11-06 20:32:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:32:51,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:32:52,085 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:52,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 536 treesize of output 548 [2023-11-06 20:32:52,763 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or .cse0 (and (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_372 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse2 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse4 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse4 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_369 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_372 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse5) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse9 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_372 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse0) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_5 Int)) (or (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse3)) (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)) (= (select v_prenex_4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int)) (or (forall ((v_prenex_4 (Array Int Int))) (or (= (select v_prenex_4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int)) (let ((.cse11 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse3)) (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= (select v_prenex_4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int)) (let ((.cse12 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse3)) (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse3)) (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)) (= (select v_prenex_4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse5))) is different from false [2023-11-06 20:32:53,525 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or .cse0 (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 4)) (= (select v_ArrVal_372 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_369 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 4)) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 4)) (= (select v_ArrVal_372 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_369 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_369)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4)) (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4))))))))) (or (and (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_372 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_372 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse6 .cse0) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_5 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) (forall ((v_prenex_4 (Array Int Int))) (or (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int)) (let ((.cse10 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 4))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 4)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 4))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int)) (let ((.cse12 (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 4))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 4)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse6) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_5 Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) (forall ((v_ArrVal_359 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| v_prenex_5 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_359) v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))))))) is different from false [2023-11-06 20:32:53,771 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:53,771 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2023-11-06 20:32:53,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:53,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:53,786 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:53,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2023-11-06 20:32:53,813 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 41 treesize of output 29 [2023-11-06 20:32:53,822 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-06 20:32:53,834 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,835 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-06 20:32:53,846 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,847 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-06 20:32:53,862 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,863 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-06 20:32:53,874 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,874 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 20:32:53,884 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,884 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 20:32:53,900 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,901 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-06 20:32:53,913 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:53,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2023-11-06 20:32:53,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:53,922 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:53,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2023-11-06 20:32:53,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:53,930 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 13 treesize of output 7 [2023-11-06 20:32:53,952 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 20:32:53,952 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 20:32:53,965 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:32:53,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 55 [2023-11-06 20:32:53,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:53,986 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 20:32:53,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 124 [2023-11-06 20:32:53,996 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:53,997 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 31 treesize of output 21 [2023-11-06 20:32:54,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 20:32:54,004 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 13 treesize of output 7 [2023-11-06 20:32:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2023-11-06 20:32:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850935897] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:32:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [370383692] [2023-11-06 20:32:54,118 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-06 20:32:54,118 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:32:54,118 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:32:54,118 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:32:54,119 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:32:55,360 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:32:55,982 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '623#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (exists ((|v_ULTIMATE.start_main_#t~mem7#1_24| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |v_ULTIMATE.start_main_#t~mem7#1_24|) (not (= |v_ULTIMATE.start_main_#t~mem7#1_24| 1)))) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-06 20:32:55,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:32:55,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:32:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-11-06 20:32:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894043637] [2023-11-06 20:32:55,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:32:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 20:32:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:32:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 20:32:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1067, Unknown=10, NotChecked=134, Total=1332 [2023-11-06 20:32:55,986 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:32:57,521 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-11-06 20:32:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 20:32:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 20:32:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:32:57,523 INFO L225 Difference]: With dead ends: 41 [2023-11-06 20:32:57,523 INFO L226 Difference]: Without dead ends: 39 [2023-11-06 20:32:57,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=263, Invalid=1805, Unknown=10, NotChecked=178, Total=2256 [2023-11-06 20:32:57,525 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:32:57,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 82 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2023-11-06 20:32:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-06 20:32:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2023-11-06 20:32:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-06 20:32:57,533 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-11-06 20:32:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:32:57,533 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-06 20:32:57,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:32:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-06 20:32:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 20:32:57,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:32:57,534 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:32:57,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:32:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:57,741 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:32:57,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:32:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1375297979, now seen corresponding path program 1 times [2023-11-06 20:32:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:32:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770139488] [2023-11-06 20:32:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:32:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:32:58,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:32:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770139488] [2023-11-06 20:32:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770139488] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:32:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852615764] [2023-11-06 20:32:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:32:58,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:32:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:32:58,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:32:58,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:32:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:32:58,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 20:32:58,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:32:58,513 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-06 20:32:58,566 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 20:32:58,566 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 19 treesize of output 16 [2023-11-06 20:32:58,600 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 20:32:58,601 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 19 treesize of output 16 [2023-11-06 20:32:58,627 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 20:32:58,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 20:32:58,706 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-06 20:32:58,707 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-06 20:32:58,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-06 20:32:58,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-06 20:32:58,851 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 20:32:58,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-06 20:32:58,860 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 20:32:58,861 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2023-11-06 20:32:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:32:58,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:32:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:32:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852615764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:32:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633569852] [2023-11-06 20:32:59,148 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:32:59,148 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:32:59,149 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:32:59,149 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:32:59,149 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:32:59,782 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:33:01,031 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '902#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 3) 0)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| Int) (|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_74| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_int_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 (select (select |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0))) |v_#memory_int_118|) (= 1 (select (select |v_#memory_int_118| |ULTIMATE.start_main_~head~1#1.base|) 4)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.offset_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 0)) |ULTIMATE.start_main_~head~1#1.base| (store (select (store |v_#memory_$Pointer$.offset_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.offset_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 0)) |ULTIMATE.start_main_~head~1#1.base|) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_118| |ULTIMATE.start_main_~head~1#1.base| (store (select |v_#memory_int_118| |ULTIMATE.start_main_~head~1#1.base|) 4 1))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~head~1#1.base| (store (select (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~head~1#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) 4)))))) (= |ULTIMATE.start_main_~len~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) 0) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) 0)) (= (+ 3 |ULTIMATE.start_main_~data_new~0#1|) 0) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-06 20:33:01,031 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:33:01,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:33:01,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-06 20:33:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098940927] [2023-11-06 20:33:01,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:33:01,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 20:33:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 20:33:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2023-11-06 20:33:01,033 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:01,265 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-11-06 20:33:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 20:33:01,266 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-06 20:33:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:01,266 INFO L225 Difference]: With dead ends: 36 [2023-11-06 20:33:01,267 INFO L226 Difference]: Without dead ends: 30 [2023-11-06 20:33:01,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 20:33:01,269 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:01,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-06 20:33:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-06 20:33:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-06 20:33:01,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2023-11-06 20:33:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:01,276 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-06 20:33:01,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-06 20:33:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 20:33:01,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:01,278 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:01,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 20:33:01,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:33:01,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:33:01,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1774124688, now seen corresponding path program 2 times [2023-11-06 20:33:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659298373] [2023-11-06 20:33:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:33:03,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659298373] [2023-11-06 20:33:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659298373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:33:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602937855] [2023-11-06 20:33:03,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:33:03,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:33:03,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:33:03,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:33:04,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_723aae0e-1d3b-4956-8c15-73218f4fc095/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 20:33:04,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-06 20:33:04,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:33:04,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-06 20:33:04,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:33:04,841 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-06 20:33:04,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:33:04,985 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 20:33:04,985 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-06 20:33:05,083 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 18 treesize of output 7 [2023-11-06 20:33:05,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 20:33:05,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-06 20:33:05,203 INFO L322 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-06 20:33:05,204 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-06 20:33:05,331 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 66 treesize of output 31 [2023-11-06 20:33:05,336 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 24 treesize of output 19 [2023-11-06 20:33:05,348 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 30 treesize of output 22 [2023-11-06 20:33:05,489 INFO L322 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-11-06 20:33:05,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 59 [2023-11-06 20:33:05,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 20:33:05,524 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-06 20:33:05,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 20:33:05,987 INFO L322 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-06 20:33:05,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 117 [2023-11-06 20:33:06,077 INFO L322 Elim1Store]: treesize reduction 60, result has 62.5 percent of original size [2023-11-06 20:33:06,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 235 [2023-11-06 20:33:06,101 INFO L322 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-11-06 20:33:06,101 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 155