./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/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_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/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_fed32990-09be-4b5d-aa8a-095bd1f2910f/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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:47:56,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:47:56,535 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:47:56,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:47:56,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:47:56,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:47:56,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:47:56,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:47:56,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:47:56,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:47:56,605 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:47:56,606 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:47:56,607 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:47:56,608 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:47:56,608 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:47:56,609 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:47:56,609 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:47:56,610 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:47:56,611 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:47:56,613 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:47:56,614 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:47:56,614 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:47:56,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:47:56,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:47:56,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:47:56,617 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:47:56,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:47:56,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:47:56,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:47:56,619 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:47:56,619 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:47:56,627 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:47:56,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:47:56,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:47:56,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:47:56,629 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:47:56,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:47:56,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:47:56,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:47:56,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:47:56,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:47:56,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:47:56,632 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:47:56,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:47:56,632 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:47:56,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:47:56,633 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_fed32990-09be-4b5d-aa8a-095bd1f2910f/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_fed32990-09be-4b5d-aa8a-095bd1f2910f/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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-12 00:47:56,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:47:57,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:47:57,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:47:57,027 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:47:57,029 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:47:57,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-12 00:48:00,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:48:00,512 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:48:00,517 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-12 00:48:00,532 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/data/c0c9de646/89ae01d1da314722ac8e96b1e3f24c16/FLAGacbbd3d9f [2023-11-12 00:48:00,553 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/data/c0c9de646/89ae01d1da314722ac8e96b1e3f24c16 [2023-11-12 00:48:00,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:48:00,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:48:00,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:48:00,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:48:00,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:48:00,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:48:00" (1/1) ... [2023-11-12 00:48:00,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326cd009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:00, skipping insertion in model container [2023-11-12 00:48:00,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:48:00" (1/1) ... [2023-11-12 00:48:00,615 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:48:00,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:48:00,956 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:48:01,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:48:01,079 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:48:01,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01 WrapperNode [2023-11-12 00:48:01,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:48:01,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:48:01,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:48:01,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:48:01,089 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:48:01" (1/1) ... [2023-11-12 00:48:01,104 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:48:01" (1/1) ... [2023-11-12 00:48:01,129 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-11-12 00:48:01,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:48:01,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:48:01,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:48:01,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:48:01,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:48:01,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:48:01,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:48:01,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:48:01,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (1/1) ... [2023-11-12 00:48:01,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:48:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:01,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/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:48:01,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/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:48:01,301 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:48:01,302 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:48:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:48:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:48:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:48:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:48:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:48:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:48:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:48:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:48:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:48:01,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:48:01,528 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:48:01,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:48:01,580 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:48:01,888 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:48:01,964 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:48:01,964 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:48:01,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:48:01 BoogieIcfgContainer [2023-11-12 00:48:01,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:48:01,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:48:01,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:48:01,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:48:01,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:48:00" (1/3) ... [2023-11-12 00:48:01,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd76893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:48:01, skipping insertion in model container [2023-11-12 00:48:01,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:48:01" (2/3) ... [2023-11-12 00:48:01,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd76893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:48:01, skipping insertion in model container [2023-11-12 00:48:01,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:48:01" (3/3) ... [2023-11-12 00:48:01,990 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-12 00:48:02,010 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:48:02,010 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-12 00:48:02,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:48:02,063 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;@29e79f1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:48:02,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-12 00:48:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 63 states have internal predecessors, (73), 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:48:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:48:02,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:02,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:48:02,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:02,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 172438, now seen corresponding path program 1 times [2023-11-12 00:48:02,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617983994] [2023-11-12 00:48:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:02,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:02,396 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:48:02,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617983994] [2023-11-12 00:48:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617983994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:02,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:48:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12803511] [2023-11-12 00:48:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:48:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:48:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:48:02,463 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 63 states have internal predecessors, (73), 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:48:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:02,615 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-12 00:48:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:48:02,618 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:48:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:02,628 INFO L225 Difference]: With dead ends: 61 [2023-11-12 00:48:02,628 INFO L226 Difference]: Without dead ends: 56 [2023-11-12 00:48:02,631 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:48:02,642 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:02,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 79 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:48:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-12 00:48:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-12 00:48:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.935483870967742) internal successors, (60), 55 states have internal predecessors, (60), 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:48:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-11-12 00:48:02,687 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 3 [2023-11-12 00:48:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:02,687 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-11-12 00:48:02,688 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:48:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-11-12 00:48:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:48:02,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:02,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:48:02,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:48:02,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:02,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 172439, now seen corresponding path program 1 times [2023-11-12 00:48:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857915174] [2023-11-12 00:48:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:02,851 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:48:02,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857915174] [2023-11-12 00:48:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857915174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:48:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208207815] [2023-11-12 00:48:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:02,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:48:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:48:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:48:02,857 INFO L87 Difference]: Start difference. First operand 56 states and 60 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:48:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:02,945 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-12 00:48:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:48:02,946 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:48:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:02,947 INFO L225 Difference]: With dead ends: 53 [2023-11-12 00:48:02,948 INFO L226 Difference]: Without dead ends: 53 [2023-11-12 00:48:02,948 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:48:02,950 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 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:48:02,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:48:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-12 00:48:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-12 00:48:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 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:48:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-12 00:48:02,960 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2023-11-12 00:48:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:02,960 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-12 00:48:02,961 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:48:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-12 00:48:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:48:02,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:02,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:02,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:48:02,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:02,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 339900960, now seen corresponding path program 1 times [2023-11-12 00:48:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023611299] [2023-11-12 00:48:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:03,141 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:48:03,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023611299] [2023-11-12 00:48:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023611299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:03,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:03,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:48:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510018375] [2023-11-12 00:48:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:03,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:48:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:48:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:48:03,145 INFO L87 Difference]: Start difference. First operand 53 states and 57 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:48:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:03,320 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2023-11-12 00:48:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:48:03,322 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:48:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:03,323 INFO L225 Difference]: With dead ends: 61 [2023-11-12 00:48:03,323 INFO L226 Difference]: Without dead ends: 61 [2023-11-12 00:48:03,324 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:48:03,326 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:03,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 60 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:48:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-12 00:48:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2023-11-12 00:48:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 51 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:48:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2023-11-12 00:48:03,345 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 7 [2023-11-12 00:48:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:03,346 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2023-11-12 00:48:03,346 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:48:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2023-11-12 00:48:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:48:03,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:03,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:03,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:48:03,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:03,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 339900961, now seen corresponding path program 1 times [2023-11-12 00:48:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:03,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277308136] [2023-11-12 00:48:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:03,472 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:48:03,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277308136] [2023-11-12 00:48:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277308136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:48:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966076854] [2023-11-12 00:48:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:03,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:48:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:48:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:48:03,477 INFO L87 Difference]: Start difference. First operand 52 states and 58 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:48:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:03,518 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-11-12 00:48:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:48:03,519 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:48:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:03,522 INFO L225 Difference]: With dead ends: 57 [2023-11-12 00:48:03,522 INFO L226 Difference]: Without dead ends: 57 [2023-11-12 00:48:03,523 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:48:03,528 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 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:48:03,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:48:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-12 00:48:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-11-12 00:48:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.6875) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:48:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-12 00:48:03,542 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 7 [2023-11-12 00:48:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:03,542 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-12 00:48:03,543 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:48:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-12 00:48:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:48:03,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:03,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:03,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:48:03,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:03,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash 339780196, now seen corresponding path program 1 times [2023-11-12 00:48:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858540089] [2023-11-12 00:48:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:03,634 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:48:03,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858540089] [2023-11-12 00:48:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858540089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:03,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:03,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:48:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326103005] [2023-11-12 00:48:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:03,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:48:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:48:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:48:03,638 INFO L87 Difference]: Start difference. First operand 50 states and 54 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:48:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:03,691 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2023-11-12 00:48:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:48:03,692 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:48:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:03,693 INFO L225 Difference]: With dead ends: 48 [2023-11-12 00:48:03,693 INFO L226 Difference]: Without dead ends: 48 [2023-11-12 00:48:03,694 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:48:03,695 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:03,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:48:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-12 00:48:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-12 00:48:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 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:48:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-11-12 00:48:03,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2023-11-12 00:48:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:03,704 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-11-12 00:48:03,704 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:48:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-11-12 00:48:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:48:03,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:03,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:03,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:48:03,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:03,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 339780197, now seen corresponding path program 1 times [2023-11-12 00:48:03,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:03,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633026147] [2023-11-12 00:48:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:03,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:03,811 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:48:03,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633026147] [2023-11-12 00:48:03,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633026147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:03,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:03,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:48:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26914163] [2023-11-12 00:48:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:48:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:48:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:48:03,815 INFO L87 Difference]: Start difference. First operand 48 states and 52 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:48:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:03,862 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-11-12 00:48:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:48:03,863 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:48:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:03,863 INFO L225 Difference]: With dead ends: 46 [2023-11-12 00:48:03,864 INFO L226 Difference]: Without dead ends: 46 [2023-11-12 00:48:03,864 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:48:03,865 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 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:48:03,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:48:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-12 00:48:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-12 00:48:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 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:48:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-11-12 00:48:03,872 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 7 [2023-11-12 00:48:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:03,872 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-11-12 00:48:03,872 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:48:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-11-12 00:48:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:48:03,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:03,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:03,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:48:03,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:03,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -455616435, now seen corresponding path program 1 times [2023-11-12 00:48:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:03,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829728536] [2023-11-12 00:48:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:03,993 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:48:03,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829728536] [2023-11-12 00:48:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829728536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:48:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578713649] [2023-11-12 00:48:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:03,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:48:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:48:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:48:03,996 INFO L87 Difference]: Start difference. First operand 46 states and 50 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:48:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:04,128 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-11-12 00:48:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:48:04,129 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:48:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:04,130 INFO L225 Difference]: With dead ends: 49 [2023-11-12 00:48:04,130 INFO L226 Difference]: Without dead ends: 49 [2023-11-12 00:48:04,130 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:48:04,132 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:04,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:48:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-12 00:48:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-11-12 00:48:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 46 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:48:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-11-12 00:48:04,138 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 11 [2023-11-12 00:48:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:04,138 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-11-12 00:48:04,139 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:48:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-11-12 00:48:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:48:04,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:04,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:48:04,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:04,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -455616434, now seen corresponding path program 1 times [2023-11-12 00:48:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:04,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211531418] [2023-11-12 00:48:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:04,222 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:48:04,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211531418] [2023-11-12 00:48:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211531418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753534822] [2023-11-12 00:48:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:04,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:04,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:04,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:04,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:48:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:04,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:48:04,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:04,524 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:48:04,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:04,559 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:48:04,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753534822] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709184690] [2023-11-12 00:48:04,585 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-12 00:48:04,586 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:04,591 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:04,598 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:04,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:06,638 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:07,373 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '889#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) 7) (= |ULTIMATE.start_main_~len~0#1| 5) (exists ((|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| Int)) (and (= (store |v_#memory_$Pointer$.base_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| (store (select |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 1))) (= |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:48:07,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:07,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:07,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-12 00:48:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759344505] [2023-11-12 00:48:07,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:07,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:48:07,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:48:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=159, Unknown=1, NotChecked=0, Total=210 [2023-11-12 00:48:07,376 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:48:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:07,429 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2023-11-12 00:48:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:48:07,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:48:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:07,431 INFO L225 Difference]: With dead ends: 59 [2023-11-12 00:48:07,431 INFO L226 Difference]: Without dead ends: 59 [2023-11-12 00:48:07,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=159, Unknown=1, NotChecked=0, Total=210 [2023-11-12 00:48:07,433 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:07,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 121 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:48:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-12 00:48:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-12 00:48:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 58 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:48:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-11-12 00:48:07,439 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 11 [2023-11-12 00:48:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:07,439 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-11-12 00:48:07,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:48:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-11-12 00:48:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:48:07,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:07,441 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:07,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:07,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:07,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:07,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:07,649 INFO L85 PathProgramCache]: Analyzing trace with hash -790119467, now seen corresponding path program 2 times [2023-11-12 00:48:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031012014] [2023-11-12 00:48:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:07,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:48:08,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031012014] [2023-11-12 00:48:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031012014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:48:08,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:48:08,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:48:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123693903] [2023-11-12 00:48:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:48:08,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:48:08,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:48:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:48:08,006 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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:48:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:08,142 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2023-11-12 00:48:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:48:08,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-12 00:48:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:08,143 INFO L225 Difference]: With dead ends: 66 [2023-11-12 00:48:08,144 INFO L226 Difference]: Without dead ends: 66 [2023-11-12 00:48:08,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:48:08,145 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:08,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:48:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-12 00:48:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-11-12 00:48:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 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:48:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-11-12 00:48:08,151 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 23 [2023-11-12 00:48:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:08,152 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-11-12 00:48:08,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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:48:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-11-12 00:48:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:48:08,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:08,153 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:08,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:48:08,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:08,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1548595892, now seen corresponding path program 1 times [2023-11-12 00:48:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884291239] [2023-11-12 00:48:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:09,446 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:48:09,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884291239] [2023-11-12 00:48:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884291239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313116373] [2023-11-12 00:48:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:09,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:09,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:48:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:09,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-12 00:48:09,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:09,670 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:48:09,753 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:48:09,753 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:48:09,802 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:48:09,802 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:48:09,872 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:48:09,872 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:48:09,916 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:48:09,917 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 11 treesize of output 11 [2023-11-12 00:48:09,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 00:48:10,015 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 18 treesize of output 13 [2023-11-12 00:48:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:48:10,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:10,159 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:10,160 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 22 treesize of output 23 [2023-11-12 00:48:10,167 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 36 treesize of output 24 [2023-11-12 00:48:10,178 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 7 treesize of output 3 [2023-11-12 00:48:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:48:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313116373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273419331] [2023-11-12 00:48:10,597 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:48:10,598 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:10,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:10,599 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:10,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:11,608 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:12,604 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1325#(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) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| Int)) (and (= (store |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| (store (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| (store (select |v_#memory_int_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 1))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-12 00:48:12,604 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:12,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2023-11-12 00:48:12,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884353799] [2023-11-12 00:48:12,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:12,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:48:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:48:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=614, Unknown=2, NotChecked=0, Total=702 [2023-11-12 00:48:12,607 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:48:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:12,958 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-11-12 00:48:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:48:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-12 00:48:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:12,961 INFO L225 Difference]: With dead ends: 62 [2023-11-12 00:48:12,961 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 00:48:12,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=127, Invalid=801, Unknown=2, NotChecked=0, Total=930 [2023-11-12 00:48:12,962 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:12,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 302 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:48:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 00:48:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-12 00:48:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 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:48:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-12 00:48:12,967 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2023-11-12 00:48:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:12,972 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-12 00:48:12,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:48:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-12 00:48:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:48:12,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:12,973 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:48:12,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:48:13,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:13,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 761878799, now seen corresponding path program 1 times [2023-11-12 00:48:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567473703] [2023-11-12 00:48:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:14,524 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:48:14,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567473703] [2023-11-12 00:48:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567473703] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5661841] [2023-11-12 00:48:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:14,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:14,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:14,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:14,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:48:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:14,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-12 00:48:14,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:14,744 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:48:14,799 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:48:14,800 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:48:14,867 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:48:14,876 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:48:14,929 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:48:14,938 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:48:15,020 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:48:15,022 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:48:15,038 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:48:15,038 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:48:15,225 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:15,226 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:48:15,236 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:15,237 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:48:15,281 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:15,282 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:48:15,294 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:15,295 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:48:15,354 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:48:15,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:16,053 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:48:16,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5661841] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:16,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1571350614] [2023-11-12 00:48:16,058 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:48:16,058 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:16,059 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:16,059 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:16,059 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:17,962 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:19,235 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1651#(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:48:19,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:19,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-12 00:48:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224632492] [2023-11-12 00:48:19,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:19,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 00:48:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 00:48:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1068, Unknown=2, NotChecked=0, Total=1190 [2023-11-12 00:48:19,238 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 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:48:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:20,239 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-12 00:48:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:48:20,239 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 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) Word has length 28 [2023-11-12 00:48:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:20,240 INFO L225 Difference]: With dead ends: 100 [2023-11-12 00:48:20,240 INFO L226 Difference]: Without dead ends: 100 [2023-11-12 00:48:20,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=225, Invalid=1665, Unknown=2, NotChecked=0, Total=1892 [2023-11-12 00:48:20,243 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:20,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 166 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:48:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-12 00:48:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2023-11-12 00:48:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 69 states have internal predecessors, (80), 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:48:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-11-12 00:48:20,264 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2023-11-12 00:48:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:20,266 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-11-12 00:48:20,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 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:48:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-11-12 00:48:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:48:20,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:20,268 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:48:20,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:20,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:48:20,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:20,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 761878800, now seen corresponding path program 1 times [2023-11-12 00:48:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:20,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748817941] [2023-11-12 00:48:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:21,520 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:48:21,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:21,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748817941] [2023-11-12 00:48:21,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748817941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:21,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678169309] [2023-11-12 00:48:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:21,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:21,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:21,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:21,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:48:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:21,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-12 00:48:21,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:21,743 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 8 treesize of output 1 [2023-11-12 00:48:21,826 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:48:21,826 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:48:21,886 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:48:21,894 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:48:21,941 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:48:21,950 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:48:22,031 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:48:22,031 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:48:22,046 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:48:22,047 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:48:22,201 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:22,202 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:48:22,209 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:22,210 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:48:22,253 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:22,254 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:48:22,268 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:22,268 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:48:22,326 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:48:22,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:23,686 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:48:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678169309] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273938805] [2023-11-12 00:48:23,689 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:48:23,690 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:23,690 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:23,690 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:23,691 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:25,346 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:26,640 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2041#(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:48:26,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:26,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:26,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-11-12 00:48:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241321479] [2023-11-12 00:48:26,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:26,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-12 00:48:26,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-12 00:48:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1337, Unknown=2, NotChecked=0, Total=1482 [2023-11-12 00:48:26,644 INFO L87 Difference]: Start difference. First operand 70 states and 80 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:48:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:28,996 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-11-12 00:48:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 00:48:28,997 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:48:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:28,998 INFO L225 Difference]: With dead ends: 84 [2023-11-12 00:48:28,998 INFO L226 Difference]: Without dead ends: 84 [2023-11-12 00:48:28,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=298, Invalid=2150, Unknown=2, NotChecked=0, Total=2450 [2023-11-12 00:48:29,000 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 107 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:29,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 180 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-12 00:48:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-12 00:48:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-11-12 00:48:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 71 states have internal predecessors, (80), 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:48:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-11-12 00:48:29,005 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 28 [2023-11-12 00:48:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:29,005 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-11-12 00:48:29,006 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:48:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-11-12 00:48:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:48:29,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:29,007 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:48:29,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:29,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:48:29,214 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:29,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash 939014767, now seen corresponding path program 1 times [2023-11-12 00:48:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:29,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231400751] [2023-11-12 00:48:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:48:30,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231400751] [2023-11-12 00:48:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231400751] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312179992] [2023-11-12 00:48:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:31,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:31,001 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:31,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:48:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:31,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-12 00:48:31,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:31,193 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:48:31,254 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:48:31,254 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:48:31,303 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:48:31,303 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:48:31,360 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:48:31,360 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 11 treesize of output 11 [2023-11-12 00:48:31,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:48:31,527 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:48:31,528 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-12 00:48:31,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 00:48:31,542 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:48:31,594 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:48:31,605 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 43 treesize of output 23 [2023-11-12 00:48:31,624 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:48:31,624 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 1 case distinctions, treesize of input 28 treesize of output 31 [2023-11-12 00:48:31,729 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:48:31,729 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 39 treesize of output 34 [2023-11-12 00:48:31,748 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:48:31,749 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-12 00:48:31,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:48:32,037 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:32,037 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 78 treesize of output 57 [2023-11-12 00:48:32,076 INFO L322 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-11-12 00:48:32,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 93 [2023-11-12 00:48:32,089 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:32,089 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 77 treesize of output 68 [2023-11-12 00:48:32,373 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:32,373 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 70 treesize of output 54 [2023-11-12 00:48:32,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:32,416 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 50 treesize of output 50 [2023-11-12 00:48:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:48:32,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:33,431 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (and (or (and (forall ((v_ArrVal_952 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (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_~last~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse5 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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_~last~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_~last~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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_~last~0#1.base|)))) (= |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 (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (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_952 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse4) (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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2023-11-12 00:48:33,996 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |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_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 4)) (= (select .cse1 .cse0) |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_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 4)) (= (select .cse2 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 4)) (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_952 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4)) (= (select .cse5 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 4)) (= (select .cse6 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~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_~last~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4)) (= (select .cse7 .cse0) |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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_952 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (forall ((v_ArrVal_946 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4)) (= (select .cse8 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 4)) (= (select .cse9 .cse0) |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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_952 4)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_946) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |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|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) is different from false [2023-11-12 00:48:34,146 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:34,146 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 25 treesize of output 26 [2023-11-12 00:48:34,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:48:34,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-11-12 00:48:34,160 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 7 treesize of output 3 [2023-11-12 00:48:34,172 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-12 00:48:34,172 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2023-11-12 00:48:34,181 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:34,182 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 49 treesize of output 39 [2023-11-12 00:48:34,184 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:48:34,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:48:34,188 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 0 case distinctions, treesize of input 57 treesize of output 41 [2023-11-12 00:48:34,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:48:34,194 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:48:34,204 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:34,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 00:48:34,211 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:34,212 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 00:48:34,222 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:34,223 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 00:48:34,230 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:34,230 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 00:48:34,237 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:34,237 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 00:48:34,245 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:34,245 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-12 00:48:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2023-11-12 00:48:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312179992] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923425099] [2023-11-12 00:48:34,607 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:48:34,607 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:34,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:34,608 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:34,608 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:36,174 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:37,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2450#(and (<= 1 |#StackHeapBarrier|) (= |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)) (exists ((|v_ULTIMATE.start_main_#t~mem7#1_34| 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|)) (not (= |v_ULTIMATE.start_main_#t~mem7#1_34| 1)) (= (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_34|))) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-12 00:48:37,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:37,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 31 [2023-11-12 00:48:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682491342] [2023-11-12 00:48:37,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:37,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-12 00:48:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-12 00:48:37,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1591, Unknown=5, NotChecked=162, Total=1892 [2023-11-12 00:48:37,558 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 32 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 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:48:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:39,803 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-11-12 00:48:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 00:48:39,804 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 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:48:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:39,805 INFO L225 Difference]: With dead ends: 99 [2023-11-12 00:48:39,805 INFO L226 Difference]: Without dead ends: 99 [2023-11-12 00:48:39,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=293, Invalid=2572, Unknown=5, NotChecked=210, Total=3080 [2023-11-12 00:48:39,808 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:39,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 285 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 799 Invalid, 0 Unknown, 147 Unchecked, 1.0s Time] [2023-11-12 00:48:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-12 00:48:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2023-11-12 00:48:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 71 states have internal predecessors, (79), 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:48:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-11-12 00:48:39,813 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 32 [2023-11-12 00:48:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:39,814 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-11-12 00:48:39,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 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:48:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-11-12 00:48:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:48:39,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:39,815 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:48:39,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-12 00:48:40,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 00:48:40,022 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-12 00:48:40,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2023057230, now seen corresponding path program 1 times [2023-11-12 00:48:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380833563] [2023-11-12 00:48:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:48:40,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380833563] [2023-11-12 00:48:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380833563] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:40,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973893495] [2023-11-12 00:48:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:40,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:40,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:40,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:40,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed32990-09be-4b5d-aa8a-095bd1f2910f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:48:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:40,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-12 00:48:40,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:40,935 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:48:40,981 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:48:40,982 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:48:41,015 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:48:41,016 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:48:41,040 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:48:41,041 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:48:41,136 INFO L322 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-12 00:48:41,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-12 00:48:41,201 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:48:41,250 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 33 treesize of output 17 [2023-11-12 00:48:41,323 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 29 treesize of output 24 [2023-11-12 00:48:41,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:48:41,388 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 00:48:41,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2023-11-12 00:48:41,445 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:48:41,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-12 00:48:41,460 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:48:41,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2023-11-12 00:48:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:48:41,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:41,846 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:48:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973893495] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772999411] [2023-11-12 00:48:41,848 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-12 00:48:41,848 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:41,848 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:41,849 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:41,849 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:42,815 INFO L180 IcfgInterpreter]: Interpretation finished