./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:56:39,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:56:39,691 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:56:39,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:56:39,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:56:39,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:56:39,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:56:39,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:56:39,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:56:39,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:56:39,743 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:56:39,744 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:56:39,744 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:56:39,746 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:56:39,746 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:56:39,747 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:56:39,747 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:56:39,748 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:56:39,748 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:56:39,749 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:56:39,749 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:56:39,750 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:56:39,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:56:39,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:56:39,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:56:39,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:56:39,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:56:39,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:56:39,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:56:39,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:56:39,755 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:56:39,755 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:56:39,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:56:39,756 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:56:39,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:56:39,756 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:56:39,756 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:56:39,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:56:39,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:56:39,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:39,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:56:39,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:56:39,758 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:56:39,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:56:39,759 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:56:39,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:56:39,759 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_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2023-11-12 00:56:40,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:56:40,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:56:40,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:56:40,045 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:56:40,046 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:56:40,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-11-12 00:56:43,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:56:43,520 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:56:43,521 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-11-12 00:56:43,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/data/e91f9ef83/fa54d26cb455484dbf290400936a4d61/FLAG4a4dcf1cf [2023-11-12 00:56:43,560 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/data/e91f9ef83/fa54d26cb455484dbf290400936a4d61 [2023-11-12 00:56:43,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:56:43,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:56:43,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:43,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:56:43,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:56:43,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:43" (1/1) ... [2023-11-12 00:56:43,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ffb31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:43, skipping insertion in model container [2023-11-12 00:56:43,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:43" (1/1) ... [2023-11-12 00:56:43,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:56:43,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:44,002 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:56:44,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:44,079 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:56:44,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44 WrapperNode [2023-11-12 00:56:44,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:44,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:44,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:56:44,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:56:44,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,130 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2023-11-12 00:56:44,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:44,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:56:44,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:56:44,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:56:44,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:56:44,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:56:44,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:56:44,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:56:44,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (1/1) ... [2023-11-12 00:56:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:44,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:56:44,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:56:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:56:44,312 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:56:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:56:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:56:44,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:56:44,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:56:44,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:56:44,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:56:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:56:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:56:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:56:44,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:56:44,452 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:56:44,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:56:44,488 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:56:44,742 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:56:44,816 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:56:44,822 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:56:44,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:44 BoogieIcfgContainer [2023-11-12 00:56:44,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:56:44,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:56:44,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:56:44,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:56:44,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:56:43" (1/3) ... [2023-11-12 00:56:44,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e7b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:44, skipping insertion in model container [2023-11-12 00:56:44,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:44" (2/3) ... [2023-11-12 00:56:44,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e7b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:44, skipping insertion in model container [2023-11-12 00:56:44,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:44" (3/3) ... [2023-11-12 00:56:44,836 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2023-11-12 00:56:44,857 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:56:44,858 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-11-12 00:56:44,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:56:44,915 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2a25b5f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:56:44,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-12 00:56:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 56 states have internal predecessors, (65), 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-12 00:56:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:56:44,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:44,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:56:44,928 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:44,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 160906, now seen corresponding path program 1 times [2023-11-12 00:56:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259716731] [2023-11-12 00:56:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:45,282 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-12 00:56:45,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259716731] [2023-11-12 00:56:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259716731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:56:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912288497] [2023-11-12 00:56:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:45,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:45,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:45,348 INFO L87 Difference]: Start difference. First operand has 58 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 56 states have internal predecessors, (65), 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, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12 00:56:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:45,480 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-12 00:56:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-11-12 00:56:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:45,490 INFO L225 Difference]: With dead ends: 54 [2023-11-12 00:56:45,490 INFO L226 Difference]: Without dead ends: 49 [2023-11-12 00:56:45,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:45,496 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:45,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-12 00:56:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-12 00:56:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 48 states have internal predecessors, (52), 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-12 00:56:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-11-12 00:56:45,539 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 3 [2023-11-12 00:56:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:45,540 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-11-12 00:56:45,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12 00:56:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-11-12 00:56:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:56:45,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:45,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:56:45,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:56:45,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:45,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 160907, now seen corresponding path program 1 times [2023-11-12 00:56:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438326763] [2023-11-12 00:56:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:45,707 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-12 00:56:45,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438326763] [2023-11-12 00:56:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438326763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:45,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:56:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079410630] [2023-11-12 00:56:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:45,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:45,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:45,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:45,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:45,712 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12 00:56:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:45,771 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2023-11-12 00:56:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:45,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-11-12 00:56:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:45,773 INFO L225 Difference]: With dead ends: 46 [2023-11-12 00:56:45,773 INFO L226 Difference]: Without dead ends: 46 [2023-11-12 00:56:45,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:45,775 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:45,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-12 00:56:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-12 00:56:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 45 states have internal predecessors, (49), 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-12 00:56:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-11-12 00:56:45,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2023-11-12 00:56:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:45,784 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-11-12 00:56:45,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12 00:56:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-11-12 00:56:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:56:45,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:45,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:45,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:56:45,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:45,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1720578016, now seen corresponding path program 1 times [2023-11-12 00:56:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547257368] [2023-11-12 00:56:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:45,936 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-12 00:56:45,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:45,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547257368] [2023-11-12 00:56:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547257368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:45,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:56:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900223217] [2023-11-12 00:56:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:45,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:56:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:56:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:56:45,940 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-12 00:56:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:46,053 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-12 00:56:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:56:46,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-12 00:56:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:46,054 INFO L225 Difference]: With dead ends: 53 [2023-11-12 00:56:46,055 INFO L226 Difference]: Without dead ends: 53 [2023-11-12 00:56:46,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:56:46,057 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:46,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 63 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-12 00:56:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-11-12 00:56:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 44 states have internal predecessors, (50), 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-12 00:56:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-11-12 00:56:46,064 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 7 [2023-11-12 00:56:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:46,064 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-11-12 00:56:46,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-12 00:56:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-11-12 00:56:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:56:46,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:46,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:46,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:56:46,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:46,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1720578015, now seen corresponding path program 1 times [2023-11-12 00:56:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419055950] [2023-11-12 00:56:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:46,156 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-12 00:56:46,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419055950] [2023-11-12 00:56:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419055950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860288616] [2023-11-12 00:56:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:46,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:46,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:46,159 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. 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-12 00:56:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:46,185 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-11-12 00:56:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:46,185 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-12 00:56:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:46,186 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:56:46,187 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 00:56:46,187 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-12 00:56:46,189 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:46,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 00:56:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2023-11-12 00:56:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 42 states have internal predecessors, (46), 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-12 00:56:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-11-12 00:56:46,196 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 7 [2023-11-12 00:56:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:46,197 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-11-12 00:56:46,197 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-12 00:56:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-11-12 00:56:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:56:46,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:46,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:46,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:56:46,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:46,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1720686876, now seen corresponding path program 1 times [2023-11-12 00:56:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113916248] [2023-11-12 00:56:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:46,311 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-12 00:56:46,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113916248] [2023-11-12 00:56:46,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113916248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:46,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:46,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513492454] [2023-11-12 00:56:46,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:46,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:46,318 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 00:56:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:46,377 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-11-12 00:56:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 00:56:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:46,379 INFO L225 Difference]: With dead ends: 41 [2023-11-12 00:56:46,379 INFO L226 Difference]: Without dead ends: 41 [2023-11-12 00:56:46,381 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-12 00:56:46,388 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:46,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-12 00:56:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-12 00:56:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 40 states have internal predecessors, (44), 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-12 00:56:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-11-12 00:56:46,394 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2023-11-12 00:56:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:46,394 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-11-12 00:56:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 00:56:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-11-12 00:56:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:56:46,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:46,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:46,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:56:46,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:46,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1720686875, now seen corresponding path program 1 times [2023-11-12 00:56:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:46,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867780371] [2023-11-12 00:56:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:46,609 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-12 00:56:46,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867780371] [2023-11-12 00:56:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867780371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809984995] [2023-11-12 00:56:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:46,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:46,612 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 00:56:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:46,659 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-11-12 00:56:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 00:56:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:46,661 INFO L225 Difference]: With dead ends: 39 [2023-11-12 00:56:46,661 INFO L226 Difference]: Without dead ends: 39 [2023-11-12 00:56:46,661 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-12 00:56:46,663 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:46,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-12 00:56:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-12 00:56:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.5) internal successors, (42), 38 states have internal predecessors, (42), 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-12 00:56:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-11-12 00:56:46,668 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2023-11-12 00:56:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:46,669 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-11-12 00:56:46,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12 00:56:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-11-12 00:56:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:56:46,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:46,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:56:46,671 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:46,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 193706457, now seen corresponding path program 1 times [2023-11-12 00:56:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568409373] [2023-11-12 00:56:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:46,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568409373] [2023-11-12 00:56:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568409373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:46,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:46,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:56:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208388902] [2023-11-12 00:56:46,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:56:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:56:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:56:46,790 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-12 00:56:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:46,895 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-11-12 00:56:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:56:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-11-12 00:56:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:46,900 INFO L225 Difference]: With dead ends: 41 [2023-11-12 00:56:46,900 INFO L226 Difference]: Without dead ends: 41 [2023-11-12 00:56:46,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:46,902 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:46,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-12 00:56:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-11-12 00:56:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 39 states have internal predecessors, (44), 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-12 00:56:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-11-12 00:56:46,906 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2023-11-12 00:56:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:46,907 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-11-12 00:56:46,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-12 00:56:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-11-12 00:56:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:56:46,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:46,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:46,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:56:46,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:46,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 193706458, now seen corresponding path program 1 times [2023-11-12 00:56:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085196658] [2023-11-12 00:56:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:46,982 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-12 00:56:46,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085196658] [2023-11-12 00:56:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085196658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516354732] [2023-11-12 00:56:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:46,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:47,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:56:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:47,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:56:47,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:47,174 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-12 00:56:47,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:47,207 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-12 00:56:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516354732] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861730704] [2023-11-12 00:56:47,231 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-12 00:56:47,232 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:47,236 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:47,242 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:47,243 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:49,137 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1861730704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:50,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:56:50,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 13 [2023-11-12 00:56:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388678946] [2023-11-12 00:56:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:50,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:56:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:50,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:56:50,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=135, Unknown=4, NotChecked=0, Total=182 [2023-11-12 00:56:50,877 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-12 00:56:53,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 00:56:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:54,177 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2023-11-12 00:56:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:56:54,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2023-11-12 00:56:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:54,179 INFO L225 Difference]: With dead ends: 46 [2023-11-12 00:56:54,179 INFO L226 Difference]: Without dead ends: 46 [2023-11-12 00:56:54,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=179, Unknown=5, NotChecked=0, Total=240 [2023-11-12 00:56:54,180 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:54,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 3.0s Time] [2023-11-12 00:56:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-12 00:56:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-11-12 00:56:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 41 states have internal predecessors, (46), 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-12 00:56:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-11-12 00:56:54,185 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2023-11-12 00:56:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:54,185 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-11-12 00:56:54,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-12 00:56:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-11-12 00:56:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:56:54,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:54,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:54,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:54,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:54,387 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:54,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1726951539, now seen corresponding path program 1 times [2023-11-12 00:56:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523054120] [2023-11-12 00:56:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:54,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523054120] [2023-11-12 00:56:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523054120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:54,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:54,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635114856] [2023-11-12 00:56:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:54,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:54,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:54,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:54,510 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-12 00:56:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:54,625 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-11-12 00:56:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:56:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2023-11-12 00:56:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:54,626 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:56:54,626 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 00:56:54,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:54,627 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:54,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 00:56:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2023-11-12 00:56:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.46875) internal successors, (47), 42 states have internal predecessors, (47), 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-12 00:56:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-12 00:56:54,631 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 14 [2023-11-12 00:56:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:54,631 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-12 00:56:54,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-12 00:56:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-12 00:56:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:56:54,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:54,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:56:54,633 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:54,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1995901011, now seen corresponding path program 1 times [2023-11-12 00:56:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997889718] [2023-11-12 00:56:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:54,701 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-12 00:56:54,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997889718] [2023-11-12 00:56:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997889718] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334270432] [2023-11-12 00:56:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:54,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:54,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:54,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:56:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:54,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:56:54,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:54,850 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-12 00:56:54,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:54,875 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-12 00:56:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334270432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1273018267] [2023-11-12 00:56:54,879 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:56:54,879 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:54,880 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:54,880 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:54,880 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:55,861 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:56,633 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1073#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (<= 8 (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 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) (exists ((|v_#memory_$Pointer$.offset_61| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_61| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27| Int) (|v_#memory_int_60| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27| (store (select |v_#memory_$Pointer$.offset_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27|) 0 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27|)) (= (store |v_#memory_$Pointer$.base_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27| (store (select |v_#memory_$Pointer$.base_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27|) 1) (= |#memory_int| (store |v_#memory_int_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27| (store (select |v_#memory_int_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_27|) 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-12 00:56:56,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:56,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:56:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-12 00:56:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363670759] [2023-11-12 00:56:56,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=158, Unknown=2, NotChecked=0, Total=210 [2023-11-12 00:56:56,635 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 00:56:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:56,672 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-11-12 00:56:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:56,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 15 [2023-11-12 00:56:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:56,673 INFO L225 Difference]: With dead ends: 55 [2023-11-12 00:56:56,673 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 00:56:56,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=158, Unknown=2, NotChecked=0, Total=210 [2023-11-12 00:56:56,674 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:56,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 00:56:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-12 00:56:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 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-12 00:56:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-11-12 00:56:56,679 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2023-11-12 00:56:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:56,679 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-11-12 00:56:56,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 00:56:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-11-12 00:56:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:56:56,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:56,680 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:56,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:56,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:56,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:56:56,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1545941928, now seen corresponding path program 2 times [2023-11-12 00:56:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:56,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402434561] [2023-11-12 00:56:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:56:58,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402434561] [2023-11-12 00:56:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402434561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646036815] [2023-11-12 00:56:58,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:56:58,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:58,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:58,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:56:58,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 00:56:58,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:56:58,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:56:58,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:58,442 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 13 treesize of output 9 [2023-11-12 00:56:58,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:58,507 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 25 treesize of output 13 [2023-11-12 00:56:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:58,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:58,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646036815] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1451490418] [2023-11-12 00:56:58,787 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:56:58,788 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:58,788 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:58,789 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:58,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:59,784 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:00,849 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1366#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (<= 8 (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 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) (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29|) 1) (= |#memory_int| (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29| (store (select |v_#memory_$Pointer$.offset_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29|) 0 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29| (store (select |v_#memory_$Pointer$.base_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_29|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|))))) (= |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-12 00:57:00,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:00,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:00,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2023-11-12 00:57:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902357873] [2023-11-12 00:57:00,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:57:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:57:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=598, Unknown=2, NotChecked=0, Total=702 [2023-11-12 00:57:00,852 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 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-12 00:57:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:01,192 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-11-12 00:57:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:57:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 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 27 [2023-11-12 00:57:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:01,193 INFO L225 Difference]: With dead ends: 55 [2023-11-12 00:57:01,193 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 00:57:01,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=156, Invalid=834, Unknown=2, NotChecked=0, Total=992 [2023-11-12 00:57:01,195 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:01,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:57:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 00:57:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-12 00:57:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 54 states have internal predecessors, (58), 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-12 00:57:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2023-11-12 00:57:01,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 27 [2023-11-12 00:57:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:01,200 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2023-11-12 00:57:01,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 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-12 00:57:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2023-11-12 00:57:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:57:01,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:01,201 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:01,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 00:57:01,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:57:01,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:57:01,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -679155245, now seen corresponding path program 1 times [2023-11-12 00:57:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386255571] [2023-11-12 00:57:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:02,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386255571] [2023-11-12 00:57:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386255571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669234869] [2023-11-12 00:57:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:02,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:02,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:02,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:02,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:57:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:02,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-12 00:57:02,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:02,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:57:02,672 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:57:02,673 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 14 treesize of output 13 [2023-11-12 00:57:02,727 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-12 00:57:02,735 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 15 treesize of output 1 [2023-11-12 00:57:02,787 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-12 00:57:02,796 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 33 treesize of output 17 [2023-11-12 00:57:02,867 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:57:02,867 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 29 treesize of output 28 [2023-11-12 00:57:02,881 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:57:02,882 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-12 00:57:03,039 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:03,040 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 48 treesize of output 35 [2023-11-12 00:57:03,052 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:03,052 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 55 treesize of output 46 [2023-11-12 00:57:03,104 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:03,105 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 40 treesize of output 32 [2023-11-12 00:57:03,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:03,116 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-12 00:57:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:03,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:03,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669234869] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227710405] [2023-11-12 00:57:03,850 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:57:03,850 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:03,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:03,851 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:03,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:05,315 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:06,548 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1682#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 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-12 00:57:06,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:06,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:06,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-11-12 00:57:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189414513] [2023-11-12 00:57:06,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:06,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 00:57:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 00:57:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1201, Unknown=2, NotChecked=0, Total=1332 [2023-11-12 00:57:06,552 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 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-12 00:57:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:07,563 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-12 00:57:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 00:57:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 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 28 [2023-11-12 00:57:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:07,565 INFO L225 Difference]: With dead ends: 80 [2023-11-12 00:57:07,565 INFO L226 Difference]: Without dead ends: 80 [2023-11-12 00:57:07,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=236, Invalid=1742, Unknown=2, NotChecked=0, Total=1980 [2023-11-12 00:57:07,568 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 94 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:07,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 153 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:57:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-12 00:57:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2023-11-12 00:57:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 61 states have internal predecessors, (70), 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-12 00:57:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-11-12 00:57:07,575 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 28 [2023-11-12 00:57:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:07,576 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-11-12 00:57:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 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-12 00:57:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-11-12 00:57:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:57:07,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:07,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:07,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:07,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:57:07,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:57:07,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash -679155244, now seen corresponding path program 1 times [2023-11-12 00:57:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179826631] [2023-11-12 00:57:07,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:09,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:09,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179826631] [2023-11-12 00:57:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179826631] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:09,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431628049] [2023-11-12 00:57:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:09,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:09,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:09,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:57:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:09,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-12 00:57:09,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:09,411 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:57:09,412 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 14 treesize of output 13 [2023-11-12 00:57:09,487 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-12 00:57:09,496 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 15 treesize of output 1 [2023-11-12 00:57:09,549 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-12 00:57:09,559 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 33 treesize of output 17 [2023-11-12 00:57:09,642 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:57:09,643 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 29 treesize of output 28 [2023-11-12 00:57:09,658 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:57:09,659 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-12 00:57:09,855 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:09,856 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 48 treesize of output 35 [2023-11-12 00:57:09,865 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:09,865 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 55 treesize of output 46 [2023-11-12 00:57:09,915 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:09,916 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 40 treesize of output 32 [2023-11-12 00:57:09,928 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:09,929 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-12 00:57:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:10,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:11,139 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 64 treesize of output 58 [2023-11-12 00:57:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431628049] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [853660299] [2023-11-12 00:57:11,188 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:57:11,188 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:11,189 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:11,189 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:11,189 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:13,030 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:14,686 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2042#(and (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 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-12 00:57:14,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:14,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-11-12 00:57:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24539160] [2023-11-12 00:57:14,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:14,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-12 00:57:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:14,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-12 00:57:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1329, Unknown=2, NotChecked=0, Total=1482 [2023-11-12 00:57:14,689 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 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-12 00:57:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:16,678 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-11-12 00:57:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 00:57:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 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 28 [2023-11-12 00:57:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:16,679 INFO L225 Difference]: With dead ends: 74 [2023-11-12 00:57:16,679 INFO L226 Difference]: Without dead ends: 74 [2023-11-12 00:57:16,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=306, Invalid=2142, Unknown=2, NotChecked=0, Total=2450 [2023-11-12 00:57:16,682 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:16,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 157 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 00:57:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-12 00:57:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2023-11-12 00:57:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 63 states have internal predecessors, (70), 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-12 00:57:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2023-11-12 00:57:16,687 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 28 [2023-11-12 00:57:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:16,688 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2023-11-12 00:57:16,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 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-12 00:57:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2023-11-12 00:57:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:57:16,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:16,689 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:16,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:16,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 00:57:16,890 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:57:16,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:16,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1419090599, now seen corresponding path program 1 times [2023-11-12 00:57:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443004258] [2023-11-12 00:57:16,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:18,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443004258] [2023-11-12 00:57:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443004258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366410488] [2023-11-12 00:57:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:18,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:18,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:18,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:57:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:18,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-12 00:57:18,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:18,951 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-12 00:57:19,038 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 15 treesize of output 1 [2023-11-12 00:57:19,045 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-12 00:57:19,065 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:57:19,066 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-12 00:57:19,151 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:57:19,151 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 28 treesize of output 31 [2023-11-12 00:57:19,156 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 46 treesize of output 26 [2023-11-12 00:57:19,169 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-12 00:57:19,272 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:57:19,272 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-12 00:57:19,279 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-12 00:57:19,296 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:57:19,297 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-12 00:57:19,526 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:19,528 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-12 00:57:19,550 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:57:19,551 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 43 treesize of output 46 [2023-11-12 00:57:19,561 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:19,562 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 51 treesize of output 42 [2023-11-12 00:57:19,691 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:19,691 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-12 00:57:19,704 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:19,705 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 30 treesize of output 30 [2023-11-12 00:57:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:19,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:20,070 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_975) .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_975) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-12 00:57:21,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int)) (let ((.cse0 (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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_975 .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 ((|ULTIMATE.start_sll_circular_create_~last~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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |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_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 .cse2) |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 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_975 .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|)))) .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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_975 .cse1) |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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_975 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |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 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (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 ((|ULTIMATE.start_sll_circular_create_~last~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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int)) (let ((.cse10 (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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) is different from false [2023-11-12 00:57:22,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or .cse0 (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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 4)) (= (select .cse2 .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 (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_975 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 4)) (= (select .cse3 .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 ((|ULTIMATE.start_sll_circular_create_~last~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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 4)) (= (select .cse4 .cse1) |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|))))) (or (and (or (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4)) (= (select .cse5 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_975 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 4)) (= (select .cse6 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse0) (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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4)) (= (select .cse7 .cse1) |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|))) (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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_975 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4)) (= (select .cse8 .cse1) |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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~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_964 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_971 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_964) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_971)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_975 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 4)) (= (select .cse9 .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|))))) is different from false [2023-11-12 00:57:22,246 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:22,246 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 55 [2023-11-12 00:57:22,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:22,251 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:22,262 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:22,263 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 67 treesize of output 65 [2023-11-12 00:57:22,324 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:22,325 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 73 [2023-11-12 00:57:22,373 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:22,374 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-12 00:57:22,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:22,389 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:57:22,390 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 273 treesize of output 258 [2023-11-12 00:57:22,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:22,402 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-12 00:57:22,407 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:57:22,408 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-12 00:57:22,418 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:22,419 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 37 treesize of output 1 [2023-11-12 00:57:22,429 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:22,429 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 37 treesize of output 1 [2023-11-12 00:57:22,443 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:22,443 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 37 treesize of output 1 [2023-11-12 00:57:22,451 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:22,452 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 37 treesize of output 1 [2023-11-12 00:57:22,459 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:57:22,460 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 37 treesize of output 1 [2023-11-12 00:57:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 13 not checked. [2023-11-12 00:57:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366410488] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1158100339] [2023-11-12 00:57:22,596 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:57:22,596 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:22,597 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:22,597 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:22,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:24,454 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:25,901 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2432#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~mem7#1_36| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (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_36|) (not (= |v_ULTIMATE.start_main_#t~mem7#1_36| 1)))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-12 00:57:25,902 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:25,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2023-11-12 00:57:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943407568] [2023-11-12 00:57:25,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:25,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-12 00:57:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:25,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-12 00:57:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1408, Unknown=9, NotChecked=234, Total=1806 [2023-11-12 00:57:25,905 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-12 00:57:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:27,582 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2023-11-12 00:57:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:57:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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 32 [2023-11-12 00:57:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:27,584 INFO L225 Difference]: With dead ends: 86 [2023-11-12 00:57:27,584 INFO L226 Difference]: Without dead ends: 86 [2023-11-12 00:57:27,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=285, Invalid=2168, Unknown=9, NotChecked=294, Total=2756 [2023-11-12 00:57:27,586 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:27,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 253 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 424 Invalid, 0 Unknown, 167 Unchecked, 0.7s Time] [2023-11-12 00:57:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-12 00:57:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2023-11-12 00:57:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 63 states have internal predecessors, (69), 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-12 00:57:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2023-11-12 00:57:27,590 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2023-11-12 00:57:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:27,591 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2023-11-12 00:57:27,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-12 00:57:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2023-11-12 00:57:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:57:27,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:27,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:27,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:27,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:57:27,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-12 00:57:27,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -25250846, now seen corresponding path program 1 times [2023-11-12 00:57:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000575658] [2023-11-12 00:57:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:57:28,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:28,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000575658] [2023-11-12 00:57:28,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000575658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:28,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229838989] [2023-11-12 00:57:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:28,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:28,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:28,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:28,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6ea3bd6-ab26-45ad-81d5-a6b43416dfaa/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:57:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:28,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-12 00:57:28,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:28,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:57:28,722 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:57:28,725 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-12 00:57:28,749 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:57:28,749 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-12 00:57:28,766 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:57:28,767 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-12 00:57:28,836 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-12 00:57:28,837 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-12 00:57:28,856 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 15 treesize of output 1 [2023-11-12 00:57:28,866 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 12 [2023-11-12 00:57:28,889 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 17 treesize of output 12 [2023-11-12 00:57:28,928 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 24 treesize of output 12 [2023-11-12 00:57:28,937 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 00:57:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:28,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:28,958 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1147 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-12 00:57:28,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 Int) (v_ArrVal_1147 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1145)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1147) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2023-11-12 00:57:28,977 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:28,977 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 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-12 00:57:28,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-12 00:57:28,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2023-11-12 00:57:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229838989] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [358905820] [2023-11-12 00:57:29,146 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-12 00:57:29,146 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:29,146 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:29,146 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:29,147 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:30,094 INFO L180 IcfgInterpreter]: Interpretation finished