./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:49:47,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:49:47,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:49:47,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:49:47,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:49:47,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:49:47,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:49:47,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:49:47,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:49:47,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:49:47,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:49:47,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:49:47,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:49:47,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:49:47,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:49:47,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:49:47,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:49:47,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:49:47,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:49:47,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:49:47,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:49:47,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:49:47,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:49:47,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:49:47,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:49:47,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:49:47,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:49:47,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:49:47,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:49:47,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:49:47,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:49:47,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:49:47,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:49:47,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:49:47,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:49:47,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:49:47,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:49:47,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:49:47,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:49:47,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:49:47,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:49:47,533 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 02:49:47,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:49:47,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:49:47,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:49:47,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:49:47,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:49:47,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:49:47,576 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:49:47,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:49:47,577 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:49:47,577 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:49:47,577 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:49:47,578 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:49:47,578 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:49:47,578 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:49:47,578 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:49:47,579 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:49:47,579 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:49:47,579 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:49:47,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:49:47,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:49:47,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:49:47,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:49:47,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:49:47,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:49:47,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:49:47,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:49:47,582 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:49:47,582 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:49:47,582 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:49:47,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:49:47,583 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:49:47,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:49:47,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:49:47,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:49:47,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:49:47,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:49:47,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:49:47,585 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:49:47,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:49:47,585 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:49:47,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:49:47,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:49:47,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/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_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-22 02:49:47,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:49:47,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:49:47,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:49:47,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:49:47,903 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:49:47,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-22 02:49:51,113 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:49:51,530 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:49:51,531 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-22 02:49:51,542 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data/05412cdb7/91dbced14fad471282e060aabaeddeeb/FLAG5dde72bba [2022-11-22 02:49:51,563 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data/05412cdb7/91dbced14fad471282e060aabaeddeeb [2022-11-22 02:49:51,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:49:51,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:49:51,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:49:51,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:49:51,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:49:51,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:49:51" (1/1) ... [2022-11-22 02:49:51,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a646cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:51, skipping insertion in model container [2022-11-22 02:49:51,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:49:51" (1/1) ... [2022-11-22 02:49:51,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:49:51,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:49:51,934 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-22 02:49:51,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:49:51,946 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:49:52,030 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-22 02:49:52,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:49:52,067 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:49:52,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52 WrapperNode [2022-11-22 02:49:52,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:49:52,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:49:52,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:49:52,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:49:52,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,129 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-11-22 02:49:52,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:49:52,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:49:52,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:49:52,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:49:52,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:49:52,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:49:52,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:49:52,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:49:52,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (1/1) ... [2022-11-22 02:49:52,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:49:52,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:49:52,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:49:52,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:49:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:49:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:49:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-22 02:49:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-22 02:49:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:49:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:49:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:49:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:49:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:49:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:49:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:49:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:49:52,472 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:49:52,478 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:49:52,793 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:49:52,912 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:49:52,926 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 02:49:52,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:49:52 BoogieIcfgContainer [2022-11-22 02:49:52,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:49:52,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:49:52,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:49:52,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:49:52,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:49:51" (1/3) ... [2022-11-22 02:49:52,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6058e746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:49:52, skipping insertion in model container [2022-11-22 02:49:52,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:49:52" (2/3) ... [2022-11-22 02:49:52,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6058e746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:49:52, skipping insertion in model container [2022-11-22 02:49:52,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:49:52" (3/3) ... [2022-11-22 02:49:52,943 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-22 02:49:52,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:49:52,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-22 02:49:53,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:49:53,014 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;@575b0573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:49:53,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-22 02:49:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 33 states have (on average 2.121212121212121) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:49:53,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:53,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:49:53,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:49:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 198170915, now seen corresponding path program 1 times [2022-11-22 02:49:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:53,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495579141] [2022-11-22 02:49:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:53,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:53,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495579141] [2022-11-22 02:49:53,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495579141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:53,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:53,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:49:53,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781326156] [2022-11-22 02:49:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:53,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:49:53,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:49:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:49:53,431 INFO L87 Difference]: Start difference. First operand has 65 states, 33 states have (on average 2.121212121212121) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:49:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:53,535 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-11-22 02:49:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:49:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 02:49:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:53,554 INFO L225 Difference]: With dead ends: 63 [2022-11-22 02:49:53,556 INFO L226 Difference]: Without dead ends: 61 [2022-11-22 02:49:53,558 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 [2022-11-22 02:49:53,563 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:53,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:49:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-22 02:49:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-22 02:49:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 2.0) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-22 02:49:53,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 5 [2022-11-22 02:49:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:53,614 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-22 02:49:53,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:49:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-22 02:49:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:49:53,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:53,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:49:53,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:49:53,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:49:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 198170916, now seen corresponding path program 1 times [2022-11-22 02:49:53,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:53,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501679623] [2022-11-22 02:49:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:53,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:53,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501679623] [2022-11-22 02:49:53,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501679623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:53,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:53,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:49:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461718470] [2022-11-22 02:49:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:53,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:49:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:49:53,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:49:53,722 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:49:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:53,794 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-11-22 02:49:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:49:53,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 02:49:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:53,796 INFO L225 Difference]: With dead ends: 59 [2022-11-22 02:49:53,796 INFO L226 Difference]: Without dead ends: 59 [2022-11-22 02:49:53,797 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 [2022-11-22 02:49:53,798 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:53,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:49:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-22 02:49:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-22 02:49:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.9375) internal successors, (62), 55 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-22 02:49:53,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 5 [2022-11-22 02:49:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:53,807 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-22 02:49:53,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:49:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-22 02:49:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:49:53,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:53,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:49:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:49:53,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:49:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1927971198, now seen corresponding path program 1 times [2022-11-22 02:49:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:53,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607769665] [2022-11-22 02:49:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:53,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607769665] [2022-11-22 02:49:53,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607769665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:53,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:53,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:49:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217485311] [2022-11-22 02:49:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:53,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:49:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:53,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:49:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:49:53,916 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:53,963 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-22 02:49:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:49:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-22 02:49:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:53,965 INFO L225 Difference]: With dead ends: 65 [2022-11-22 02:49:53,965 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 02:49:53,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:49:53,967 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:53,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:49:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 02:49:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-11-22 02:49:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-22 02:49:53,975 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 10 [2022-11-22 02:49:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:53,975 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-22 02:49:53,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-22 02:49:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:49:53,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:53,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:49:53,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:49:53,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:49:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1377774572, now seen corresponding path program 1 times [2022-11-22 02:49:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:53,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292343633] [2022-11-22 02:49:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:49:54,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:54,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292343633] [2022-11-22 02:49:54,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292343633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:54,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:54,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:49:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708678048] [2022-11-22 02:49:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:54,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:49:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:49:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:49:54,220 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:49:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:54,447 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-11-22 02:49:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:49:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-22 02:49:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:54,457 INFO L225 Difference]: With dead ends: 79 [2022-11-22 02:49:54,457 INFO L226 Difference]: Without dead ends: 79 [2022-11-22 02:49:54,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:49:54,467 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:54,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 140 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:49:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-22 02:49:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2022-11-22 02:49:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.878787878787879) internal successors, (62), 55 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-22 02:49:54,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 17 [2022-11-22 02:49:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:54,484 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-22 02:49:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:49:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-22 02:49:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:49:54,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:54,486 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:49:54,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:49:54,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:49:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1377774571, now seen corresponding path program 1 times [2022-11-22 02:49:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:54,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524039618] [2022-11-22 02:49:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:49:54,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:54,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524039618] [2022-11-22 02:49:54,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524039618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:54,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:54,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:49:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287974803] [2022-11-22 02:49:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:54,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:49:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:49:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:49:54,856 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:49:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:55,003 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-11-22 02:49:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:49:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-22 02:49:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:55,009 INFO L225 Difference]: With dead ends: 59 [2022-11-22 02:49:55,009 INFO L226 Difference]: Without dead ends: 59 [2022-11-22 02:49:55,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:49:55,013 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:55,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 149 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:49:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-22 02:49:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-22 02:49:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 54 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-11-22 02:49:55,030 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 17 [2022-11-22 02:49:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:55,031 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-11-22 02:49:55,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:49:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-11-22 02:49:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:49:55,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:55,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:49:55,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:49:55,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:49:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1191271115, now seen corresponding path program 1 times [2022-11-22 02:49:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:55,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705145802] [2022-11-22 02:49:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:49:55,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705145802] [2022-11-22 02:49:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705145802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:49:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450246107] [2022-11-22 02:49:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:55,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:49:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:49:55,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:49:55,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:49:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:55,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 02:49:55,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:49:55,542 INFO L350 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 [2022-11-22 02:49:55,586 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_144 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_144))) is different from true [2022-11-22 02:49:55,601 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_144 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_144))) is different from true [2022-11-22 02:49:55,623 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:49:55,623 INFO L350 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 18 [2022-11-22 02:49:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-22 02:49:55,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:49:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:49:56,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450246107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:49:56,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [761163236] [2022-11-22 02:49:56,041 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-22 02:49:56,042 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:49:56,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:49:56,052 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:49:56,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:49:56,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:49:56,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:49:56,128 INFO L350 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 [2022-11-22 02:49:56,133 INFO L350 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 [2022-11-22 02:49:56,140 INFO L350 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 [2022-11-22 02:49:56,152 INFO L350 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 [2022-11-22 02:49:56,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:56,161 INFO L350 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 27 treesize of output 11 [2022-11-22 02:49:56,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:56,170 INFO L350 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 27 treesize of output 11 [2022-11-22 02:49:56,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:49:56,665 INFO L350 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 9 treesize of output 3 [2022-11-22 02:49:56,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:49:56,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:49:56,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:49:56,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:49:56,731 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:56,733 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:56,736 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:56,738 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:56,740 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:56,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:49:57,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:49:57,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:49:57,034 INFO L350 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 9 treesize of output 3 [2022-11-22 02:49:57,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:49:57,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:49:57,069 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:57,071 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:57,073 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:57,075 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:57,078 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:49:57,148 INFO L350 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 19 treesize of output 11 [2022-11-22 02:49:57,160 INFO L350 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 19 treesize of output 11 [2022-11-22 02:49:57,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:57,172 INFO L350 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 23 treesize of output 11 [2022-11-22 02:49:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:57,383 INFO L350 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 127 treesize of output 111 [2022-11-22 02:49:57,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:57,396 INFO L350 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 0 case distinctions, treesize of input 123 treesize of output 111 [2022-11-22 02:49:57,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:57,408 INFO L350 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 0 case distinctions, treesize of input 115 treesize of output 103 [2022-11-22 02:49:57,679 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:49:57,850 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:49:59,853 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '842#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:49:59,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:49:59,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:49:59,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-11-22 02:49:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301785589] [2022-11-22 02:49:59,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:49:59,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 02:49:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 02:49:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=698, Unknown=3, NotChecked=110, Total=930 [2022-11-22 02:49:59,855 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:50:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:00,153 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-22 02:50:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:50:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-11-22 02:50:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:00,154 INFO L225 Difference]: With dead ends: 76 [2022-11-22 02:50:00,155 INFO L226 Difference]: Without dead ends: 76 [2022-11-22 02:50:00,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=130, Invalid=745, Unknown=3, NotChecked=114, Total=992 [2022-11-22 02:50:00,156 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 204 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:00,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 276 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 342 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-11-22 02:50:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-22 02:50:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-22 02:50:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 53 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-11-22 02:50:00,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 19 [2022-11-22 02:50:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:00,161 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-11-22 02:50:00,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:50:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-11-22 02:50:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:50:00,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:00,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:00,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:00,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:00,374 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1191271114, now seen corresponding path program 1 times [2022-11-22 02:50:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:00,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767179047] [2022-11-22 02:50:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:50:00,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:00,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767179047] [2022-11-22 02:50:00,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767179047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:00,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730795923] [2022-11-22 02:50:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:00,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:00,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:50:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:00,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 02:50:00,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:00,816 INFO L350 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 [2022-11-22 02:50:01,050 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:50:01,051 INFO L350 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 20 [2022-11-22 02:50:01,074 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:50:01,074 INFO L350 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 [2022-11-22 02:50:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:50:01,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:01,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730795923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [664613547] [2022-11-22 02:50:01,392 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-22 02:50:01,392 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:01,393 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:01,393 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:01,393 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:01,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:50:01,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:01,434 INFO L350 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 [2022-11-22 02:50:01,440 INFO L350 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 [2022-11-22 02:50:01,444 INFO L350 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 [2022-11-22 02:50:01,453 INFO L350 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 [2022-11-22 02:50:01,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:01,461 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:01,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:01,468 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:01,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:50:01,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:01,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:50:01,832 INFO L350 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 9 treesize of output 3 [2022-11-22 02:50:01,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:01,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:01,861 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:01,863 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:01,865 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:01,869 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:01,871 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:01,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:50:02,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:02,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:02,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:50:02,147 INFO L350 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 9 treesize of output 3 [2022-11-22 02:50:02,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:02,175 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:02,177 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:02,178 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:02,180 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:02,182 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:02,231 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:02,242 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:02,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:02,255 INFO L350 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 23 treesize of output 11 [2022-11-22 02:50:02,396 INFO L350 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 [2022-11-22 02:50:02,402 INFO L350 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 [2022-11-22 02:50:02,410 INFO L350 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 [2022-11-22 02:50:02,599 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:50:02,779 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:05,006 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1079#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:50:05,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:05,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:50:05,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2022-11-22 02:50:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591380506] [2022-11-22 02:50:05,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-22 02:50:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-22 02:50:05,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:50:05,009 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:50:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:05,687 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-22 02:50:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:50:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-11-22 02:50:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:05,689 INFO L225 Difference]: With dead ends: 77 [2022-11-22 02:50:05,689 INFO L226 Difference]: Without dead ends: 77 [2022-11-22 02:50:05,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 02:50:05,691 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 121 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:05,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 271 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:50:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-22 02:50:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-11-22 02:50:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 52 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-22 02:50:05,696 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2022-11-22 02:50:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:05,697 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-22 02:50:05,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:50:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-22 02:50:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:50:05,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:05,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:05,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:05,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-22 02:50:05,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash 161846627, now seen corresponding path program 1 times [2022-11-22 02:50:05,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:05,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082277267] [2022-11-22 02:50:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:50:06,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:06,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082277267] [2022-11-22 02:50:06,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082277267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:06,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:50:06,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:50:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949338963] [2022-11-22 02:50:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:06,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:50:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:50:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:50:06,051 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:06,314 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-11-22 02:50:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:50:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-22 02:50:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:06,315 INFO L225 Difference]: With dead ends: 116 [2022-11-22 02:50:06,315 INFO L226 Difference]: Without dead ends: 116 [2022-11-22 02:50:06,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:50:06,316 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 201 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:06,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 251 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:50:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-22 02:50:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 59. [2022-11-22 02:50:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 55 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-22 02:50:06,322 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 22 [2022-11-22 02:50:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:06,322 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-22 02:50:06,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-22 02:50:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:50:06,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:06,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:06,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:50:06,323 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash 161846628, now seen corresponding path program 1 times [2022-11-22 02:50:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:06,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476829677] [2022-11-22 02:50:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 02:50:06,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:06,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476829677] [2022-11-22 02:50:06,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476829677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350096396] [2022-11-22 02:50:06,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:06,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:06,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:06,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:50:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:06,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:50:06,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:50:06,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:50:06,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350096396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:06,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:50:06,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-22 02:50:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155151270] [2022-11-22 02:50:06,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:06,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:50:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:06,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:50:06,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:50:06,637 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:06,716 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-11-22 02:50:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:50:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-22 02:50:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:06,718 INFO L225 Difference]: With dead ends: 80 [2022-11-22 02:50:06,718 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:50:06,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:50:06,719 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 95 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:06,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 130 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:50:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:50:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2022-11-22 02:50:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 58 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-11-22 02:50:06,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 22 [2022-11-22 02:50:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:06,724 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-11-22 02:50:06,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-11-22 02:50:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:50:06,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:06,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:06,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:06,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 02:50:06,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 161842064, now seen corresponding path program 1 times [2022-11-22 02:50:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:06,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342145595] [2022-11-22 02:50:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:50:07,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:07,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342145595] [2022-11-22 02:50:07,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342145595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:07,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:50:07,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:50:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887881792] [2022-11-22 02:50:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:50:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:50:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:50:07,267 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:07,520 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-11-22 02:50:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:50:07,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-22 02:50:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:07,522 INFO L225 Difference]: With dead ends: 99 [2022-11-22 02:50:07,522 INFO L226 Difference]: Without dead ends: 99 [2022-11-22 02:50:07,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:50:07,523 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 194 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:07,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 275 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:50:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-22 02:50:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2022-11-22 02:50:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-11-22 02:50:07,534 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 22 [2022-11-22 02:50:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:07,534 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-11-22 02:50:07,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-11-22 02:50:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 02:50:07,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:07,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:50:07,536 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash 911528901, now seen corresponding path program 1 times [2022-11-22 02:50:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:07,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891722579] [2022-11-22 02:50:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:50:07,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891722579] [2022-11-22 02:50:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891722579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533738882] [2022-11-22 02:50:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:07,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:07,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:07,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:50:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:08,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-22 02:50:08,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:08,081 INFO L350 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 [2022-11-22 02:50:08,140 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:50:08,141 INFO L350 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 [2022-11-22 02:50:08,152 INFO L350 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 [2022-11-22 02:50:08,173 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:50:08,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-22 02:50:08,232 INFO L350 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 25 treesize of output 13 [2022-11-22 02:50:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:50:08,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:08,262 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-22 02:50:08,262 INFO L350 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 19 treesize of output 18 [2022-11-22 02:50:08,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533738882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:08,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019811694] [2022-11-22 02:50:08,378 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 02:50:08,379 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:08,379 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:08,379 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:08,380 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:08,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:50:08,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:08,416 INFO L350 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 [2022-11-22 02:50:08,421 INFO L350 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 [2022-11-22 02:50:08,426 INFO L350 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 [2022-11-22 02:50:08,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:08,437 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:08,443 INFO L350 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 [2022-11-22 02:50:08,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:08,451 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:08,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:50:08,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:08,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:08,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:08,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:08,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:08,851 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:08,853 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:08,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:08,859 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:08,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:50:09,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:09,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:09,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:09,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:09,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:09,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:09,200 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:09,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:09,207 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:09,264 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:09,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:09,276 INFO L350 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 23 treesize of output 11 [2022-11-22 02:50:09,288 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:09,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:09,472 INFO L350 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 127 treesize of output 111 [2022-11-22 02:50:09,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:09,486 INFO L350 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 0 case distinctions, treesize of input 123 treesize of output 111 [2022-11-22 02:50:09,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:09,498 INFO L350 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 0 case distinctions, treesize of input 119 treesize of output 107 [2022-11-22 02:50:09,784 INFO L350 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 [2022-11-22 02:50:09,794 INFO L350 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 [2022-11-22 02:50:09,804 INFO L350 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 [2022-11-22 02:50:09,977 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:50:10,125 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:13,288 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1941#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 3 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:50:13,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:13,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:50:13,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2022-11-22 02:50:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240548812] [2022-11-22 02:50:13,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:13,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 02:50:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 02:50:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1021, Unknown=3, NotChecked=0, Total=1122 [2022-11-22 02:50:13,290 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 17 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:13,801 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-11-22 02:50:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:50:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-22 02:50:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:13,803 INFO L225 Difference]: With dead ends: 102 [2022-11-22 02:50:13,804 INFO L226 Difference]: Without dead ends: 102 [2022-11-22 02:50:13,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=133, Invalid=1346, Unknown=3, NotChecked=0, Total=1482 [2022-11-22 02:50:13,805 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:13,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 395 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:50:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-22 02:50:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 73. [2022-11-22 02:50:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 68 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2022-11-22 02:50:13,811 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 24 [2022-11-22 02:50:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:13,811 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2022-11-22 02:50:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-11-22 02:50:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 02:50:13,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:13,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:13,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:14,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:14,018 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash 911528902, now seen corresponding path program 1 times [2022-11-22 02:50:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:14,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850640331] [2022-11-22 02:50:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:50:14,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:14,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850640331] [2022-11-22 02:50:14,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850640331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:14,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781834573] [2022-11-22 02:50:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:14,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:14,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:14,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:50:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:15,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-22 02:50:15,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:15,026 INFO L350 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 [2022-11-22 02:50:15,030 INFO L350 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 [2022-11-22 02:50:15,254 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:50:15,255 INFO L350 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 [2022-11-22 02:50:15,351 INFO L350 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 [2022-11-22 02:50:15,361 INFO L350 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 [2022-11-22 02:50:15,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:50:15,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:50:15,431 INFO L350 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 20 [2022-11-22 02:50:15,524 INFO L350 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 25 treesize of output 13 [2022-11-22 02:50:15,529 INFO L350 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 15 treesize of output 7 [2022-11-22 02:50:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:50:15,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:15,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:50:15,854 INFO L350 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 37 treesize of output 38 [2022-11-22 02:50:15,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:50:15,861 INFO L350 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 29 treesize of output 30 [2022-11-22 02:50:15,869 INFO L350 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 52 treesize of output 44 [2022-11-22 02:50:15,874 INFO L350 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 82 treesize of output 70 [2022-11-22 02:50:15,878 INFO L350 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 66 treesize of output 62 [2022-11-22 02:50:15,894 INFO L350 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 32 treesize of output 28 [2022-11-22 02:50:15,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:50:15,931 INFO L350 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 20 treesize of output 21 [2022-11-22 02:50:15,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:15,935 INFO L350 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 18 treesize of output 10 [2022-11-22 02:50:22,173 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:50:22,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781834573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:22,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1145464996] [2022-11-22 02:50:22,176 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 02:50:22,177 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:22,177 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:22,177 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:22,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:22,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:50:22,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:22,217 INFO L350 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 [2022-11-22 02:50:22,223 INFO L350 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 [2022-11-22 02:50:22,228 INFO L350 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 [2022-11-22 02:50:22,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:22,238 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:22,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:22,245 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:22,253 INFO L350 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 [2022-11-22 02:50:22,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:50:22,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:22,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:22,497 INFO L350 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 9 treesize of output 3 [2022-11-22 02:50:22,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:50:22,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:22,526 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,528 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,530 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,533 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,534 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:50:22,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:22,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:22,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:22,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:22,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:22,754 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,756 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,758 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,760 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,762 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:22,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:22,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:22,879 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:50:22,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:22,894 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:50:22,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:22,909 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 222 [2022-11-22 02:50:23,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:23,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:23,048 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 114 [2022-11-22 02:50:23,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:23,060 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-22 02:50:23,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:23,072 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-22 02:50:23,173 INFO L350 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 [2022-11-22 02:50:23,182 INFO L350 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 [2022-11-22 02:50:23,192 INFO L350 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 [2022-11-22 02:50:23,490 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:50:23,656 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:28,209 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2275#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= (+ |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|)) (or (not (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (not (<= 0 (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (< 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |#NULL.base| 0))' at error location [2022-11-22 02:50:28,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:28,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:50:28,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2022-11-22 02:50:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984440918] [2022-11-22 02:50:28,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 02:50:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 02:50:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2176, Unknown=16, NotChecked=0, Total=2352 [2022-11-22 02:50:28,213 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:50:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:29,297 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-11-22 02:50:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:50:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-11-22 02:50:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:29,299 INFO L225 Difference]: With dead ends: 117 [2022-11-22 02:50:29,299 INFO L226 Difference]: Without dead ends: 117 [2022-11-22 02:50:29,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=212, Invalid=2633, Unknown=17, NotChecked=0, Total=2862 [2022-11-22 02:50:29,301 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 126 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:29,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 615 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:50:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-22 02:50:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2022-11-22 02:50:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.608695652173913) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-22 02:50:29,305 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 24 [2022-11-22 02:50:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:29,306 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-22 02:50:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:50:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-22 02:50:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 02:50:29,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:29,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:29,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 02:50:29,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 02:50:29,513 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -198311513, now seen corresponding path program 2 times [2022-11-22 02:50:29,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:29,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26938872] [2022-11-22 02:50:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:29,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 02:50:29,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:29,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26938872] [2022-11-22 02:50:29,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26938872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:29,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100313890] [2022-11-22 02:50:29,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:50:29,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:29,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:29,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:50:29,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 02:50:29,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:50:29,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:50:29,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:50:29,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:50:29,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100313890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:29,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:50:29,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-11-22 02:50:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379729014] [2022-11-22 02:50:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:29,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:50:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:50:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:50:29,951 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:30,011 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-22 02:50:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:50:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-22 02:50:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:30,017 INFO L225 Difference]: With dead ends: 68 [2022-11-22 02:50:30,017 INFO L226 Difference]: Without dead ends: 68 [2022-11-22 02:50:30,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:50:30,018 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 175 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:30,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 65 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:50:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-22 02:50:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-22 02:50:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-22 02:50:30,026 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 26 [2022-11-22 02:50:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:30,026 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-22 02:50:30,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-22 02:50:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 02:50:30,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:30,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:30,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:30,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 02:50:30,234 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1675971377, now seen corresponding path program 1 times [2022-11-22 02:50:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:30,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525972269] [2022-11-22 02:50:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:30,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 02:50:30,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525972269] [2022-11-22 02:50:30,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525972269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:30,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:50:30,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:50:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876276687] [2022-11-22 02:50:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:30,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:50:30,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:50:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:50:30,409 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:30,613 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-11-22 02:50:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:50:30,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-22 02:50:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:30,614 INFO L225 Difference]: With dead ends: 92 [2022-11-22 02:50:30,615 INFO L226 Difference]: Without dead ends: 92 [2022-11-22 02:50:30,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:50:30,615 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 179 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:30,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 165 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:50:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-22 02:50:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2022-11-22 02:50:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 66 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-11-22 02:50:30,619 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 28 [2022-11-22 02:50:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:30,619 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-11-22 02:50:30,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-11-22 02:50:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 02:50:30,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:30,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:30,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 02:50:30,621 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1675971376, now seen corresponding path program 1 times [2022-11-22 02:50:30,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:30,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499884244] [2022-11-22 02:50:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:30,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:50:30,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499884244] [2022-11-22 02:50:30,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499884244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967528103] [2022-11-22 02:50:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:30,779 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:30,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:50:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:30,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:50:30,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:50:30,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:50:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967528103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:50:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641658011] [2022-11-22 02:50:30,999 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-22 02:50:30,999 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:30,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:30,999 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:31,000 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:31,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:50:31,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:31,040 INFO L350 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 [2022-11-22 02:50:31,046 INFO L350 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 [2022-11-22 02:50:31,052 INFO L350 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 [2022-11-22 02:50:31,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:31,061 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:31,068 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:31,076 INFO L350 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 [2022-11-22 02:50:31,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,355 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:31,364 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:31,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:31,375 INFO L350 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 23 treesize of output 11 [2022-11-22 02:50:31,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,595 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:31,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:31,607 INFO L350 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 23 treesize of output 11 [2022-11-22 02:50:31,615 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:31,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:31,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:31,920 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:50:31,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:50:31,951 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:50:31,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:50:31,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:50:32,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:32,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:32,595 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:50:32,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-22 02:50:32,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:32,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:32,679 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:50:32,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-22 02:50:32,724 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-22 02:50:32,724 INFO L350 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 405 treesize of output 404 [2022-11-22 02:50:33,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:50:33,105 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:50:33,106 INFO L350 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 158 treesize of output 152 [2022-11-22 02:50:33,143 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:50:33,144 INFO L350 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 154 treesize of output 148 [2022-11-22 02:50:33,441 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-22 02:50:33,665 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:39,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3063#(and (not (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (= |#NULL.base| 0))' at error location [2022-11-22 02:50:39,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:39,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:50:39,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-22 02:50:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933609162] [2022-11-22 02:50:39,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:39,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:50:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:50:39,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:50:39,860 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:50:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:40,057 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-11-22 02:50:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:50:40,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-11-22 02:50:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:40,059 INFO L225 Difference]: With dead ends: 87 [2022-11-22 02:50:40,059 INFO L226 Difference]: Without dead ends: 87 [2022-11-22 02:50:40,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-22 02:50:40,061 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 110 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:40,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 163 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:50:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-22 02:50:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-11-22 02:50:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 76 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2022-11-22 02:50:40,065 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 28 [2022-11-22 02:50:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:40,066 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2022-11-22 02:50:40,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:50:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2022-11-22 02:50:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 02:50:40,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:40,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:40,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:40,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:40,271 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash -562101260, now seen corresponding path program 1 times [2022-11-22 02:50:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996697987] [2022-11-22 02:50:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:50:40,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996697987] [2022-11-22 02:50:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996697987] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313949893] [2022-11-22 02:50:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:40,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:40,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:50:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:40,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:50:40,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:50:40,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:50:40,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313949893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:50:40,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1018522791] [2022-11-22 02:50:40,686 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 02:50:40,686 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:40,686 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:40,686 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:40,687 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:40,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:50:40,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:40,717 INFO L350 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 [2022-11-22 02:50:40,721 INFO L350 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 [2022-11-22 02:50:40,725 INFO L350 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 [2022-11-22 02:50:40,733 INFO L350 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 [2022-11-22 02:50:40,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:40,741 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:40,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:40,749 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:40,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:40,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:40,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:40,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:40,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:40,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:40,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:40,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:40,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:40,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,019 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:41,030 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:41,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:41,040 INFO L350 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 23 treesize of output 11 [2022-11-22 02:50:41,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:50:41,248 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,250 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,251 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,253 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,271 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:41,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:41,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:50:41,508 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,510 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,512 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,514 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,516 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:41,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:41,628 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:41,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:41,639 INFO L350 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 23 treesize of output 11 [2022-11-22 02:50:41,651 INFO L350 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 19 treesize of output 11 [2022-11-22 02:50:41,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:50:41,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:41,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:41,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:41,939 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,948 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:41,953 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:42,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:50:42,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:42,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:42,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:42,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:42,158 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:42,161 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:42,163 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:42,165 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:50:42,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:50:42,370 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:50:42,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:50:42,396 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:50:42,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:50:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:42,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:50:42,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:42,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:42,991 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-22 02:50:42,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 393 [2022-11-22 02:50:43,039 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-22 02:50:43,040 INFO L350 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 405 treesize of output 404 [2022-11-22 02:50:43,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:43,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:43,115 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:50:43,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 403 treesize of output 381 [2022-11-22 02:50:43,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:50:43,591 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:50:43,591 INFO L350 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 158 treesize of output 152 [2022-11-22 02:50:43,633 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:50:43,633 INFO L350 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 154 treesize of output 148 [2022-11-22 02:50:43,897 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-22 02:50:44,120 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:50,121 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3434#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (or (and (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |#NULL.base| 0)) (and (< 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= (+ |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |#NULL.base| 0))) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2022-11-22 02:50:50,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:50,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:50:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2022-11-22 02:50:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549187112] [2022-11-22 02:50:50,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:50:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:50:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=467, Unknown=1, NotChecked=0, Total=552 [2022-11-22 02:50:50,123 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:50:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:50,277 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-11-22 02:50:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:50:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-22 02:50:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:50,280 INFO L225 Difference]: With dead ends: 87 [2022-11-22 02:50:50,280 INFO L226 Difference]: Without dead ends: 87 [2022-11-22 02:50:50,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=96, Invalid=553, Unknown=1, NotChecked=0, Total=650 [2022-11-22 02:50:50,281 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 189 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:50,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 162 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:50:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-22 02:50:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-11-22 02:50:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2022-11-22 02:50:50,286 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 29 [2022-11-22 02:50:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:50,286 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2022-11-22 02:50:50,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:50:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2022-11-22 02:50:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:50:50,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:50,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:50,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:50,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 02:50:50,491 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 909400029, now seen corresponding path program 2 times [2022-11-22 02:50:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740021493] [2022-11-22 02:50:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:50:50,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:50,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740021493] [2022-11-22 02:50:50,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740021493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:50,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:50:50,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:50:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283463250] [2022-11-22 02:50:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:50,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:50:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:50:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:50:50,816 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:51,069 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-11-22 02:50:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:50:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-22 02:50:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:51,071 INFO L225 Difference]: With dead ends: 110 [2022-11-22 02:50:51,071 INFO L226 Difference]: Without dead ends: 110 [2022-11-22 02:50:51,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:50:51,072 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 262 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:51,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 170 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:50:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-22 02:50:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2022-11-22 02:50:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 76 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:50:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-11-22 02:50:51,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 31 [2022-11-22 02:50:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:51,076 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-11-22 02:50:51,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-11-22 02:50:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:50:51,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:51,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:51,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 02:50:51,077 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1018086712, now seen corresponding path program 3 times [2022-11-22 02:50:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930704190] [2022-11-22 02:50:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 02:50:51,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930704190] [2022-11-22 02:50:51,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930704190] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:51,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666058463] [2022-11-22 02:50:51,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:50:51,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:51,167 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:51,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:50:51,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:50:51,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:50:51,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-22 02:50:51,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:51,453 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:50:51,454 INFO L350 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 18 [2022-11-22 02:50:51,517 INFO L350 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 [2022-11-22 02:50:51,580 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:50:51,580 INFO L350 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 32 [2022-11-22 02:50:51,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:51,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:50:51,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 29 [2022-11-22 02:50:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 02:50:51,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:51,986 INFO L350 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 142 treesize of output 134 [2022-11-22 02:50:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 02:50:52,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666058463] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:50:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [190993211] [2022-11-22 02:50:52,665 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 02:50:52,665 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:52,666 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:52,666 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:52,666 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:52,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:50:52,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:52,703 INFO L350 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 [2022-11-22 02:50:52,709 INFO L350 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 [2022-11-22 02:50:52,715 INFO L350 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 [2022-11-22 02:50:52,723 INFO L350 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 [2022-11-22 02:50:52,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:52,730 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:52,738 INFO L350 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 27 treesize of output 11 [2022-11-22 02:50:52,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:52,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:52,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:52,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:52,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:52,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:52,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:52,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:52,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:50:52,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:50:53,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:53,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:53,055 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:50:53,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:53,070 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:50:53,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:53,088 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-22 02:50:53,227 INFO L350 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 [2022-11-22 02:50:53,237 INFO L350 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 [2022-11-22 02:50:53,245 INFO L350 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 [2022-11-22 02:50:53,390 INFO L350 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 [2022-11-22 02:50:53,399 INFO L350 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 [2022-11-22 02:50:53,407 INFO L350 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 [2022-11-22 02:50:53,528 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:50:53,677 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:56,243 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4045#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 3 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:50:56,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:56,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:50:56,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 22 [2022-11-22 02:50:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559699364] [2022-11-22 02:50:56,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:56,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 02:50:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 02:50:56,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1282, Unknown=2, NotChecked=0, Total=1406 [2022-11-22 02:50:56,246 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 22 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-22 02:50:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:56,922 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-11-22 02:50:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:50:56,922 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2022-11-22 02:50:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:56,923 INFO L225 Difference]: With dead ends: 88 [2022-11-22 02:50:56,923 INFO L226 Difference]: Without dead ends: 88 [2022-11-22 02:50:56,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=149, Invalid=1571, Unknown=2, NotChecked=0, Total=1722 [2022-11-22 02:50:56,924 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 147 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:56,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 363 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:50:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-22 02:50:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2022-11-22 02:50:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.56) internal successors, (78), 65 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-22 02:50:56,928 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 33 [2022-11-22 02:50:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:56,928 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-22 02:50:56,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-22 02:50:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-22 02:50:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:50:56,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:56,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:56,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:57,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 02:50:57,130 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2055158716, now seen corresponding path program 1 times [2022-11-22 02:50:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513484749] [2022-11-22 02:50:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 02:50:57,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:57,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513484749] [2022-11-22 02:50:57,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513484749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:57,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603757705] [2022-11-22 02:50:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:57,301 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:57,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:50:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:57,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:50:57,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:50:57,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:50:57,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603757705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:50:57,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:50:57,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-22 02:50:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673287780] [2022-11-22 02:50:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:50:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:50:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:57,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:50:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:50:57,540 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:57,605 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-22 02:50:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:50:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-22 02:50:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:57,607 INFO L225 Difference]: With dead ends: 65 [2022-11-22 02:50:57,607 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 02:50:57,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:50:57,608 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 137 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:57,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 62 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:50:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 02:50:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-22 02:50:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-22 02:50:57,611 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 33 [2022-11-22 02:50:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:57,612 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-22 02:50:57,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:50:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-22 02:50:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:50:57,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:57,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:50:57,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:50:57,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:57,819 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:50:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2055162288, now seen corresponding path program 1 times [2022-11-22 02:50:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:57,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459356538] [2022-11-22 02:50:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:50:58,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459356538] [2022-11-22 02:50:58,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459356538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18677384] [2022-11-22 02:50:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:58,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:58,661 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:58,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 02:50:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:58,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-22 02:50:58,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:58,865 INFO L350 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 [2022-11-22 02:50:58,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:50:58,962 INFO L350 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 [2022-11-22 02:50:59,028 INFO L350 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 [2022-11-22 02:50:59,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:50:59,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-22 02:50:59,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:50:59,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-22 02:50:59,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:59,316 INFO L350 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 31 treesize of output 26 [2022-11-22 02:50:59,374 INFO L350 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 25 treesize of output 13 [2022-11-22 02:50:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:50:59,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:59,826 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-22 02:50:59,826 INFO L350 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 29 treesize of output 28 [2022-11-22 02:50:59,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:50:59,910 INFO L350 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 36 treesize of output 29 [2022-11-22 02:50:59,917 INFO L350 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 136 treesize of output 112 [2022-11-22 02:50:59,927 INFO L350 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 108 treesize of output 98 [2022-11-22 02:50:59,930 INFO L350 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 98 treesize of output 94 [2022-11-22 02:51:00,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18677384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1459144803] [2022-11-22 02:51:00,038 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:51:00,038 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:51:00,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:51:00,039 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:51:00,039 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:51:00,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:51:00,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:51:00,075 INFO L350 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 [2022-11-22 02:51:00,079 INFO L350 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 [2022-11-22 02:51:00,086 INFO L350 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 [2022-11-22 02:51:00,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:00,094 INFO L350 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 27 treesize of output 11 [2022-11-22 02:51:00,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:00,107 INFO L350 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 27 treesize of output 11 [2022-11-22 02:51:00,112 INFO L350 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 [2022-11-22 02:51:00,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:51:00,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:00,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:51:00,432 INFO L350 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 9 treesize of output 3 [2022-11-22 02:51:00,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:00,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:00,466 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,468 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,470 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,472 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:51:00,623 INFO L350 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 9 treesize of output 3 [2022-11-22 02:51:00,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:00,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:00,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:51:00,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:00,672 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,673 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,675 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,677 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,678 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:00,739 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:00,752 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:00,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:00,765 INFO L350 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 23 treesize of output 11 [2022-11-22 02:51:00,895 INFO L350 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 [2022-11-22 02:51:00,902 INFO L350 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 [2022-11-22 02:51:00,910 INFO L350 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 [2022-11-22 02:51:01,088 INFO L350 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 [2022-11-22 02:51:01,098 INFO L350 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 [2022-11-22 02:51:01,115 INFO L350 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 [2022-11-22 02:51:01,261 INFO L350 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 19 treesize of output 1 [2022-11-22 02:51:01,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:51:01,287 INFO L350 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 19 treesize of output 1 [2022-11-22 02:51:01,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:51:01,411 INFO L350 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 19 treesize of output 1 [2022-11-22 02:51:01,420 INFO L350 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 19 treesize of output 1 [2022-11-22 02:51:01,593 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:51:01,740 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:51:05,322 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4654#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:51:05,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:51:05,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:51:05,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2022-11-22 02:51:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669986693] [2022-11-22 02:51:05,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:51:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 02:51:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 02:51:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2822, Unknown=50, NotChecked=0, Total=3080 [2022-11-22 02:51:05,325 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 30 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:51:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:51:06,275 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-11-22 02:51:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 02:51:06,275 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-11-22 02:51:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:51:06,276 INFO L225 Difference]: With dead ends: 112 [2022-11-22 02:51:06,276 INFO L226 Difference]: Without dead ends: 112 [2022-11-22 02:51:06,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=344, Invalid=3894, Unknown=52, NotChecked=0, Total=4290 [2022-11-22 02:51:06,277 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 355 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:51:06,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 386 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:51:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-22 02:51:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 64. [2022-11-22 02:51:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:51:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-11-22 02:51:06,281 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 33 [2022-11-22 02:51:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:51:06,282 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-11-22 02:51:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:51:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-11-22 02:51:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:51:06,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:51:06,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:51:06,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:51:06,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:51:06,490 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:51:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:51:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2055162289, now seen corresponding path program 1 times [2022-11-22 02:51:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:51:06,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192687170] [2022-11-22 02:51:06,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:51:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:51:07,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:51:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192687170] [2022-11-22 02:51:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192687170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679263002] [2022-11-22 02:51:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:51:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:51:07,815 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:51:07,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 02:51:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:07,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-22 02:51:07,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:51:08,000 INFO L350 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 [2022-11-22 02:51:08,288 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:51:08,289 INFO L350 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 [2022-11-22 02:51:08,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-11-22 02:51:08,401 INFO L350 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 [2022-11-22 02:51:08,407 INFO L350 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 [2022-11-22 02:51:08,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:51:08,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-22 02:51:08,492 INFO L350 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 33 [2022-11-22 02:51:08,713 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:51:08,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-22 02:51:08,720 INFO L350 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 33 [2022-11-22 02:51:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:08,833 INFO L350 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 37 treesize of output 32 [2022-11-22 02:51:08,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:08,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-22 02:51:08,930 INFO L350 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 31 treesize of output 19 [2022-11-22 02:51:08,939 INFO L350 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 26 treesize of output 14 [2022-11-22 02:51:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:51:08,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:51:09,566 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1375) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1376 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-22 02:51:09,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1375) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1376 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))) is different from false [2022-11-22 02:51:09,779 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1373))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1374) .cse0 v_ArrVal_1376) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1375) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1374) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1376) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2022-11-22 02:51:09,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:09,804 INFO L350 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 38 treesize of output 39 [2022-11-22 02:51:09,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:09,811 INFO L350 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 30 treesize of output 31 [2022-11-22 02:51:09,816 INFO L350 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 54 treesize of output 46 [2022-11-22 02:51:09,820 INFO L350 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 146 treesize of output 134 [2022-11-22 02:51:09,827 INFO L350 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 68 treesize of output 60 [2022-11-22 02:51:09,830 INFO L350 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 122 treesize of output 114 [2022-11-22 02:51:09,833 INFO L350 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 114 treesize of output 110 [2022-11-22 02:51:09,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:09,890 INFO L350 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 73 treesize of output 74 [2022-11-22 02:51:09,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:09,899 INFO L350 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 65 treesize of output 50 [2022-11-22 02:51:09,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:09,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-11-22 02:51:09,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:09,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:09,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-22 02:51:20,261 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:51:20,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679263002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:20,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [507452977] [2022-11-22 02:51:20,264 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:51:20,264 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:51:20,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:51:20,265 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:51:20,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:51:20,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:51:20,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:51:20,295 INFO L350 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 [2022-11-22 02:51:20,299 INFO L350 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 [2022-11-22 02:51:20,303 INFO L350 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 [2022-11-22 02:51:20,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:20,312 INFO L350 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 27 treesize of output 11 [2022-11-22 02:51:20,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:20,318 INFO L350 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 27 treesize of output 11 [2022-11-22 02:51:20,324 INFO L350 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 [2022-11-22 02:51:20,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:20,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:20,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:20,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:20,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,580 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:20,591 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:20,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:20,602 INFO L350 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 23 treesize of output 11 [2022-11-22 02:51:20,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:20,807 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:20,810 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:20,812 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:20,814 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:20,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:20,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:20,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:20,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:21,063 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,065 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,067 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:21,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:21,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:21,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:21,217 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:51:21,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:21,231 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:51:21,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:21,246 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-22 02:51:21,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:21,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:21,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:21,504 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,506 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,507 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,510 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:21,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:21,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:21,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:21,765 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,766 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,768 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,769 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:21,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:21,997 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:51:21,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:51:22,024 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:51:22,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:51:22,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:22,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:51:22,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:22,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:22,518 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:51:22,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-22 02:51:22,575 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-22 02:51:22,576 INFO L350 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 405 treesize of output 404 [2022-11-22 02:51:22,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:22,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:22,653 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:51:22,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 403 treesize of output 381 [2022-11-22 02:51:23,065 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:51:23,066 INFO L350 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 158 treesize of output 152 [2022-11-22 02:51:23,105 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:51:23,106 INFO L350 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 154 treesize of output 148 [2022-11-22 02:51:23,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:51:23,581 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-22 02:51:23,807 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:51:33,472 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5071#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (not (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ 4 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (= |#NULL.base| 0))' at error location [2022-11-22 02:51:33,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:51:33,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:51:33,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2022-11-22 02:51:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205630133] [2022-11-22 02:51:33,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:51:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:51:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:51:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3783, Unknown=30, NotChecked=378, Total=4422 [2022-11-22 02:51:33,475 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 36 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:51:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:51:35,126 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-11-22 02:51:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:51:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-11-22 02:51:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:51:35,127 INFO L225 Difference]: With dead ends: 92 [2022-11-22 02:51:35,127 INFO L226 Difference]: Without dead ends: 92 [2022-11-22 02:51:35,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=354, Invalid=4883, Unknown=31, NotChecked=432, Total=5700 [2022-11-22 02:51:35,130 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 544 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:51:35,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 893 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 02:51:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-22 02:51:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2022-11-22 02:51:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.391304347826087) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:51:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-22 02:51:35,134 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2022-11-22 02:51:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:51:35,134 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-22 02:51:35,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:51:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-22 02:51:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:51:35,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:51:35,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:51:35,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:51:35,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-22 02:51:35,339 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:51:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:51:35,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2058590045, now seen corresponding path program 1 times [2022-11-22 02:51:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:51:35,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827459122] [2022-11-22 02:51:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:51:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 02:51:35,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:51:35,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827459122] [2022-11-22 02:51:35,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827459122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:35,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129647139] [2022-11-22 02:51:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:35,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:51:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:51:35,485 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:51:35,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 02:51:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:35,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:51:35,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:51:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:51:35,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:51:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129647139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:51:35,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:51:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-22 02:51:35,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141720206] [2022-11-22 02:51:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:51:35,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:51:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:51:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:51:35,741 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:51:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:51:35,825 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-11-22 02:51:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:51:35,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-22 02:51:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:51:35,826 INFO L225 Difference]: With dead ends: 63 [2022-11-22 02:51:35,826 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 02:51:35,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:51:35,827 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:51:35,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:51:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 02:51:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-11-22 02:51:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:51:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-11-22 02:51:35,831 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 33 [2022-11-22 02:51:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:51:35,831 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-11-22 02:51:35,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:51:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-11-22 02:51:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:51:35,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:51:35,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:51:35,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 02:51:36,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 02:51:36,039 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:51:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:51:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -673905859, now seen corresponding path program 1 times [2022-11-22 02:51:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:51:36,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118015366] [2022-11-22 02:51:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:51:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:51:38,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:51:38,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118015366] [2022-11-22 02:51:38,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118015366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:38,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314901219] [2022-11-22 02:51:38,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:38,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:51:38,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:51:38,159 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:51:38,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 02:51:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:38,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-22 02:51:38,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:51:38,394 INFO L350 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 [2022-11-22 02:51:38,653 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:51:38,653 INFO L350 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 [2022-11-22 02:51:38,744 INFO L350 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 [2022-11-22 02:51:38,747 INFO L350 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 [2022-11-22 02:51:38,820 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:51:38,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-22 02:51:38,826 INFO L350 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 10 treesize of output 9 [2022-11-22 02:51:39,071 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:51:39,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-11-22 02:51:39,079 INFO L350 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 29 treesize of output 21 [2022-11-22 02:51:39,083 INFO L350 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 32 treesize of output 34 [2022-11-22 02:51:39,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:39,264 INFO L350 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 38 [2022-11-22 02:51:39,271 INFO L350 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 28 treesize of output 30 [2022-11-22 02:51:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:39,277 INFO L350 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 35 treesize of output 34 [2022-11-22 02:51:39,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-22 02:51:39,439 INFO L350 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 21 treesize of output 13 [2022-11-22 02:51:39,495 INFO L350 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 19 treesize of output 7 [2022-11-22 02:51:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:51:39,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:51:39,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 (Array Int Int)) (v_ArrVal_1603 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1605) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_1606)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_1603)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) .cse3)) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 (Array Int Int)) (v_ArrVal_1603 Int)) (<= .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1605) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_1606)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_1603)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))))) is different from false [2022-11-22 02:51:39,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 (Array Int Int)) (v_ArrVal_1603 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1605) (select (store .cse0 .cse1 v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse1 v_ArrVal_1603) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) .cse3)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 (Array Int Int)) (v_ArrVal_1603 Int)) (<= .cse3 (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1605) (select (store .cse0 .cse4 v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse4 v_ArrVal_1603) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))))))) is different from false [2022-11-22 02:51:39,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:39,866 INFO L350 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 50 treesize of output 51 [2022-11-22 02:51:39,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:39,878 INFO L350 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 104 treesize of output 103 [2022-11-22 02:51:39,885 INFO L350 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 39 treesize of output 23 [2022-11-22 02:51:39,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:39,948 INFO L350 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 50 treesize of output 51 [2022-11-22 02:51:39,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:39,968 INFO L350 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 104 treesize of output 103 [2022-11-22 02:51:39,976 INFO L350 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 39 treesize of output 23 [2022-11-22 02:51:40,370 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse2 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1603 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1600) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1603) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-22 02:51:40,430 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1603 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1600) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1603) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-11-22 02:51:40,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:40,805 INFO L350 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 42 treesize of output 35 [2022-11-22 02:51:40,809 INFO L350 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 161 treesize of output 149 [2022-11-22 02:51:40,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:40,814 INFO L350 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 144 treesize of output 132 [2022-11-22 02:51:40,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:40,822 INFO L350 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 109 treesize of output 105 [2022-11-22 02:51:40,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:40,827 INFO L350 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 100 treesize of output 90 [2022-11-22 02:51:40,842 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 02:51:40,842 INFO L350 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 56 treesize of output 1 [2022-11-22 02:51:40,849 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 02:51:40,849 INFO L350 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 56 treesize of output 1 [2022-11-22 02:51:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-22 02:51:41,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314901219] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:51:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11757373] [2022-11-22 02:51:41,374 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:51:41,374 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:51:41,375 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:51:41,375 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:51:41,375 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:51:41,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:51:41,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:51:41,410 INFO L350 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 [2022-11-22 02:51:41,415 INFO L350 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 [2022-11-22 02:51:41,420 INFO L350 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 [2022-11-22 02:51:41,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:41,430 INFO L350 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 27 treesize of output 11 [2022-11-22 02:51:41,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:41,437 INFO L350 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 27 treesize of output 11 [2022-11-22 02:51:41,442 INFO L350 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 [2022-11-22 02:51:41,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:41,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:41,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:41,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:41,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,699 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:41,711 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:41,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:41,722 INFO L350 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 23 treesize of output 11 [2022-11-22 02:51:41,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:41,961 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:41,963 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:41,965 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:41,967 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:41,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:41,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:41,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:42,196 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,198 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,200 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,202 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,332 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:42,341 INFO L350 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 19 treesize of output 11 [2022-11-22 02:51:42,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:42,354 INFO L350 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 23 treesize of output 11 [2022-11-22 02:51:42,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:42,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,615 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,617 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,619 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,620 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:42,767 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,769 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,770 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,772 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,773 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:51:42,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:51:42,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:51:42,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-22 02:51:43,047 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:51:43,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:51:43,071 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:51:43,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 02:51:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:43,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:51:43,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:43,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:43,588 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:51:43,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-22 02:51:43,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:43,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:43,661 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-22 02:51:43,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-22 02:51:43,704 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-22 02:51:43,704 INFO L350 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 405 treesize of output 404 [2022-11-22 02:51:44,061 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:51:44,061 INFO L350 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 160 treesize of output 154 [2022-11-22 02:51:44,098 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:51:44,098 INFO L350 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 156 treesize of output 150 [2022-11-22 02:51:44,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:51:44,514 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-22 02:51:44,720 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:51:55,837 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5758#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ 4 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (= |#NULL.base| 0))' at error location [2022-11-22 02:51:55,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:51:55,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:51:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 60 [2022-11-22 02:51:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697248956] [2022-11-22 02:51:55,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:51:55,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-22 02:51:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-22 02:51:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5511, Unknown=63, NotChecked=612, Total=6480 [2022-11-22 02:51:55,840 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 60 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-22 02:52:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:00,381 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-22 02:52:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 02:52:00,382 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2022-11-22 02:52:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:00,383 INFO L225 Difference]: With dead ends: 82 [2022-11-22 02:52:00,383 INFO L226 Difference]: Without dead ends: 82 [2022-11-22 02:52:00,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2156 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=546, Invalid=8717, Unknown=65, NotChecked=772, Total=10100 [2022-11-22 02:52:00,387 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 359 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:00,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 670 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1268 Invalid, 0 Unknown, 258 Unchecked, 1.5s Time] [2022-11-22 02:52:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-22 02:52:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2022-11-22 02:52:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-22 02:52:00,390 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 35 [2022-11-22 02:52:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:00,391 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-22 02:52:00,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-22 02:52:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-22 02:52:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 02:52:00,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:00,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:00,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-22 02:52:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:00,598 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1720175675, now seen corresponding path program 1 times [2022-11-22 02:52:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:00,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228940683] [2022-11-22 02:52:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:52:01,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:01,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228940683] [2022-11-22 02:52:01,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228940683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:01,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366097911] [2022-11-22 02:52:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:01,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:52:01,510 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:52:01,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 02:52:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:01,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-22 02:52:01,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:52:01,903 INFO L350 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 17 treesize of output 13 [2022-11-22 02:52:02,097 INFO L350 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 19 treesize of output 7 [2022-11-22 02:52:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:52:02,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:52:02,331 INFO L350 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 38 treesize of output 32 [2022-11-22 02:52:02,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:02,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:52:02,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366097911] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:52:02,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [570882695] [2022-11-22 02:52:02,484 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:52:02,484 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:52:02,485 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:52:02,485 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:52:02,485 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:52:02,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:52:02,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:52:02,519 INFO L350 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 [2022-11-22 02:52:02,524 INFO L350 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 [2022-11-22 02:52:02,528 INFO L350 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 [2022-11-22 02:52:02,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:02,536 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:02,542 INFO L350 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 [2022-11-22 02:52:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:02,549 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:02,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:52:02,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:52:02,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:02,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:02,816 INFO L350 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 9 treesize of output 3 [2022-11-22 02:52:02,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:02,837 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:02,838 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:02,840 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:02,842 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:02,844 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:02,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:52:03,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:03,022 INFO L350 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 9 treesize of output 3 [2022-11-22 02:52:03,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:03,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:52:03,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:03,061 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:03,062 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:03,064 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:03,066 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:03,067 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:03,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:03,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:03,139 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:52:03,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:03,154 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:52:03,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:03,167 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 222 [2022-11-22 02:52:03,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:03,265 INFO L350 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 23 treesize of output 11 [2022-11-22 02:52:03,274 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:03,284 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:03,353 INFO L350 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 [2022-11-22 02:52:03,361 INFO L350 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 [2022-11-22 02:52:03,371 INFO L350 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 [2022-11-22 02:52:03,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:03,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:03,668 INFO L321 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-22 02:52:03,668 INFO L350 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 224 treesize of output 235 [2022-11-22 02:52:03,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:03,738 INFO L321 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-22 02:52:03,739 INFO L350 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 212 treesize of output 215 [2022-11-22 02:52:04,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:04,275 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:52:04,275 INFO L350 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 146 treesize of output 140 [2022-11-22 02:52:04,321 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:52:04,322 INFO L350 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 142 treesize of output 136 [2022-11-22 02:52:05,053 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:52:05,181 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:52:10,162 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6222#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) (= |#NULL.base| 0))' at error location [2022-11-22 02:52:10,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:52:10,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:52:10,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 32 [2022-11-22 02:52:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130379669] [2022-11-22 02:52:10,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:52:10,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:52:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:52:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2534, Unknown=1, NotChecked=0, Total=2756 [2022-11-22 02:52:10,165 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:52:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:11,302 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-22 02:52:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:52:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-11-22 02:52:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:11,304 INFO L225 Difference]: With dead ends: 89 [2022-11-22 02:52:11,304 INFO L226 Difference]: Without dead ends: 89 [2022-11-22 02:52:11,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=369, Invalid=3536, Unknown=1, NotChecked=0, Total=3906 [2022-11-22 02:52:11,306 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 519 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:11,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 554 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:52:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-22 02:52:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2022-11-22 02:52:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-22 02:52:11,309 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 39 [2022-11-22 02:52:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:11,309 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-22 02:52:11,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:52:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-22 02:52:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:52:11,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:11,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:11,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-22 02:52:11,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:11,515 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1474569637, now seen corresponding path program 2 times [2022-11-22 02:52:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:11,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847659316] [2022-11-22 02:52:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:52:11,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:11,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847659316] [2022-11-22 02:52:11,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847659316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:11,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218239496] [2022-11-22 02:52:11,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:52:11,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:11,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:52:11,675 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:52:11,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 02:52:11,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:52:11,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:52:11,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:52:11,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:52:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:52:11,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:52:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:52:12,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218239496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:52:12,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1691504272] [2022-11-22 02:52:12,002 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-22 02:52:12,002 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:52:12,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:52:12,003 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:52:12,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:52:12,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:52:12,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:52:12,031 INFO L350 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 [2022-11-22 02:52:12,036 INFO L350 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 [2022-11-22 02:52:12,040 INFO L350 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 [2022-11-22 02:52:12,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:12,048 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:12,053 INFO L350 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 [2022-11-22 02:52:12,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:12,060 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:12,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:52:12,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:12,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:12,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:12,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:12,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:12,322 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,326 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,328 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,330 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:52:12,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:12,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:12,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:12,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:12,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:12,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,557 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,560 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,561 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:12,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:12,600 INFO L350 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 23 treesize of output 11 [2022-11-22 02:52:12,609 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:12,621 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:12,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:12,762 INFO L350 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 124 treesize of output 108 [2022-11-22 02:52:12,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:12,773 INFO L350 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 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-22 02:52:12,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:12,784 INFO L350 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 0 case distinctions, treesize of input 116 treesize of output 104 [2022-11-22 02:52:12,948 INFO L350 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 [2022-11-22 02:52:12,957 INFO L350 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 [2022-11-22 02:52:12,971 INFO L350 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 [2022-11-22 02:52:13,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:13,089 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:13,098 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:13,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:13,317 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:52:13,317 INFO L350 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 146 treesize of output 140 [2022-11-22 02:52:13,354 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:52:13,355 INFO L350 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 142 treesize of output 136 [2022-11-22 02:52:14,092 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:52:14,225 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:52:18,313 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6662#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) (= |#NULL.base| 0))' at error location [2022-11-22 02:52:18,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:52:18,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:52:18,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-22 02:52:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860915380] [2022-11-22 02:52:18,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:52:18,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:52:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:18,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:52:18,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-11-22 02:52:18,316 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:52:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:18,468 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-22 02:52:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:52:18,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-22 02:52:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:18,469 INFO L225 Difference]: With dead ends: 57 [2022-11-22 02:52:18,469 INFO L226 Difference]: Without dead ends: 57 [2022-11-22 02:52:18,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:52:18,471 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:18,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 95 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:52:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-22 02:52:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-22 02:52:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-22 02:52:18,482 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2022-11-22 02:52:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:18,482 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-22 02:52:18,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:52:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-22 02:52:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:52:18,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:18,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:18,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 02:52:18,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 02:52:18,690 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 476045988, now seen corresponding path program 1 times [2022-11-22 02:52:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784967333] [2022-11-22 02:52:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 02:52:18,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784967333] [2022-11-22 02:52:18,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784967333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:52:18,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:52:18,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:52:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226878422] [2022-11-22 02:52:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:52:18,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:52:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:52:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:52:18,795 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:18,897 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-11-22 02:52:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:52:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-22 02:52:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:18,898 INFO L225 Difference]: With dead ends: 74 [2022-11-22 02:52:18,899 INFO L226 Difference]: Without dead ends: 74 [2022-11-22 02:52:18,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:52:18,899 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 94 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:18,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:52:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-22 02:52:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-11-22 02:52:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-22 02:52:18,902 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 41 [2022-11-22 02:52:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:18,902 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-22 02:52:18,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-22 02:52:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:52:18,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:18,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 02:52:18,903 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 476045989, now seen corresponding path program 1 times [2022-11-22 02:52:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:18,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351816132] [2022-11-22 02:52:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 02:52:19,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:19,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351816132] [2022-11-22 02:52:19,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351816132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:52:19,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:52:19,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:52:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464784475] [2022-11-22 02:52:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:52:19,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:52:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:52:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:52:19,217 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:19,426 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-22 02:52:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:52:19,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-22 02:52:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:19,427 INFO L225 Difference]: With dead ends: 58 [2022-11-22 02:52:19,427 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 02:52:19,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:52:19,428 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 115 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:19,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 82 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:52:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 02:52:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-22 02:52:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-22 02:52:19,431 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 41 [2022-11-22 02:52:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:19,431 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-22 02:52:19,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-22 02:52:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:52:19,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:19,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:19,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-22 02:52:19,432 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1872557616, now seen corresponding path program 1 times [2022-11-22 02:52:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:19,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706232488] [2022-11-22 02:52:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 02:52:19,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:19,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706232488] [2022-11-22 02:52:19,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706232488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:52:19,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:52:19,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:52:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301842872] [2022-11-22 02:52:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:52:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:52:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:52:19,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:52:19,580 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:19,720 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-11-22 02:52:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:52:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-22 02:52:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:19,721 INFO L225 Difference]: With dead ends: 58 [2022-11-22 02:52:19,721 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 02:52:19,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:52:19,722 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:19,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 105 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:52:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 02:52:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-22 02:52:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-22 02:52:19,724 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 42 [2022-11-22 02:52:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:19,725 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-22 02:52:19,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-22 02:52:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:52:19,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:19,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:19,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-22 02:52:19,726 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2081232209, now seen corresponding path program 1 times [2022-11-22 02:52:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:19,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048260091] [2022-11-22 02:52:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-22 02:52:19,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048260091] [2022-11-22 02:52:19,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048260091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322019058] [2022-11-22 02:52:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:19,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:52:19,915 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:52:19,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 02:52:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:20,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 02:52:20,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:52:20,422 INFO L350 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 17 treesize of output 9 [2022-11-22 02:52:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 02:52:20,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:52:20,504 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-22 02:52:20,504 INFO L350 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 16 treesize of output 15 [2022-11-22 02:52:20,540 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-22 02:52:20,541 INFO L350 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 11 treesize of output 11 [2022-11-22 02:52:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-22 02:52:20,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322019058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:52:20,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1123268303] [2022-11-22 02:52:20,602 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 02:52:20,603 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:52:20,603 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:52:20,603 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:52:20,603 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:52:20,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:52:20,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:52:20,636 INFO L350 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 [2022-11-22 02:52:20,642 INFO L350 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 [2022-11-22 02:52:20,646 INFO L350 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 [2022-11-22 02:52:20,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:20,654 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:20,663 INFO L350 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 [2022-11-22 02:52:20,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:20,669 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:20,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:52:20,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:52:20,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:20,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:20,914 INFO L350 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 9 treesize of output 3 [2022-11-22 02:52:20,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:20,937 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:20,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:20,940 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:20,942 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:20,944 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:20,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-22 02:52:21,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:21,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:21,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:21,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:21,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:21,135 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:21,137 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:21,138 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:21,140 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:52:21,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:21,221 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:52:21,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,235 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:52:21,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,249 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-22 02:52:21,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:21,372 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 114 [2022-11-22 02:52:21,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,383 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-22 02:52:21,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,394 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-22 02:52:21,502 INFO L350 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 [2022-11-22 02:52:21,510 INFO L350 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 [2022-11-22 02:52:21,518 INFO L350 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 [2022-11-22 02:52:21,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,777 INFO L321 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-22 02:52:21,777 INFO L350 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 224 treesize of output 235 [2022-11-22 02:52:21,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:21,841 INFO L321 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-22 02:52:21,841 INFO L350 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 212 treesize of output 215 [2022-11-22 02:52:22,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:22,293 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:52:22,293 INFO L350 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 146 treesize of output 140 [2022-11-22 02:52:22,329 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-22 02:52:22,329 INFO L350 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 142 treesize of output 136 [2022-11-22 02:52:22,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:23,060 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:52:23,193 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:52:30,693 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7488#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (not (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1))) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~expected~0#1| 2147483648)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))' at error location [2022-11-22 02:52:30,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:52:30,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:52:30,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 20 [2022-11-22 02:52:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803854307] [2022-11-22 02:52:30,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:52:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 02:52:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 02:52:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1855, Unknown=0, NotChecked=0, Total=2070 [2022-11-22 02:52:30,695 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 21 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 02:52:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:31,226 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-22 02:52:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 02:52:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-11-22 02:52:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:31,239 INFO L225 Difference]: With dead ends: 65 [2022-11-22 02:52:31,239 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 02:52:31,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=330, Invalid=2750, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 02:52:31,241 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 209 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:31,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 178 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:52:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 02:52:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-11-22 02:52:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.25) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-22 02:52:31,249 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 43 [2022-11-22 02:52:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:31,250 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-22 02:52:31,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 02:52:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-22 02:52:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:52:31,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:31,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:31,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 02:52:31,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-22 02:52:31,451 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2081232208, now seen corresponding path program 1 times [2022-11-22 02:52:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052808269] [2022-11-22 02:52:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:52:32,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:32,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052808269] [2022-11-22 02:52:32,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052808269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120000347] [2022-11-22 02:52:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:52:32,638 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:52:32,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 02:52:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-22 02:52:32,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:52:32,881 INFO L350 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 [2022-11-22 02:52:33,016 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:52:33,017 INFO L350 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 [2022-11-22 02:52:33,103 INFO L350 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 [2022-11-22 02:52:33,111 INFO L350 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 [2022-11-22 02:52:33,181 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:52:33,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-22 02:52:33,186 INFO L350 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 20 [2022-11-22 02:52:33,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-22 02:52:33,365 INFO L350 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 14 treesize of output 16 [2022-11-22 02:52:33,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:33,483 INFO L350 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 21 treesize of output 20 [2022-11-22 02:52:33,807 INFO L350 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 23 treesize of output 15 [2022-11-22 02:52:33,811 INFO L350 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 26 treesize of output 14 [2022-11-22 02:52:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:52:33,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:52:34,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:34,068 INFO L350 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 32 treesize of output 36 [2022-11-22 02:52:34,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:34,167 INFO L350 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 32 [2022-11-22 02:52:34,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:34,764 INFO L350 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 36 treesize of output 37 [2022-11-22 02:52:34,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:34,775 INFO L350 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 28 treesize of output 29 [2022-11-22 02:52:34,779 INFO L350 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 50 treesize of output 42 [2022-11-22 02:52:34,784 INFO L350 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 258 treesize of output 238 [2022-11-22 02:52:34,791 INFO L350 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 234 treesize of output 218 [2022-11-22 02:52:34,796 INFO L350 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 218 treesize of output 210 [2022-11-22 02:52:34,803 INFO L350 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 110 treesize of output 98 [2022-11-22 02:52:35,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120000347] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:35,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068335786] [2022-11-22 02:52:35,158 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 02:52:35,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:52:35,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:52:35,159 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:52:35,159 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:52:35,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:52:35,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:52:35,188 INFO L350 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 [2022-11-22 02:52:35,194 INFO L350 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 [2022-11-22 02:52:35,200 INFO L350 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 [2022-11-22 02:52:35,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:35,210 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:35,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:35,217 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:35,224 INFO L350 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 [2022-11-22 02:52:35,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:35,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:35,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:35,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:35,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:35,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:35,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:35,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:35,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:35,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:35,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:35,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:35,522 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:52:35,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:35,535 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:52:35,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:35,550 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-22 02:52:35,679 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:35,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:35,688 INFO L350 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 23 treesize of output 11 [2022-11-22 02:52:35,697 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:35,829 INFO L350 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 [2022-11-22 02:52:35,843 INFO L350 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 [2022-11-22 02:52:35,851 INFO L350 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 [2022-11-22 02:52:35,931 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:35,941 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:35,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:36,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:36,049 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:36,063 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:36,782 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:52:36,916 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:52:44,264 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7922#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= (+ |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|)))) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:52:44,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:52:44,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:52:44,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 38 [2022-11-22 02:52:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605706025] [2022-11-22 02:52:44,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:52:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 02:52:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 02:52:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=5657, Unknown=6, NotChecked=0, Total=6006 [2022-11-22 02:52:44,266 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:52:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:45,805 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-22 02:52:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 02:52:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-11-22 02:52:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:45,806 INFO L225 Difference]: With dead ends: 66 [2022-11-22 02:52:45,806 INFO L226 Difference]: Without dead ends: 66 [2022-11-22 02:52:45,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=605, Invalid=7761, Unknown=6, NotChecked=0, Total=8372 [2022-11-22 02:52:45,808 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 383 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:45,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 174 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:52:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-22 02:52:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2022-11-22 02:52:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-22 02:52:45,811 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 43 [2022-11-22 02:52:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:45,812 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-22 02:52:45,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:52:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-22 02:52:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 02:52:45,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:45,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:45,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-22 02:52:46,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:46,020 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash -93623152, now seen corresponding path program 1 times [2022-11-22 02:52:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:46,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504281220] [2022-11-22 02:52:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 02:52:46,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504281220] [2022-11-22 02:52:46,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504281220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:52:46,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:52:46,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:52:46,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594413608] [2022-11-22 02:52:46,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:52:46,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:52:46,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:52:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:52:46,216 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:52:46,369 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-22 02:52:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:52:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-22 02:52:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:52:46,370 INFO L225 Difference]: With dead ends: 58 [2022-11-22 02:52:46,370 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 02:52:46,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:52:46,371 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 100 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:52:46,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 76 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:52:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 02:52:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-22 02:52:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:52:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-22 02:52:46,374 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 44 [2022-11-22 02:52:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:52:46,375 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-22 02:52:46,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:52:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-22 02:52:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:52:46,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:52:46,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:52:46,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-22 02:52:46,376 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:52:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:52:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1390660131, now seen corresponding path program 1 times [2022-11-22 02:52:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:52:46,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560125758] [2022-11-22 02:52:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:52:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:52:47,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:47,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560125758] [2022-11-22 02:52:47,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560125758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:47,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695517429] [2022-11-22 02:52:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:47,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:52:47,607 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:52:47,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 02:52:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:47,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-22 02:52:47,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:52:47,910 INFO L350 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 [2022-11-22 02:52:48,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 02:52:48,155 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:52:48,155 INFO L350 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 [2022-11-22 02:52:48,253 INFO L350 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 [2022-11-22 02:52:48,325 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:52:48,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 02:52:48,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:52:48,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 02:52:48,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:48,615 INFO L350 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 [2022-11-22 02:52:48,757 INFO L350 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 23 treesize of output 11 [2022-11-22 02:52:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 02:52:48,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:52:49,126 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2353) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-22 02:52:49,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2353) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-22 02:52:49,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (<= (+ 1 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2352))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2353)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2022-11-22 02:52:49,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:49,157 INFO L350 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 38 treesize of output 31 [2022-11-22 02:52:49,161 INFO L350 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 252 treesize of output 216 [2022-11-22 02:52:49,167 INFO L350 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 212 treesize of output 204 [2022-11-22 02:52:49,171 INFO L350 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 204 treesize of output 188 [2022-11-22 02:52:49,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695517429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:49,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1274007423] [2022-11-22 02:52:49,455 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 02:52:49,455 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:52:49,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:52:49,456 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:52:49,456 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:52:49,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:52:49,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:52:49,483 INFO L350 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 [2022-11-22 02:52:49,488 INFO L350 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 [2022-11-22 02:52:49,492 INFO L350 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 [2022-11-22 02:52:49,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:49,500 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:49,505 INFO L350 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 [2022-11-22 02:52:49,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:49,513 INFO L350 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 27 treesize of output 11 [2022-11-22 02:52:49,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:49,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:49,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:49,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:49,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:49,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:49,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:49,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:49,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:52:49,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:52:49,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:49,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:49,786 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:52:49,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:49,799 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:52:49,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:49,814 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-22 02:52:49,951 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:49,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:49,959 INFO L350 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 25 treesize of output 13 [2022-11-22 02:52:49,969 INFO L350 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 19 treesize of output 11 [2022-11-22 02:52:50,095 INFO L350 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 [2022-11-22 02:52:50,108 INFO L350 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 [2022-11-22 02:52:50,119 INFO L350 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 [2022-11-22 02:52:50,226 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:50,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:50,250 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:50,330 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:50,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:52:50,352 INFO L350 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 19 treesize of output 1 [2022-11-22 02:52:51,083 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:52:51,211 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:52:59,390 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8503#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|)) (not (< |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |#StackHeapBarrier|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:52:59,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:52:59,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:52:59,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2022-11-22 02:52:59,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656969276] [2022-11-22 02:52:59,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:52:59,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:52:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:52:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:52:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=4379, Unknown=16, NotChecked=408, Total=5112 [2022-11-22 02:52:59,393 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:53:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:01,488 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-22 02:53:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 02:53:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2022-11-22 02:53:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:01,489 INFO L225 Difference]: With dead ends: 63 [2022-11-22 02:53:01,489 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 02:53:01,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=543, Invalid=6763, Unknown=16, NotChecked=510, Total=7832 [2022-11-22 02:53:01,491 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 302 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:01,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 155 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:53:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 02:53:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-11-22 02:53:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.18) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:53:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-11-22 02:53:01,494 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 45 [2022-11-22 02:53:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:01,495 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-11-22 02:53:01,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:53:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-11-22 02:53:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 02:53:01,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:01,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:01,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:01,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:53:01,702 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:53:01,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1693378177, now seen corresponding path program 1 times [2022-11-22 02:53:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:53:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100476490] [2022-11-22 02:53:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:53:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:53:02,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:53:02,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100476490] [2022-11-22 02:53:02,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100476490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:53:02,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759261891] [2022-11-22 02:53:02,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:02,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:53:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:53:02,475 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:53:02,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 02:53:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:02,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-22 02:53:02,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:02,769 INFO L350 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 [2022-11-22 02:53:02,823 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:53:02,824 INFO L350 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 [2022-11-22 02:53:02,842 INFO L350 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 [2022-11-22 02:53:02,891 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:53:02,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-22 02:53:03,011 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:53:03,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-22 02:53:03,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-22 02:53:03,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:03,141 INFO L350 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 16 treesize of output 16 [2022-11-22 02:53:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:53:03,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:53:03,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2466 (Array Int Int)) (v_ArrVal_2468 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2466) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_2468) 0)))) is different from false [2022-11-22 02:53:03,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2466 (Array Int Int)) (v_ArrVal_2468 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2466) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_2468) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-22 02:53:03,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2466 (Array Int Int)) (v_ArrVal_2468 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2466) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_2468) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-22 02:53:03,464 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2466 (Array Int Int)) (v_ArrVal_2465 (Array Int Int)) (v_ArrVal_2468 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2465))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2466)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_2468) 0)))) is different from false [2022-11-22 02:53:03,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:03,482 INFO L350 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 42 treesize of output 35 [2022-11-22 02:53:03,485 INFO L350 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 161 treesize of output 149 [2022-11-22 02:53:03,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:03,497 INFO L350 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 155 treesize of output 154 [2022-11-22 02:53:03,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:03,510 INFO L350 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 165 treesize of output 161 [2022-11-22 02:53:03,518 INFO L350 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 174 treesize of output 170 [2022-11-22 02:53:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2022-11-22 02:53:04,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759261891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:53:04,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [717622173] [2022-11-22 02:53:04,057 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-22 02:53:04,057 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:53:04,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:53:04,058 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:53:04,058 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:53:04,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:53:04,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:53:04,089 INFO L350 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 [2022-11-22 02:53:04,094 INFO L350 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 [2022-11-22 02:53:04,098 INFO L350 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 [2022-11-22 02:53:04,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:53:04,124 INFO L350 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 27 treesize of output 11 [2022-11-22 02:53:04,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:53:04,130 INFO L350 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 27 treesize of output 11 [2022-11-22 02:53:04,135 INFO L350 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 [2022-11-22 02:53:04,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:53:04,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:53:04,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:53:04,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:53:04,268 INFO L350 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 9 treesize of output 3 [2022-11-22 02:53:04,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-11-22 02:53:04,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-22 02:53:04,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:53:04,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:53:04,342 INFO L350 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 9 treesize of output 3 [2022-11-22 02:53:04,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:04,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:53:04,429 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-22 02:53:04,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:04,442 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-22 02:53:04,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:04,456 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-22 02:53:04,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:53:04,590 INFO L350 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 23 treesize of output 11 [2022-11-22 02:53:04,598 INFO L350 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 19 treesize of output 11 [2022-11-22 02:53:04,610 INFO L350 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 19 treesize of output 11 [2022-11-22 02:53:04,746 INFO L350 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 [2022-11-22 02:53:04,757 INFO L350 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 [2022-11-22 02:53:04,767 INFO L350 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 [2022-11-22 02:53:04,864 INFO L350 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 19 treesize of output 1 [2022-11-22 02:53:04,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:53:04,883 INFO L350 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 19 treesize of output 1 [2022-11-22 02:53:04,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:53:05,006 INFO L350 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 19 treesize of output 1 [2022-11-22 02:53:05,018 INFO L350 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 19 treesize of output 1 [2022-11-22 02:53:05,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-22 02:53:05,717 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-22 02:53:05,845 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:53:13,506 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9005#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< |ULTIMATE.start_sll_circular_destroy_~head#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:53:13,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:53:13,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:53:13,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 43 [2022-11-22 02:53:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669833391] [2022-11-22 02:53:13,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:53:13,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-22 02:53:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:53:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-22 02:53:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=4130, Unknown=5, NotChecked=532, Total=4970 [2022-11-22 02:53:13,509 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 43 states, 39 states have (on average 2.282051282051282) internal successors, (89), 37 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:53:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:14,838 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-11-22 02:53:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 02:53:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 2.282051282051282) internal successors, (89), 37 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-22 02:53:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:14,839 INFO L225 Difference]: With dead ends: 57 [2022-11-22 02:53:14,839 INFO L226 Difference]: Without dead ends: 57 [2022-11-22 02:53:14,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=454, Invalid=5877, Unknown=5, NotChecked=636, Total=6972 [2022-11-22 02:53:14,840 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 302 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:14,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 230 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 745 Invalid, 0 Unknown, 181 Unchecked, 0.6s Time] [2022-11-22 02:53:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-22 02:53:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-11-22 02:53:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:53:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-22 02:53:14,843 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 47 [2022-11-22 02:53:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:14,843 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-22 02:53:14,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 2.282051282051282) internal successors, (89), 37 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:53:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-22 02:53:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 02:53:14,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:14,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:14,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:15,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:53:15,052 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:53:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash -98416032, now seen corresponding path program 1 times [2022-11-22 02:53:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:53:15,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595026373] [2022-11-22 02:53:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:15,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:53:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:53:16,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:53:16,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595026373] [2022-11-22 02:53:16,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595026373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:53:16,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905641716] [2022-11-22 02:53:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:16,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:53:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:53:16,570 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:53:16,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 02:53:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:16,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-22 02:53:16,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:16,857 INFO L350 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 [2022-11-22 02:53:16,994 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:53:16,994 INFO L350 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 [2022-11-22 02:53:17,094 INFO L350 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 [2022-11-22 02:53:17,099 INFO L350 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 [2022-11-22 02:53:17,175 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:53:17,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-22 02:53:17,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-22 02:53:17,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:53:17,426 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 02:53:17,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-11-22 02:53:17,441 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-22 02:53:17,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-22 02:53:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:53:17,593 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 02:53:17,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-22 02:53:17,599 INFO L350 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 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 02:53:17,900 INFO L321 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-22 02:53:17,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-11-22 02:53:17,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:17,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-22 02:53:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:53:18,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:53:18,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (and (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select .cse0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| (select .cse1 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))) (or (= .cse2 |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) (and (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select .cse0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| (select .cse1 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0))))))))) is different from false [2022-11-22 02:53:24,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse1 (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2589 Int)) (let ((.cse3 (select (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) .cse3) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))) (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (let ((.cse4 (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) (select (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-22 02:53:42,093 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:53:42,367 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse1) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)) (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse7 v_ArrVal_2588)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse7 v_ArrVal_2587)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2589 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse9 v_ArrVal_2587)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse9 v_ArrVal_2588)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) .cse8) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))))))))) (not (<= .cse0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (select (store .cse10 |c_ULTIMATE.start_main_~s~0#1.base| .cse11) (select .cse11 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-11-22 02:54:36,289 WARN L233 SmtUtils]: Spent 14.24s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:54:37,427 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse8 (select .cse7 .cse3)) (.cse4 (select .cse2 .cse3)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse0 (store .cse2 .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))) (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)) (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (let ((.cse6 (select (store (select (store .cse2 .cse3 (store .cse4 .cse9 v_ArrVal_2587)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store .cse7 .cse3 (store .cse8 .cse9 v_ArrVal_2588)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2590) .cse6) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (let ((.cse10 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (select (store (store .cse7 .cse3 (store .cse8 .cse10 v_ArrVal_2588)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2590) (select (store (select (store .cse2 .cse3 (store .cse4 .cse10 v_ArrVal_2587)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse11 (store .cse2 .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse12) .cse13) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse13)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))))))) is different from false [2022-11-22 02:54:40,738 INFO L321 Elim1Store]: treesize reduction 288, result has 49.9 percent of original size [2022-11-22 02:54:40,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 1641 treesize of output 1846 [2022-11-22 02:54:58,568 WARN L233 SmtUtils]: Spent 17.77s on a formula simplification. DAG size of input: 536 DAG size of output: 319 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-22 02:54:58,569 INFO L321 Elim1Store]: treesize reduction 1691, result has 37.3 percent of original size [2022-11-22 02:54:58,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 13 new quantified variables, introduced 40 case distinctions, treesize of input 399257 treesize of output 139861 [2022-11-22 02:56:01,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 2022855 column 7: canceled [2022-11-22 02:56:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [292237085] [2022-11-22 02:56:01,364 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-22 02:56:01,364 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:56:01,364 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:56:01,365 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:56:01,365 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:56:03,376 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 2022857 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:56:03,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:56:03,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-11-22 02:56:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803765083] [2022-11-22 02:56:03,378 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-22 02:56:03,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 02:56:03,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:56:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 02:56:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1962, Unknown=68, NotChecked=372, Total=2550 [2022-11-22 02:56:03,380 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 23 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 02:56:05,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=148, Invalid=1962, Unknown=68, NotChecked=372, Total=2550 [2022-11-22 02:56:05,447 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:05,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:56:05,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:05,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:56:05,648 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 2022859 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.push(ManagedScript.java:124) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:366) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:56:05,650 INFO L158 Benchmark]: Toolchain (without parser) took 374083.35ms. Allocated memory was 186.6MB in the beginning and 14.8GB in the end (delta: 14.6GB). Free memory was 154.2MB in the beginning and 12.0GB in the end (delta: -11.8GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2022-11-22 02:56:05,651 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:56:05,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.48ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 136.6MB in the end (delta: 17.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 02:56:05,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.53ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 134.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:56:05,651 INFO L158 Benchmark]: Boogie Preprocessor took 66.61ms. Allocated memory is still 186.6MB. Free memory was 134.5MB in the beginning and 132.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:56:05,651 INFO L158 Benchmark]: RCFGBuilder took 731.94ms. Allocated memory is still 186.6MB. Free memory was 132.9MB in the beginning and 109.3MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 02:56:05,651 INFO L158 Benchmark]: TraceAbstraction took 372718.02ms. Allocated memory was 186.6MB in the beginning and 14.8GB in the end (delta: 14.6GB). Free memory was 108.8MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-11-22 02:56:05,652 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.48ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 136.6MB in the end (delta: 17.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.53ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 134.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.61ms. Allocated memory is still 186.6MB. Free memory was 134.5MB in the beginning and 132.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 731.94ms. Allocated memory is still 186.6MB. Free memory was 132.9MB in the beginning and 109.3MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 372718.02ms. Allocated memory was 186.6MB in the beginning and 14.8GB in the end (delta: 14.6GB). Free memory was 108.8MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 2022859 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 2022859 column 7: canceled: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-22 02:56:05,860 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-22 02:56:05,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:56:08,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:56:08,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:56:08,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:56:08,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:56:08,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:56:08,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:56:08,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:56:08,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:56:08,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:56:08,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:56:08,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:56:08,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:56:08,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:56:08,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:56:08,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:56:08,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:56:08,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:56:08,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:56:08,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:56:08,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:56:08,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:56:08,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:56:08,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:56:08,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:56:08,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:56:08,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:56:08,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:56:08,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:56:08,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:56:08,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:56:08,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:56:08,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:56:08,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:56:08,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:56:08,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:56:08,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:56:08,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:56:08,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:56:08,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:56:08,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:56:08,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 02:56:08,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:56:08,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:56:08,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:56:08,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:56:08,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:56:08,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:56:08,585 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:56:08,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:56:08,585 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:56:08,585 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:56:08,586 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:56:08,586 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:56:08,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:56:08,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:56:08,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:56:08,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:56:08,588 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:56:08,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:56:08,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:56:08,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:56:08,588 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:56:08,589 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:56:08,589 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:56:08,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:56:08,589 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:56:08,590 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 02:56:08,590 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 02:56:08,590 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:56:08,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:56:08,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:56:08,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 02:56:08,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:56:08,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:56:08,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:56:08,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:56:08,592 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 02:56:08,592 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:08,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:56:08,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 02:56:08,593 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/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_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-22 02:56:08,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:56:08,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:56:08,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:56:08,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:56:08,996 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:56:08,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-22 02:56:11,979 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:56:12,357 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:56:12,358 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-22 02:56:12,371 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data/be5c8b495/16276d20082b4651a0b37b979cb9ee2a/FLAG8d9da8600 [2022-11-22 02:56:12,392 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/data/be5c8b495/16276d20082b4651a0b37b979cb9ee2a [2022-11-22 02:56:12,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:56:12,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:56:12,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:56:12,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:56:12,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:56:12,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:12,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7054e091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12, skipping insertion in model container [2022-11-22 02:56:12,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:12,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:56:12,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:56:12,832 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-22 02:56:12,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:56:12,865 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:56:12,924 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-22 02:56:12,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:56:12,987 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:56:12,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12 WrapperNode [2022-11-22 02:56:12,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:56:12,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:56:12,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:56:12,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:56:12,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,055 INFO L138 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-11-22 02:56:13,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:56:13,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:56:13,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:56:13,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:56:13,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:56:13,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:56:13,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:56:13,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:56:13,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (1/1) ... [2022-11-22 02:56:13,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:56:13,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:56:13,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:56:13,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:56:13,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-22 02:56:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-22 02:56:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-22 02:56:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:56:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:56:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:56:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:56:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:56:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 02:56:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 02:56:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:56:13,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:56:13,460 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:56:13,462 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:56:14,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:56:14,019 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:56:14,019 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 02:56:14,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:56:14 BoogieIcfgContainer [2022-11-22 02:56:14,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:56:14,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:56:14,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:56:14,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:56:14,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:56:12" (1/3) ... [2022-11-22 02:56:14,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58734451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:56:14, skipping insertion in model container [2022-11-22 02:56:14,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:56:12" (2/3) ... [2022-11-22 02:56:14,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58734451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:56:14, skipping insertion in model container [2022-11-22 02:56:14,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:56:14" (3/3) ... [2022-11-22 02:56:14,032 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-22 02:56:14,053 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:56:14,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-22 02:56:14,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:56:14,105 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;@366bac33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:56:14,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-22 02:56:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:56:14,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:14,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:56:14,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-11-22 02:56:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:14,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391010837] [2022-11-22 02:56:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:14,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:14,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:14,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-22 02:56:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:14,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:56:14,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:14,386 INFO L350 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 7 [2022-11-22 02:56:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:14,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:14,404 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:14,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391010837] [2022-11-22 02:56:14,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391010837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:14,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:14,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:56:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361294691] [2022-11-22 02:56:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:14,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:56:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:56:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:56:14,459 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:56:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:14,632 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-11-22 02:56:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:56:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 02:56:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:14,644 INFO L225 Difference]: With dead ends: 81 [2022-11-22 02:56:14,644 INFO L226 Difference]: Without dead ends: 78 [2022-11-22 02:56:14,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:56:14,650 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:14,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:56:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-22 02:56:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-22 02:56:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-11-22 02:56:14,694 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-11-22 02:56:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:14,694 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-11-22 02:56:14,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:56:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-11-22 02:56:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:56:14,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:14,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:56:14,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:14,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:14,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-11-22 02:56:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:14,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924609200] [2022-11-22 02:56:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:14,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:14,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:14,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-22 02:56:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:14,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:56:14,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:14,995 INFO L350 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 [2022-11-22 02:56:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:15,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:15,020 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:15,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924609200] [2022-11-22 02:56:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924609200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:15,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:15,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:56:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70755249] [2022-11-22 02:56:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:15,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:56:15,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:56:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:56:15,024 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:56:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:15,170 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-22 02:56:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:56:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 02:56:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:15,176 INFO L225 Difference]: With dead ends: 76 [2022-11-22 02:56:15,177 INFO L226 Difference]: Without dead ends: 76 [2022-11-22 02:56:15,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:56:15,178 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:15,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:56:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-22 02:56:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-22 02:56:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-22 02:56:15,196 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-11-22 02:56:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:15,197 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-22 02:56:15,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:56:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-22 02:56:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:56:15,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:15,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:15,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-22 02:56:15,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:15,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:15,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-11-22 02:56:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:15,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243541611] [2022-11-22 02:56:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:15,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:15,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-22 02:56:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:15,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:56:15,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:15,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:15,578 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243541611] [2022-11-22 02:56:15,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243541611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:15,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:15,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:56:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242758318] [2022-11-22 02:56:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:15,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:56:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:56:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:56:15,581 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:56:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:15,603 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-22 02:56:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:56:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-22 02:56:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:15,613 INFO L225 Difference]: With dead ends: 83 [2022-11-22 02:56:15,615 INFO L226 Difference]: Without dead ends: 83 [2022-11-22 02:56:15,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:56:15,616 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:15,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:56:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-22 02:56:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-22 02:56:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-11-22 02:56:15,635 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-11-22 02:56:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:15,635 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-11-22 02:56:15,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:56:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-11-22 02:56:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:56:15,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:15,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:15,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:15,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:15,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-11-22 02:56:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:15,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044884250] [2022-11-22 02:56:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:15,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:15,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:15,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:15,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-22 02:56:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:15,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:56:15,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:15,993 INFO L350 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 7 [2022-11-22 02:56:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:56:16,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:16,050 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:16,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044884250] [2022-11-22 02:56:16,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044884250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:16,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:16,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:56:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010685935] [2022-11-22 02:56:16,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:16,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:56:16,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:16,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:56:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:56:16,053 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:16,420 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-22 02:56:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:56:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-22 02:56:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:16,424 INFO L225 Difference]: With dead ends: 97 [2022-11-22 02:56:16,424 INFO L226 Difference]: Without dead ends: 97 [2022-11-22 02:56:16,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:56:16,425 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:16,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:56:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-22 02:56:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-22 02:56:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-22 02:56:16,444 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-11-22 02:56:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:16,446 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-22 02:56:16,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-22 02:56:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:56:16,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:16,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:16,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:16,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:16,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:16,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-11-22 02:56:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:16,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052300193] [2022-11-22 02:56:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:16,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:16,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:16,665 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:16,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-22 02:56:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:16,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 02:56:16,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:16,832 INFO L350 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 [2022-11-22 02:56:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:56:16,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:16,981 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052300193] [2022-11-22 02:56:16,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052300193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:16,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:16,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:56:16,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108503154] [2022-11-22 02:56:16,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:16,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:56:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:56:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:56:16,986 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:17,309 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-22 02:56:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:56:17,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-22 02:56:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:17,311 INFO L225 Difference]: With dead ends: 76 [2022-11-22 02:56:17,311 INFO L226 Difference]: Without dead ends: 76 [2022-11-22 02:56:17,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:56:17,312 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:17,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:56:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-22 02:56:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-22 02:56:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-22 02:56:17,319 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-11-22 02:56:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:17,319 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-22 02:56:17,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-22 02:56:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:56:17,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:17,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:17,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:17,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:17,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-11-22 02:56:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:17,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958470656] [2022-11-22 02:56:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:17,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:17,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-22 02:56:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:17,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 02:56:17,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:17,710 INFO L350 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 7 [2022-11-22 02:56:17,802 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_114) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-22 02:56:17,928 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:56:17,929 INFO L350 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 27 [2022-11-22 02:56:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-22 02:56:17,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:56:18,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:18,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958470656] [2022-11-22 02:56:18,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958470656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:56:18,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [844205815] [2022-11-22 02:56:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:18,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:18,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:56:18,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:56:18,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-22 02:56:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:18,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-22 02:56:18,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:18,585 INFO L350 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 7 [2022-11-22 02:56:18,697 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:56:18,698 INFO L350 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 20 [2022-11-22 02:56:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:56:18,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:18,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [844205815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:18,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:56:18,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 6] total 11 [2022-11-22 02:56:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638791448] [2022-11-22 02:56:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:56:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:18,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:56:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2022-11-22 02:56:18,758 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:19,190 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-22 02:56:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:56:19,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-22 02:56:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:19,192 INFO L225 Difference]: With dead ends: 94 [2022-11-22 02:56:19,192 INFO L226 Difference]: Without dead ends: 94 [2022-11-22 02:56:19,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2022-11-22 02:56:19,193 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 64 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:19,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 304 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:56:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-22 02:56:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-11-22 02:56:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-22 02:56:19,199 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-11-22 02:56:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:19,200 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-22 02:56:19,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:56:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-22 02:56:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:56:19,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:19,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:19,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:19,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:19,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:19,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-11-22 02:56:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950472029] [2022-11-22 02:56:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:19,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:19,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:19,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-22 02:56:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:19,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:56:19,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:19,794 INFO L350 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 [2022-11-22 02:56:19,800 INFO L350 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 7 [2022-11-22 02:56:19,987 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_191) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-22 02:56:20,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:20,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-22 02:56:20,073 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:20,074 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-22 02:56:20,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:20,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:20,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950472029] [2022-11-22 02:56:20,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950472029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:20,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [709893177] [2022-11-22 02:56:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:20,452 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:56:20,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:56:20,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-22 02:56:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:20,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:56:20,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:20,729 INFO L350 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 7 [2022-11-22 02:56:20,736 INFO L350 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 [2022-11-22 02:56:20,876 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_231 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_231))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-22 02:56:20,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:20,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-22 02:56:20,962 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:20,962 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-22 02:56:20,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:21,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [709893177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013199102] [2022-11-22 02:56:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:21,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:56:21,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:56:21,215 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:56:21,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:56:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:21,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 02:56:21,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:21,350 INFO L350 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 [2022-11-22 02:56:21,491 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_270 (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_270) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-22 02:56:21,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:21,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-22 02:56:21,567 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:21,567 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-22 02:56:21,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:21,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013199102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:21,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:56:21,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2022-11-22 02:56:21,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107407443] [2022-11-22 02:56:21,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:56:21,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 02:56:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 02:56:21,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=89, Unknown=3, NotChecked=60, Total=182 [2022-11-22 02:56:21,827 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:56:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:22,755 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-11-22 02:56:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:56:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-22 02:56:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:22,757 INFO L225 Difference]: With dead ends: 156 [2022-11-22 02:56:22,757 INFO L226 Difference]: Without dead ends: 156 [2022-11-22 02:56:22,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2022-11-22 02:56:22,758 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 86 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:22,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 358 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 495 Unchecked, 0.7s Time] [2022-11-22 02:56:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-22 02:56:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 80. [2022-11-22 02:56:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:56:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-22 02:56:22,764 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 25 [2022-11-22 02:56:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:22,764 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-22 02:56:22,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:56:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-22 02:56:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:56:22,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:22,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:22,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-11-22 02:56:22,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:23,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:23,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:56:23,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-11-22 02:56:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:23,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953849280] [2022-11-22 02:56:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:23,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:23,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:23,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:23,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-22 02:56:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:23,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:56:23,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:56:23,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:23,579 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:23,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953849280] [2022-11-22 02:56:23,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953849280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:23,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:23,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:56:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097858220] [2022-11-22 02:56:23,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:23,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:56:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:56:23,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:56:23,581 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:23,650 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-11-22 02:56:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:56:23,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-22 02:56:23,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:23,652 INFO L225 Difference]: With dead ends: 111 [2022-11-22 02:56:23,652 INFO L226 Difference]: Without dead ends: 111 [2022-11-22 02:56:23,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:56:23,653 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 128 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 223 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:23,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 223 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:56:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-22 02:56:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2022-11-22 02:56:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 78 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:56:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2022-11-22 02:56:23,659 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 30 [2022-11-22 02:56:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:23,660 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2022-11-22 02:56:23,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2022-11-22 02:56:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:56:23,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:23,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:23,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:23,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:23,881 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:23,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-11-22 02:56:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:23,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673300434] [2022-11-22 02:56:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:23,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:23,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:23,884 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:23,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-22 02:56:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:24,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:56:24,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:24,062 INFO L350 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 [2022-11-22 02:56:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:56:24,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:24,282 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:24,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673300434] [2022-11-22 02:56:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673300434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:24,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:24,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:56:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423914208] [2022-11-22 02:56:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:56:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:56:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:56:24,283 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:25,141 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-11-22 02:56:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:56:25,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-22 02:56:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:25,143 INFO L225 Difference]: With dead ends: 135 [2022-11-22 02:56:25,143 INFO L226 Difference]: Without dead ends: 135 [2022-11-22 02:56:25,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:56:25,144 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 315 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:25,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 430 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:56:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-22 02:56:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 86. [2022-11-22 02:56:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 81 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:56:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-11-22 02:56:25,149 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 30 [2022-11-22 02:56:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:25,149 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-11-22 02:56:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-11-22 02:56:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:56:25,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:25,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:25,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:25,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866880, now seen corresponding path program 1 times [2022-11-22 02:56:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:25,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654141592] [2022-11-22 02:56:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:25,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:25,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:25,357 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:25,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-22 02:56:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:25,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 02:56:25,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:25,537 INFO L350 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 7 [2022-11-22 02:56:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:56:25,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:56:25,680 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:25,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654141592] [2022-11-22 02:56:25,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654141592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:56:25,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:56:25,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:56:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107929629] [2022-11-22 02:56:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:56:25,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:56:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:56:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:56:25,682 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:26,323 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-11-22 02:56:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:56:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-22 02:56:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:26,325 INFO L225 Difference]: With dead ends: 106 [2022-11-22 02:56:26,325 INFO L226 Difference]: Without dead ends: 106 [2022-11-22 02:56:26,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:56:26,326 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 294 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:26,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 293 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:56:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-22 02:56:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2022-11-22 02:56:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:56:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-22 02:56:26,332 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 30 [2022-11-22 02:56:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:26,332 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-22 02:56:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:56:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-22 02:56:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:56:26,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:26,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:26,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:26,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:26,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:26,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-11-22 02:56:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:26,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958675081] [2022-11-22 02:56:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:26,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:26,537 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:26,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-22 02:56:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:26,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-22 02:56:26,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:26,771 INFO L350 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 7 [2022-11-22 02:56:26,895 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:26,895 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:26,955 INFO L350 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 [2022-11-22 02:56:27,075 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:56:27,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:56:27,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:56:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:27,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:27,586 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2022-11-22 02:56:27,586 INFO L350 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 23 treesize of output 22 [2022-11-22 02:56:27,593 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-22 02:56:27,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-22 02:56:27,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:27,622 INFO L350 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 18 treesize of output 19 [2022-11-22 02:56:27,632 INFO L350 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 30 treesize of output 22 [2022-11-22 02:56:27,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 02:56:27,786 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:27,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958675081] [2022-11-22 02:56:27,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958675081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:27,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1597707920] [2022-11-22 02:56:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:27,787 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:27,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:56:27,791 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:56:27,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-22 02:56:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:28,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:56:28,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:28,094 INFO L350 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 7 [2022-11-22 02:56:28,345 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:56:28,345 INFO L350 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 27 [2022-11-22 02:56:28,517 INFO L350 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 [2022-11-22 02:56:28,744 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:56:28,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:56:29,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:56:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:29,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:31,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-22 02:56:31,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:31,498 INFO L350 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 [2022-11-22 02:56:31,503 INFO L350 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 38 treesize of output 30 [2022-11-22 02:56:31,511 INFO L350 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 9 treesize of output 7 [2022-11-22 02:56:44,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1597707920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590215220] [2022-11-22 02:56:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:44,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:56:44,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:56:44,656 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:56:44,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 02:56:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:44,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-22 02:56:44,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:44,894 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:44,895 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:44,916 INFO L350 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 [2022-11-22 02:56:44,964 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:56:44,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:56:45,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:56:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:45,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:45,070 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2022-11-22 02:56:45,071 INFO L350 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 23 treesize of output 22 [2022-11-22 02:56:45,080 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_528) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-22 02:56:45,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590215220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:45,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:56:45,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2022-11-22 02:56:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987937162] [2022-11-22 02:56:45,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:56:45,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:56:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:56:45,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1439, Unknown=12, NotChecked=316, Total=1892 [2022-11-22 02:56:45,327 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:56:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:48,845 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2022-11-22 02:56:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 02:56:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-11-22 02:56:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:48,847 INFO L225 Difference]: With dead ends: 172 [2022-11-22 02:56:48,847 INFO L226 Difference]: Without dead ends: 172 [2022-11-22 02:56:48,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=271, Invalid=1989, Unknown=12, NotChecked=380, Total=2652 [2022-11-22 02:56:48,849 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 242 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:48,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1023 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-22 02:56:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-22 02:56:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 95. [2022-11-22 02:56:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.457142857142857) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:56:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-22 02:56:48,854 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 33 [2022-11-22 02:56:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:48,854 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-22 02:56:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:56:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-22 02:56:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:56:48,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:48,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:48,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:49,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:49,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:49,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:49,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:56:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-11-22 02:56:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044791918] [2022-11-22 02:56:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:49,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:49,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:49,467 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:49,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-22 02:56:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:49,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-22 02:56:49,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:49,703 INFO L350 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 7 [2022-11-22 02:56:49,712 INFO L350 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 [2022-11-22 02:56:50,084 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:50,085 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:50,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-22 02:56:50,219 INFO L350 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 [2022-11-22 02:56:50,235 INFO L350 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 [2022-11-22 02:56:50,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:56:50,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:56:50,433 INFO L350 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 20 [2022-11-22 02:56:50,775 INFO L350 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 15 treesize of output 7 [2022-11-22 02:56:50,779 INFO L350 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 25 treesize of output 13 [2022-11-22 02:56:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:50,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:52,025 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2022-11-22 02:56:52,085 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2022-11-22 02:56:52,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:52,109 INFO L350 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 37 treesize of output 30 [2022-11-22 02:56:52,114 INFO L350 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 44 treesize of output 32 [2022-11-22 02:56:52,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:52,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-22 02:56:52,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:52,169 INFO L350 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 29 treesize of output 30 [2022-11-22 02:56:52,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:52,179 INFO L350 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 27 treesize of output 19 [2022-11-22 02:56:52,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:52,189 INFO L350 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 20 treesize of output 12 [2022-11-22 02:56:52,963 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044791918] [2022-11-22 02:56:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044791918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1982071649] [2022-11-22 02:56:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:52,964 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:52,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:56:52,966 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:56:52,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-22 02:56:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:53,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 02:56:53,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:53,301 INFO L350 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 7 [2022-11-22 02:56:53,309 INFO L350 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 [2022-11-22 02:56:53,789 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:56:53,789 INFO L350 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 18 [2022-11-22 02:56:53,820 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:53,820 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:54,090 INFO L350 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 [2022-11-22 02:56:54,101 INFO L350 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 [2022-11-22 02:56:54,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:56:54,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:56:54,456 INFO L350 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 20 [2022-11-22 02:56:55,029 INFO L350 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 15 treesize of output 7 [2022-11-22 02:56:55,032 INFO L350 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 25 treesize of output 13 [2022-11-22 02:56:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:55,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:55,196 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-22 02:56:55,256 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-22 02:56:55,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:55,275 INFO L350 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 37 treesize of output 38 [2022-11-22 02:56:55,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:55,290 INFO L350 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 29 treesize of output 30 [2022-11-22 02:56:55,299 INFO L350 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 52 treesize of output 44 [2022-11-22 02:56:55,304 INFO L350 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 82 treesize of output 70 [2022-11-22 02:56:55,316 INFO L350 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 66 treesize of output 62 [2022-11-22 02:56:55,327 INFO L350 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 32 treesize of output 28 [2022-11-22 02:56:55,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:55,523 INFO L350 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 37 treesize of output 30 [2022-11-22 02:56:55,534 INFO L350 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 44 treesize of output 32 [2022-11-22 02:56:55,557 INFO L350 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 11 treesize of output 7 [2022-11-22 02:56:56,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1982071649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:56,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306680207] [2022-11-22 02:56:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:56,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:56:56,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:56:56,003 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:56:56,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 02:56:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:56,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-22 02:56:56,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:56,197 INFO L350 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 7 [2022-11-22 02:56:56,204 INFO L350 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 [2022-11-22 02:56:56,423 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:56:56,424 INFO L350 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 18 [2022-11-22 02:56:56,458 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:56:56,458 INFO L350 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 13 treesize of output 13 [2022-11-22 02:56:56,490 INFO L350 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 [2022-11-22 02:56:56,513 INFO L350 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 [2022-11-22 02:56:56,588 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:56:56,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:56:56,597 INFO L350 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 20 [2022-11-22 02:56:56,668 INFO L350 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 15 treesize of output 7 [2022-11-22 02:56:56,672 INFO L350 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 25 treesize of output 13 [2022-11-22 02:56:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:56,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:56,859 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-22 02:56:56,919 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-22 02:56:56,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:56,937 INFO L350 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 37 treesize of output 30 [2022-11-22 02:56:56,940 INFO L350 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 44 treesize of output 32 [2022-11-22 02:56:56,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:56,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-22 02:56:56,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:56,995 INFO L350 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 29 treesize of output 30 [2022-11-22 02:56:57,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:57,006 INFO L350 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 27 treesize of output 19 [2022-11-22 02:56:57,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:57,018 INFO L350 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 20 treesize of output 12 [2022-11-22 02:56:57,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306680207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:57,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:56:57,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2022-11-22 02:56:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928456405] [2022-11-22 02:56:57,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:56:57,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 02:56:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 02:56:57,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1309, Unknown=6, NotChecked=462, Total=1892 [2022-11-22 02:56:57,359 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:57:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:02,266 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2022-11-22 02:57:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 02:57:02,267 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-11-22 02:57:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:02,268 INFO L225 Difference]: With dead ends: 206 [2022-11-22 02:57:02,268 INFO L226 Difference]: Without dead ends: 206 [2022-11-22 02:57:02,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=240, Invalid=1940, Unknown=6, NotChecked=570, Total=2756 [2022-11-22 02:57:02,270 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 910 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 24 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:02,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1533 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1064 Invalid, 30 Unknown, 0 Unchecked, 3.4s Time] [2022-11-22 02:57:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-22 02:57:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 103. [2022-11-22 02:57:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:57:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2022-11-22 02:57:02,276 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 33 [2022-11-22 02:57:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:02,276 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2022-11-22 02:57:02,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:57:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2022-11-22 02:57:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:57:02,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:02,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:02,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:02,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:02,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:02,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:02,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-11-22 02:57:02,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:02,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512783304] [2022-11-22 02:57:02,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:02,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:02,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:02,899 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:02,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-22 02:57:03,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:57:03,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:03,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:03,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:57:03,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:57:03,285 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:03,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512783304] [2022-11-22 02:57:03,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512783304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:03,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1026091393] [2022-11-22 02:57:03,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:03,286 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:03,287 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:03,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-22 02:57:03,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:57:03,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:03,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:03,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:57:03,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:57:03,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1026091393] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:03,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522679685] [2022-11-22 02:57:03,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:03,753 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:03,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-22 02:57:04,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:57:04,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:04,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:57:04,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:57:04,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:57:04,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522679685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:04,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:57:04,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2022-11-22 02:57:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52775451] [2022-11-22 02:57:04,571 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:57:04,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 02:57:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:04,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 02:57:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:57:04,573 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:05,992 INFO L93 Difference]: Finished difference Result 468 states and 523 transitions. [2022-11-22 02:57:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-22 02:57:05,993 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2022-11-22 02:57:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:05,995 INFO L225 Difference]: With dead ends: 468 [2022-11-22 02:57:05,996 INFO L226 Difference]: Without dead ends: 468 [2022-11-22 02:57:05,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-11-22 02:57:05,997 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1541 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:05,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 671 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:57:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-22 02:57:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 144. [2022-11-22 02:57:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 139 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 02:57:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2022-11-22 02:57:06,006 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 36 [2022-11-22 02:57:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:06,006 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2022-11-22 02:57:06,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2022-11-22 02:57:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 02:57:06,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:06,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:06,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:06,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:06,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:06,621 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2022-11-22 02:57:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:06,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273662272] [2022-11-22 02:57:06,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:06,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:06,623 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:06,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-22 02:57:06,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:57:06,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:06,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:57:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:57:06,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 02:57:06,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273662272] [2022-11-22 02:57:06,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273662272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1664335756] [2022-11-22 02:57:06,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:06,937 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:06,939 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:06,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-22 02:57:07,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:57:07,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:07,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:57:07,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:57:07,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 02:57:07,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1664335756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:07,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904518721] [2022-11-22 02:57:07,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:07,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:07,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:07,324 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:07,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-22 02:57:07,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:57:07,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:07,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:57:07,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 02:57:07,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 02:57:07,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904518721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:07,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:57:07,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-22 02:57:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784609374] [2022-11-22 02:57:07,628 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:57:07,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:57:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:07,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:57:07,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:57:07,630 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:07,652 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2022-11-22 02:57:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:57:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-22 02:57:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:07,654 INFO L225 Difference]: With dead ends: 112 [2022-11-22 02:57:07,654 INFO L226 Difference]: Without dead ends: 112 [2022-11-22 02:57:07,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:57:07,655 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:07,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 170 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:57:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-22 02:57:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-22 02:57:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 108 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:57:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2022-11-22 02:57:07,660 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 37 [2022-11-22 02:57:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:07,661 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2022-11-22 02:57:07,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2022-11-22 02:57:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:57:07,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:07,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:07,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:07,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:08,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:08,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:08,266 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-11-22 02:57:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865156340] [2022-11-22 02:57:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:08,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:08,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:08,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-22 02:57:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:08,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:57:08,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:08,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:08,649 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:08,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865156340] [2022-11-22 02:57:08,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865156340] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:08,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [588810754] [2022-11-22 02:57:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:08,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:08,650 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:08,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-22 02:57:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:08,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:57:08,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:08,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:09,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [588810754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:09,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286054596] [2022-11-22 02:57:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:09,076 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:09,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-22 02:57:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:09,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 02:57:09,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 02:57:09,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:57:09,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286054596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:57:09,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-11-22 02:57:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5, 5, 5] total 16 [2022-11-22 02:57:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769766011] [2022-11-22 02:57:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:57:09,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:57:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:57:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:57:09,560 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:57:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:10,342 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2022-11-22 02:57:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:57:10,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-11-22 02:57:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:10,343 INFO L225 Difference]: With dead ends: 137 [2022-11-22 02:57:10,343 INFO L226 Difference]: Without dead ends: 137 [2022-11-22 02:57:10,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-11-22 02:57:10,344 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 286 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:10,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 274 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:57:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-22 02:57:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2022-11-22 02:57:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 111 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:57:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2022-11-22 02:57:10,349 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 40 [2022-11-22 02:57:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:10,349 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2022-11-22 02:57:10,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:57:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2022-11-22 02:57:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:57:10,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:10,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:10,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:10,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:10,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:10,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:10,963 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:10,964 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-11-22 02:57:10,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:10,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459747064] [2022-11-22 02:57:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:10,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:10,965 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:10,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-22 02:57:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:11,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:57:11,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:11,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:11,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459747064] [2022-11-22 02:57:11,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459747064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [689389441] [2022-11-22 02:57:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:11,363 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:11,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-11-22 02:57:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:11,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:57:11,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:11,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:11,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [689389441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:11,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003245553] [2022-11-22 02:57:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:11,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:11,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:11,832 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:11,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-22 02:57:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:12,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:57:12,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:12,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:12,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003245553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:12,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:57:12,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2022-11-22 02:57:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628438541] [2022-11-22 02:57:12,328 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:57:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:57:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:57:12,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:57:12,330 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:12,518 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-11-22 02:57:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:57:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2022-11-22 02:57:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:12,520 INFO L225 Difference]: With dead ends: 186 [2022-11-22 02:57:12,520 INFO L226 Difference]: Without dead ends: 186 [2022-11-22 02:57:12,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:57:12,521 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 296 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:12,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 439 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:57:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-22 02:57:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2022-11-22 02:57:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 159 states have internal predecessors, (214), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:57:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 218 transitions. [2022-11-22 02:57:12,547 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 218 transitions. Word has length 40 [2022-11-22 02:57:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:12,548 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 218 transitions. [2022-11-22 02:57:12,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 218 transitions. [2022-11-22 02:57:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:57:12,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:12,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:12,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:12,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:12,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:13,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:13,165 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-11-22 02:57:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:13,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931314638] [2022-11-22 02:57:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:13,168 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:13,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-22 02:57:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:13,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:13,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:13,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:13,645 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931314638] [2022-11-22 02:57:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931314638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1170756446] [2022-11-22 02:57:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:13,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:13,647 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:13,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-22 02:57:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:13,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:13,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:14,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:14,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1170756446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:14,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048379354] [2022-11-22 02:57:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:14,138 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:14,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-22 02:57:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:14,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:57:14,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:14,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 02:57:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048379354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:14,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:57:14,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2022-11-22 02:57:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341983251] [2022-11-22 02:57:14,892 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:57:14,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 02:57:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 02:57:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:57:14,893 INFO L87 Difference]: Start difference. First operand 163 states and 218 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:15,167 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-11-22 02:57:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:57:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-11-22 02:57:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:15,169 INFO L225 Difference]: With dead ends: 132 [2022-11-22 02:57:15,169 INFO L226 Difference]: Without dead ends: 132 [2022-11-22 02:57:15,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-11-22 02:57:15,170 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 559 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:15,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 413 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:57:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-22 02:57:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-11-22 02:57:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.485981308411215) internal successors, (159), 122 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:57:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2022-11-22 02:57:15,175 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 41 [2022-11-22 02:57:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:15,175 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2022-11-22 02:57:15,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:57:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2022-11-22 02:57:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:57:15,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:15,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:15,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:15,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2022-11-22 02:57:15,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:15,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:15,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-11-22 02:57:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:15,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836934229] [2022-11-22 02:57:15,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:57:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:15,786 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:15,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-22 02:57:15,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 02:57:15,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:57:15,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:57:15,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:15,980 INFO L350 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 [2022-11-22 02:57:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 02:57:16,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:57:16,327 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836934229] [2022-11-22 02:57:16,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836934229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:57:16,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:57:16,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:57:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506586231] [2022-11-22 02:57:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:57:16,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:57:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:57:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:57:16,330 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:57:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:17,077 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-11-22 02:57:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:57:17,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-22 02:57:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:17,079 INFO L225 Difference]: With dead ends: 178 [2022-11-22 02:57:17,079 INFO L226 Difference]: Without dead ends: 178 [2022-11-22 02:57:17,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:57:17,080 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 409 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:17,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 259 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:57:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-22 02:57:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2022-11-22 02:57:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.411214953271028) internal successors, (151), 122 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:57:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2022-11-22 02:57:17,085 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 45 [2022-11-22 02:57:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:17,086 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2022-11-22 02:57:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 02:57:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2022-11-22 02:57:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 02:57:17,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:17,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:17,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:17,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:17,299 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-11-22 02:57:17,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810282291] [2022-11-22 02:57:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:17,301 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:17,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-22 02:57:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:17,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:17,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:57:17,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:57:17,871 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:17,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810282291] [2022-11-22 02:57:17,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810282291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:17,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1860399990] [2022-11-22 02:57:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:17,872 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:17,873 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:17,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-22 02:57:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:18,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:18,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:57:18,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:57:18,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1860399990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:18,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851621996] [2022-11-22 02:57:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:18,457 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:18,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-22 02:57:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:18,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:57:18,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:57:18,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:57:18,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851621996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:57:18,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:57:18,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-22 02:57:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070128416] [2022-11-22 02:57:18,873 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:57:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:57:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:57:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:57:18,875 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:57:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:57:19,280 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2022-11-22 02:57:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:57:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-22 02:57:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:57:19,285 INFO L225 Difference]: With dead ends: 190 [2022-11-22 02:57:19,285 INFO L226 Difference]: Without dead ends: 190 [2022-11-22 02:57:19,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-22 02:57:19,286 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 429 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:57:19,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 438 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:57:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-22 02:57:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 123. [2022-11-22 02:57:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 119 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:57:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2022-11-22 02:57:19,291 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 48 [2022-11-22 02:57:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:57:19,291 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2022-11-22 02:57:19,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:57:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2022-11-22 02:57:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 02:57:19,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:57:19,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:57:19,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-22 02:57:19,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-11-22 02:57:19,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-11-22 02:57:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:19,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:57:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:57:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-11-22 02:57:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:57:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020145802] [2022-11-22 02:57:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:57:19,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:57:19,900 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:57:19,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-22 02:57:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:20,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-22 02:57:20,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:20,215 INFO L350 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 7 [2022-11-22 02:57:20,390 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:57:20,390 INFO L350 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 13 treesize of output 13 [2022-11-22 02:57:20,479 INFO L350 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 [2022-11-22 02:57:20,614 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:57:20,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:57:21,119 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:57:21,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:57:21,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:57:21,210 INFO L350 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 28 [2022-11-22 02:57:21,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:57:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:57:21,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:23,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-22 02:57:23,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-22 02:57:23,870 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-22 02:57:23,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-22 02:57:23,903 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2022-11-22 02:57:23,917 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-22 02:57:23,943 INFO L321 Elim1Store]: treesize reduction 7, result has 74.1 percent of original size [2022-11-22 02:57:23,944 INFO L350 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 33 treesize of output 32 [2022-11-22 02:57:23,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1645))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-11-22 02:57:23,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1645))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-22 02:57:23,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:57:23,989 INFO L350 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 36 treesize of output 29 [2022-11-22 02:57:23,994 INFO L350 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 136 treesize of output 112 [2022-11-22 02:57:24,000 INFO L350 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 108 treesize of output 98 [2022-11-22 02:57:24,004 INFO L350 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 98 treesize of output 94 [2022-11-22 02:57:24,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:57:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020145802] [2022-11-22 02:57:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020145802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:57:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1104077456] [2022-11-22 02:57:24,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:24,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:57:24,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:57:24,430 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:57:24,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-22 02:57:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:24,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 02:57:24,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:24,934 INFO L350 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 7 [2022-11-22 02:57:25,288 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:57:25,289 INFO L350 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 27 [2022-11-22 02:57:25,548 INFO L350 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 [2022-11-22 02:57:25,886 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:57:25,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:57:26,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:57:26,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:57:26,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:57:26,995 INFO L350 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 28 [2022-11-22 02:57:27,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:57:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:57:27,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:32,057 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-22 02:57:36,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1706) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2022-11-22 02:57:36,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1706) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-22 02:57:36,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1705))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1706)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-22 02:57:36,660 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1705))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1706)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-22 02:57:36,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:57:36,677 INFO L350 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 40 treesize of output 33 [2022-11-22 02:57:36,683 INFO L350 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 152 treesize of output 128 [2022-11-22 02:57:36,691 INFO L350 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 124 treesize of output 114 [2022-11-22 02:57:36,697 INFO L350 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 114 treesize of output 110 [2022-11-22 02:57:48,623 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 38 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:57:48,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1104077456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:57:48,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915060874] [2022-11-22 02:57:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:57:48,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:57:48,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:57:48,626 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:57:48,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-22 02:57:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:57:48,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 02:57:48,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:57:48,857 INFO L350 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 7 [2022-11-22 02:57:49,180 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:57:49,180 INFO L350 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 13 treesize of output 13 [2022-11-22 02:57:49,284 INFO L350 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 [2022-11-22 02:57:49,625 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:57:49,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:57:52,757 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:57:52,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-22 02:57:52,839 INFO L350 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 0 case distinctions, treesize of input 33 treesize of output 28 [2022-11-22 02:57:53,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:57:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:57:53,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:57:57,645 INFO L321 Elim1Store]: treesize reduction 7, result has 74.1 percent of original size [2022-11-22 02:57:57,645 INFO L350 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 33 treesize of output 32 [2022-11-22 02:57:57,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1765))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1706)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-22 02:57:57,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1765))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1706)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-22 02:57:57,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:57:57,713 INFO L350 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 36 treesize of output 29 [2022-11-22 02:57:57,725 INFO L350 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 236 treesize of output 200 [2022-11-22 02:57:57,746 INFO L350 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 196 treesize of output 180 [2022-11-22 02:57:57,752 INFO L350 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 180 treesize of output 172 [2022-11-22 02:57:58,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915060874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:57:58,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:57:58,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2022-11-22 02:57:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503177167] [2022-11-22 02:57:58,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:57:58,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-22 02:57:58,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:57:58,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-22 02:57:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3292, Unknown=43, NotChecked=1950, Total=5550 [2022-11-22 02:57:58,154 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 50 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 45 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:58:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:58:03,572 INFO L93 Difference]: Finished difference Result 196 states and 225 transitions. [2022-11-22 02:58:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 02:58:03,573 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 45 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-22 02:58:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:58:03,574 INFO L225 Difference]: With dead ends: 196 [2022-11-22 02:58:03,574 INFO L226 Difference]: Without dead ends: 196 [2022-11-22 02:58:03,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=480, Invalid=4507, Unknown=43, NotChecked=2280, Total=7310 [2022-11-22 02:58:03,576 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 501 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:58:03,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1264 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-22 02:58:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-22 02:58:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 131. [2022-11-22 02:58:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 127 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:58:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2022-11-22 02:58:03,581 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 48 [2022-11-22 02:58:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:58:03,582 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2022-11-22 02:58:03,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 45 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-22 02:58:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-11-22 02:58:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 02:58:03,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:58:03,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:58:03,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-22 02:58:03,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2022-11-22 02:58:04,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-11-22 02:58:04,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:58:04,198 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-22 02:58:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:58:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-11-22 02:58:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:58:04,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444891259] [2022-11-22 02:58:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:58:04,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:58:04,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:58:04,200 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:58:04,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-22 02:58:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:58:04,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-22 02:58:04,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:58:04,627 INFO L350 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 [2022-11-22 02:58:04,637 INFO L350 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 7 [2022-11-22 02:58:05,143 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:58:05,143 INFO L350 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 13 treesize of output 13 [2022-11-22 02:58:05,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-22 02:58:05,333 INFO L350 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 [2022-11-22 02:58:05,351 INFO L350 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 [2022-11-22 02:58:05,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:58:05,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:58:05,594 INFO L350 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 20 [2022-11-22 02:58:06,388 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:58:06,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:58:06,402 INFO L350 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 20 [2022-11-22 02:58:06,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:58:06,545 INFO L350 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 31 treesize of output 26 [2022-11-22 02:58:06,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:58:06,564 INFO L350 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 21 treesize of output 20 [2022-11-22 02:58:06,824 INFO L350 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 25 treesize of output 13 [2022-11-22 02:58:06,836 INFO L350 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 15 treesize of output 7 [2022-11-22 02:58:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:58:07,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:58:09,140 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-22 02:58:09,206 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-22 02:58:09,255 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-22 02:58:09,319 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-22 02:58:09,359 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2022-11-22 02:58:09,398 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-22 02:58:09,573 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-11-22 02:58:09,651 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-11-22 02:58:09,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:58:09,680 INFO L350 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 73 treesize of output 74 [2022-11-22 02:58:09,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:58:09,697 INFO L350 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 65 treesize of output 50 [2022-11-22 02:58:09,705 INFO L350 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 632 treesize of output 556 [2022-11-22 02:58:09,731 INFO L350 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 2168 treesize of output 2068 [2022-11-22 02:58:09,757 INFO L350 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 2064 treesize of output 1968 [2022-11-22 02:58:09,777 INFO L350 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 1968 treesize of output 1920 [2022-11-22 02:58:09,793 INFO L350 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 1920 treesize of output 1824 [2022-11-22 02:58:09,811 INFO L350 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 1824 treesize of output 1700 [2022-11-22 03:02:30,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 03:02:30,332 INFO L350 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 73 treesize of output 66 [2022-11-22 03:02:30,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 03:02:30,351 INFO L350 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 57 treesize of output 50 [2022-11-22 03:02:30,364 INFO L350 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 84 treesize of output 72 [2022-11-22 03:02:30,389 INFO L350 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 362 treesize of output 326 [2022-11-22 03:02:30,404 INFO L350 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 322 treesize of output 306 [2022-11-22 03:02:30,416 INFO L350 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 306 treesize of output 274 [2022-11-22 03:02:30,440 INFO L350 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 142 treesize of output 130 [2022-11-22 03:02:54,024 WARN L233 SmtUtils]: Spent 13.30s on a formula simplification. DAG size of input: 521 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 03:02:55,191 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 03:02:55,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444891259] [2022-11-22 03:02:55,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444891259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 03:02:55,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862756286] [2022-11-22 03:02:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 03:02:55,191 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 03:02:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 03:02:55,193 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 03:02:55,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39ed5c8b-d0a1-4ad1-b6b2-22f7972103fd/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-22 03:02:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 03:02:55,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-22 03:02:55,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 03:02:55,762 INFO L350 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 [2022-11-22 03:02:55,780 INFO L350 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 7 [2022-11-22 03:02:56,172 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 03:02:56,172 INFO L350 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 18 [2022-11-22 03:02:56,217 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 03:02:56,217 INFO L350 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 13 treesize of output 13 [2022-11-22 03:02:56,277 INFO L350 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 [2022-11-22 03:02:56,291 INFO L350 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 [2022-11-22 03:02:56,422 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 03:02:56,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 03:02:56,443 INFO L350 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 20 [2022-11-22 03:02:56,720 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 03:02:56,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 03:02:56,735 INFO L350 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 20 [2022-11-22 03:02:56,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 03:02:56,906 INFO L350 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 21 treesize of output 20 [2022-11-22 03:02:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 03:02:56,922 INFO L350 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 31 treesize of output 26 [2022-11-22 03:02:57,099 INFO L350 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 25 treesize of output 13 [2022-11-22 03:02:57,112 INFO L350 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 15 treesize of output 7 [2022-11-22 03:02:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 03:02:57,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 03:02:58,743 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-22 03:02:58,812 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-22 03:02:58,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-22 03:02:58,934 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-22 03:02:58,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2022-11-22 03:02:59,031 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-22 03:02:59,227 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1899))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1900) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1900) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-11-22 03:02:59,326 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1900) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1899))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1900) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-11-22 03:02:59,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 03:02:59,370 INFO L350 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 73 treesize of output 74 [2022-11-22 03:02:59,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 03:02:59,394 INFO L350 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 65 treesize of output 50 [2022-11-22 03:02:59,404 INFO L350 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 334 treesize of output 290 [2022-11-22 03:02:59,418 INFO L350 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 1114 treesize of output 1062 [2022-11-22 03:02:59,440 INFO L350 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 1058 treesize of output 1010 [2022-11-22 03:02:59,455 INFO L350 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 1010 treesize of output 962 [2022-11-22 03:02:59,470 INFO L350 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 962 treesize of output 938 [2022-11-22 03:02:59,485 INFO L350 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 938 treesize of output 858