./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- 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-8393723 [2022-11-18 20:32:31,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:32:31,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:32:31,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:32:31,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:32:31,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:32:31,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:32:31,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:32:31,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:32:31,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:32:31,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:32:31,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:32:31,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:32:31,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:32:31,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:32:31,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:32:31,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:32:31,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:32:31,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:32:31,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:32:31,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:32:31,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:32:31,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:32:31,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:32:31,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:32:31,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:32:31,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:32:31,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:32:31,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:32:31,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:32:31,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:32:31,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:32:31,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:32:31,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:32:31,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:32:31,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:32:31,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:32:31,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:32:31,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:32:31,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:32:31,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:32:31,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:32:31,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:32:31,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:32:31,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:32:31,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:32:31,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:32:31,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:32:31,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:32:31,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:32:31,618 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:32:31,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:32:31,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:32:31,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:32:31,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:32:31,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:32:31,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:32:31,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:32:31,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:32:31,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:32:31,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:32:31,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:32:31,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:32:31,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:32:31,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:32:31,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:32:31,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:32:31,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:32:31,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:32:31,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:32:31,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:32:31,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:32:31,625 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:32:31,625 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:32:31,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:32:31,626 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2022-11-18 20:32:32,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:32:32,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:32:32,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:32:32,034 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:32:32,035 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:32:32,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-properties/list-1.i [2022-11-18 20:32:32,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/ef647a38c/60908290171349aa84dce41f9040a1d6/FLAG886b27df1 [2022-11-18 20:32:32,758 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:32:32,763 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/sv-benchmarks/c/list-properties/list-1.i [2022-11-18 20:32:32,783 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/ef647a38c/60908290171349aa84dce41f9040a1d6/FLAG886b27df1 [2022-11-18 20:32:33,031 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/ef647a38c/60908290171349aa84dce41f9040a1d6 [2022-11-18 20:32:33,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:32:33,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:32:33,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:32:33,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:32:33,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:32:33,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef19c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33, skipping insertion in model container [2022-11-18 20:32:33,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:32:33,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:32:33,557 WARN L234 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2022-11-18 20:32:33,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:32:33,573 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:32:33,635 WARN L234 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2022-11-18 20:32:33,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:32:33,673 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:32:33,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33 WrapperNode [2022-11-18 20:32:33,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:32:33,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:32:33,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:32:33,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:32:33,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,746 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-11-18 20:32:33,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:32:33,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:32:33,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:32:33,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:32:33,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:32:33,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:32:33,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:32:33,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:32:33,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (1/1) ... [2022-11-18 20:32:33,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:32:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:33,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:32:33,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:32:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-18 20:32:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-18 20:32:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:32:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:32:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:32:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:32:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:32:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:32:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:32:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:32:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:32:34,073 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:32:34,075 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:32:34,144 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-18 20:32:34,322 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:32:34,332 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:32:34,332 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:32:34,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:34 BoogieIcfgContainer [2022-11-18 20:32:34,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:32:34,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:32:34,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:32:34,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:32:34,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:32:33" (1/3) ... [2022-11-18 20:32:34,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7a626c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:32:34, skipping insertion in model container [2022-11-18 20:32:34,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:32:33" (2/3) ... [2022-11-18 20:32:34,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7a626c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:32:34, skipping insertion in model container [2022-11-18 20:32:34,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:32:34" (3/3) ... [2022-11-18 20:32:34,347 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2022-11-18 20:32:34,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:32:34,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:32:34,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:32:34,459 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a221140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:32:34,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:32:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:32:34,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:34,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:34,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2022-11-18 20:32:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:34,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230391209] [2022-11-18 20:32:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,690 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-18 20:32:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230391209] [2022-11-18 20:32:34,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230391209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:34,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:34,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:32:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678815591] [2022-11-18 20:32:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:34,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:32:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:32:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:32:34,746 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:34,777 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-18 20:32:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:32:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-18 20:32:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:34,787 INFO L225 Difference]: With dead ends: 50 [2022-11-18 20:32:34,787 INFO L226 Difference]: Without dead ends: 21 [2022-11-18 20:32:34,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:32:34,796 INFO L413 NwaCegarLoop]: 36 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, 36 SdHoareTripleChecker+Invalid, 0 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-18 20:32:34,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:32:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-18 20:32:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-18 20:32:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-18 20:32:34,841 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2022-11-18 20:32:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:34,842 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-18 20:32:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-18 20:32:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:32:34,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:34,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:34,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:32:34,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2022-11-18 20:32:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22752755] [2022-11-18 20:32:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,325 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-18 20:32:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22752755] [2022-11-18 20:32:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22752755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:35,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:35,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:32:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253854414] [2022-11-18 20:32:35,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:35,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:32:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:32:35,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:32:35,330 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:35,487 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-11-18 20:32:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:32:35,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 20:32:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:35,490 INFO L225 Difference]: With dead ends: 46 [2022-11-18 20:32:35,490 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 20:32:35,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:32:35,492 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:35,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:32:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 20:32:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-11-18 20:32:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-18 20:32:35,519 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2022-11-18 20:32:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:35,520 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-18 20:32:35,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-18 20:32:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:32:35,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:35,522 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:35,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:32:35,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2022-11-18 20:32:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:35,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958764327] [2022-11-18 20:32:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:35,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958764327] [2022-11-18 20:32:35,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958764327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:35,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:35,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:32:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357204724] [2022-11-18 20:32:35,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:35,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:32:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:32:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:32:35,725 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:35,839 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-18 20:32:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:32:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 20:32:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:35,843 INFO L225 Difference]: With dead ends: 48 [2022-11-18 20:32:35,844 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 20:32:35,846 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-18 20:32:35,848 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:35,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:32:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 20:32:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-18 20:32:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-18 20:32:35,862 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-11-18 20:32:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:35,863 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-18 20:32:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-18 20:32:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:32:35,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:35,865 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:35,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:32:35,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2022-11-18 20:32:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:35,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165806090] [2022-11-18 20:32:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:36,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165806090] [2022-11-18 20:32:36,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165806090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:36,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:36,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:32:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586759991] [2022-11-18 20:32:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:36,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:32:36,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:36,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:32:36,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:32:36,022 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:36,111 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-18 20:32:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:32:36,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 20:32:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:36,112 INFO L225 Difference]: With dead ends: 48 [2022-11-18 20:32:36,112 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 20:32:36,113 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-18 20:32:36,114 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:36,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:32:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 20:32:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-11-18 20:32:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-18 20:32:36,120 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-11-18 20:32:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:36,120 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-18 20:32:36,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-18 20:32:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:32:36,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:36,122 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:36,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:32:36,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2022-11-18 20:32:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:36,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983287116] [2022-11-18 20:32:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983287116] [2022-11-18 20:32:36,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983287116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:36,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607540381] [2022-11-18 20:32:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:36,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:36,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:36,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:32:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:36,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 20:32:36,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:36,749 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-18 20:32:36,897 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-18 20:32:36,914 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:36,919 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-18 20:32:37,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:37,023 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 21 treesize of output 20 [2022-11-18 20:32:37,100 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-18 20:32:37,145 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-18 20:32:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:37,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:37,190 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-18 20:32:37,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:37,303 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-18 20:32:37,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:37,321 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 30 treesize of output 33 [2022-11-18 20:32:37,357 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-18 20:32:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-18 20:32:37,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607540381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:37,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:37,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-18 20:32:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115466325] [2022-11-18 20:32:37,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:37,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:32:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:32:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=190, Unknown=3, NotChecked=28, Total=272 [2022-11-18 20:32:37,567 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:37,837 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-11-18 20:32:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:32:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:32:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:37,839 INFO L225 Difference]: With dead ends: 47 [2022-11-18 20:32:37,839 INFO L226 Difference]: Without dead ends: 43 [2022-11-18 20:32:37,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=298, Unknown=3, NotChecked=36, Total=420 [2022-11-18 20:32:37,841 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:37,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 97 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-11-18 20:32:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-18 20:32:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-11-18 20:32:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-11-18 20:32:37,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2022-11-18 20:32:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:37,848 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-11-18 20:32:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-11-18 20:32:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:32:37,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:37,850 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:37,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:38,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:38,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2022-11-18 20:32:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:38,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816361836] [2022-11-18 20:32:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816361836] [2022-11-18 20:32:38,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816361836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:38,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933525698] [2022-11-18 20:32:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:38,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:38,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:38,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:32:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:32:38,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:38,628 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-18 20:32:38,718 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:38,718 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-18 20:32:38,738 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-18 20:32:38,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:38,798 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 21 treesize of output 20 [2022-11-18 20:32:38,890 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-18 20:32:38,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 15 treesize of output 7 [2022-11-18 20:32:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:38,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:39,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:39,048 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-18 20:32:39,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:39,070 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 30 treesize of output 33 [2022-11-18 20:32:39,078 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-18 20:32:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:39,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933525698] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:39,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:39,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-18 20:32:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231502547] [2022-11-18 20:32:39,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:39,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:32:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:32:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=212, Unknown=7, NotChecked=0, Total=272 [2022-11-18 20:32:39,203 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:39,387 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-11-18 20:32:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:32:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:32:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:39,389 INFO L225 Difference]: With dead ends: 49 [2022-11-18 20:32:39,389 INFO L226 Difference]: Without dead ends: 43 [2022-11-18 20:32:39,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=355, Unknown=7, NotChecked=0, Total=462 [2022-11-18 20:32:39,390 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:39,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-11-18 20:32:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-18 20:32:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-18 20:32:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-11-18 20:32:39,397 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2022-11-18 20:32:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:39,397 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-11-18 20:32:39,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-11-18 20:32:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:32:39,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:39,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:39,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:39,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:32:39,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -782408125, now seen corresponding path program 1 times [2022-11-18 20:32:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:39,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623861590] [2022-11-18 20:32:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:40,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623861590] [2022-11-18 20:32:40,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623861590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:40,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345705363] [2022-11-18 20:32:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:40,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:40,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:32:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:40,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:32:40,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:40,329 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-18 20:32:40,401 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:40,402 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-18 20:32:40,439 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-18 20:32:40,449 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-18 20:32:40,516 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:32:40,517 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 52 treesize of output 49 [2022-11-18 20:32:40,524 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 34 treesize of output 36 [2022-11-18 20:32:40,529 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 23 treesize of output 15 [2022-11-18 20:32:40,589 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-18 20:32:40,594 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 19 treesize of output 11 [2022-11-18 20:32:40,607 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-18 20:32:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:40,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:40,670 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 79 treesize of output 57 [2022-11-18 20:32:40,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:40,756 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-18 20:32:40,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:40,768 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 36 treesize of output 35 [2022-11-18 20:32:40,789 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 7 treesize of output 3 [2022-11-18 20:32:40,798 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:32:40,803 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 1 [2022-11-18 20:32:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:40,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345705363] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:40,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:40,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-11-18 20:32:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397659019] [2022-11-18 20:32:40,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:40,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:32:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:32:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=169, Unknown=4, NotChecked=0, Total=210 [2022-11-18 20:32:40,975 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:41,239 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-11-18 20:32:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:32:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 20:32:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:41,241 INFO L225 Difference]: With dead ends: 59 [2022-11-18 20:32:41,241 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 20:32:41,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=303, Unknown=5, NotChecked=0, Total=380 [2022-11-18 20:32:41,242 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 95 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 125 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-11-18 20:32:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 20:32:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-18 20:32:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-11-18 20:32:41,251 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-11-18 20:32:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:41,252 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-11-18 20:32:41,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-11-18 20:32:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:32:41,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:41,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:41,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:41,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:41,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1042605827, now seen corresponding path program 1 times [2022-11-18 20:32:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:41,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929370379] [2022-11-18 20:32:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929370379] [2022-11-18 20:32:41,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929370379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:41,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871992790] [2022-11-18 20:32:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:41,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:41,898 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:41,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:32:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:41,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:32:41,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:42,003 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-18 20:32:42,050 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:42,051 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-18 20:32:42,087 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-18 20:32:42,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-18 20:32:42,168 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:32:42,169 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 52 treesize of output 49 [2022-11-18 20:32:42,175 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 23 treesize of output 15 [2022-11-18 20:32:42,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 26 treesize of output 28 [2022-11-18 20:32:42,226 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-18 20:32:42,231 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 19 treesize of output 11 [2022-11-18 20:32:42,249 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-18 20:32:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:42,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:42,296 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 79 treesize of output 57 [2022-11-18 20:32:42,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:42,393 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-18 20:32:42,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:42,403 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 38 treesize of output 31 [2022-11-18 20:32:42,407 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-18 20:32:42,429 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:32:42,430 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 22 treesize of output 1 [2022-11-18 20:32:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:42,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871992790] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:42,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:42,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-11-18 20:32:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958202489] [2022-11-18 20:32:42,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:42,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:32:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:32:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=169, Unknown=4, NotChecked=0, Total=210 [2022-11-18 20:32:42,541 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:42,872 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-11-18 20:32:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:32:42,872 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 20:32:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:42,873 INFO L225 Difference]: With dead ends: 67 [2022-11-18 20:32:42,873 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 20:32:42,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=298, Unknown=4, NotChecked=0, Total=380 [2022-11-18 20:32:42,875 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 119 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:42,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 153 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 198 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-11-18 20:32:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 20:32:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2022-11-18 20:32:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-11-18 20:32:42,884 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-11-18 20:32:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:42,884 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-11-18 20:32:42,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-11-18 20:32:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:32:42,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:42,886 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:42,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:43,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:43,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -226254882, now seen corresponding path program 2 times [2022-11-18 20:32:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:43,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30159711] [2022-11-18 20:32:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:43,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30159711] [2022-11-18 20:32:43,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30159711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:43,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820691745] [2022-11-18 20:32:43,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:32:43,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:43,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:43,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:43,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:32:43,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:32:43,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:32:43,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:32:43,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:43,578 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-18 20:32:43,653 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:43,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-18 20:32:43,687 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-18 20:32:43,694 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-18 20:32:43,775 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:32:43,775 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 64 treesize of output 61 [2022-11-18 20:32:43,781 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 19 [2022-11-18 20:32:43,785 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-18 20:32:43,838 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 39 treesize of output 21 [2022-11-18 20:32:43,845 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 23 treesize of output 11 [2022-11-18 20:32:43,852 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-18 20:32:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:43,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:43,926 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 30 [2022-11-18 20:32:44,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:44,017 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-18 20:32:44,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:44,027 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 38 treesize of output 31 [2022-11-18 20:32:44,032 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-18 20:32:44,057 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:32:44,058 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 22 treesize of output 1 [2022-11-18 20:32:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:44,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820691745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:44,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:44,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-18 20:32:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255438777] [2022-11-18 20:32:44,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:44,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:32:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:44,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:32:44,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=319, Unknown=4, NotChecked=0, Total=380 [2022-11-18 20:32:44,190 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:44,482 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-11-18 20:32:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:32:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 20:32:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:44,483 INFO L225 Difference]: With dead ends: 65 [2022-11-18 20:32:44,483 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 20:32:44,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=574, Unknown=4, NotChecked=0, Total=702 [2022-11-18 20:32:44,484 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:44,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 141 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 169 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-11-18 20:32:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 20:32:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-18 20:32:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-18 20:32:44,490 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2022-11-18 20:32:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:44,495 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-18 20:32:44,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-18 20:32:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:32:44,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:44,497 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:44,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:44,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-18 20:32:44,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 1 times [2022-11-18 20:32:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:44,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015874154] [2022-11-18 20:32:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:32:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015874154] [2022-11-18 20:32:44,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015874154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766985669] [2022-11-18 20:32:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:44,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:44,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:44,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:44,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:32:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:32:45,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:45,054 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-18 20:32:45,095 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:45,095 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-18 20:32:45,132 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-18 20:32:45,138 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-18 20:32:45,185 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:32:45,185 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 64 treesize of output 61 [2022-11-18 20:32:45,193 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 42 treesize of output 44 [2022-11-18 20:32:45,197 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 19 [2022-11-18 20:32:45,226 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 39 treesize of output 21 [2022-11-18 20:32:45,233 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 23 treesize of output 11 [2022-11-18 20:32:45,248 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-18 20:32:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:45,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:45,326 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 30 [2022-11-18 20:32:45,334 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_347 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-11-18 20:32:45,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:45,360 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-18 20:32:45,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:45,373 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 36 treesize of output 35 [2022-11-18 20:32:45,377 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 7 treesize of output 3 [2022-11-18 20:32:45,395 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:32:45,395 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 1 [2022-11-18 20:32:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-18 20:32:45,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766985669] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:45,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:45,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-11-18 20:32:45,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392126782] [2022-11-18 20:32:45,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:45,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:32:45,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:45,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:32:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2022-11-18 20:32:45,532 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:48,006 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-11-18 20:32:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:32:48,006 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 20:32:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:48,007 INFO L225 Difference]: With dead ends: 60 [2022-11-18 20:32:48,007 INFO L226 Difference]: Without dead ends: 47 [2022-11-18 20:32:48,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=99, Invalid=504, Unknown=1, NotChecked=46, Total=650 [2022-11-18 20:32:48,008 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:48,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 159 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-11-18 20:32:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-18 20:32:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-11-18 20:32:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-18 20:32:48,016 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2022-11-18 20:32:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:48,017 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-18 20:32:48,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-18 20:32:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:32:48,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:48,018 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:48,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:48,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:32:48,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash 366447567, now seen corresponding path program 2 times [2022-11-18 20:32:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:48,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248966550] [2022-11-18 20:32:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:48,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248966550] [2022-11-18 20:32:48,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248966550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:48,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354660209] [2022-11-18 20:32:48,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:32:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:48,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:48,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:32:48,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:32:48,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:32:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-18 20:32:48,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:48,885 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-18 20:32:48,938 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-18 20:32:48,954 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:48,954 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-18 20:32:48,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:48,990 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 21 treesize of output 20 [2022-11-18 20:32:49,012 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-18 20:32:49,068 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-18 20:32:49,137 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:32:49,137 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 19 treesize of output 22 [2022-11-18 20:32:49,371 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-18 20:32:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:49,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:49,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_431 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_431))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-11-18 20:32:49,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_431 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_431))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-11-18 20:32:49,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_425)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_431))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-11-18 20:32:49,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:49,556 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 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-18 20:32:49,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:49,586 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-11-18 20:32:49,603 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 257 treesize of output 241 [2022-11-18 20:32:49,653 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 6 treesize of output 4 [2022-11-18 20:32:49,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:49,718 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 139 treesize of output 137 [2022-11-18 20:32:50,293 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 133 treesize of output 125 [2022-11-18 20:32:50,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:50,767 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 326 treesize of output 306 [2022-11-18 20:32:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:32:51,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354660209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:51,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:51,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-18 20:32:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770799183] [2022-11-18 20:32:51,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:51,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:32:51,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:32:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=316, Unknown=3, NotChecked=114, Total=506 [2022-11-18 20:32:51,318 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:53,910 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-18 20:32:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:32:53,911 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 20:32:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:53,911 INFO L225 Difference]: With dead ends: 60 [2022-11-18 20:32:53,911 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:32:53,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=158, Invalid=663, Unknown=3, NotChecked=168, Total=992 [2022-11-18 20:32:53,913 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:53,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 130 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 103 Invalid, 0 Unknown, 170 Unchecked, 0.2s Time] [2022-11-18 20:32:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:32:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-11-18 20:32:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-11-18 20:32:53,921 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2022-11-18 20:32:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:53,922 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-11-18 20:32:53,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-11-18 20:32:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:32:53,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:53,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:53,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-18 20:32:54,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 20:32:54,129 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:54,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1265496222, now seen corresponding path program 1 times [2022-11-18 20:32:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:54,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694718771] [2022-11-18 20:32:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:54,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694718771] [2022-11-18 20:32:54,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694718771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:54,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309267912] [2022-11-18 20:32:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:54,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:54,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:54,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:54,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:32:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-18 20:32:54,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:54,694 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-18 20:32:54,763 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:54,763 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-18 20:32:54,837 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-18 20:32:54,845 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-18 20:32:54,935 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:32:54,936 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 52 treesize of output 49 [2022-11-18 20:32:54,941 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 34 treesize of output 36 [2022-11-18 20:32:54,946 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 23 treesize of output 15 [2022-11-18 20:32:54,997 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-18 20:32:55,002 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 19 treesize of output 11 [2022-11-18 20:32:55,035 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-18 20:32:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:55,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:55,170 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 30 [2022-11-18 20:32:55,180 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_486 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_485 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-18 20:32:55,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:55,223 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-18 20:32:55,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:55,253 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 38 treesize of output 31 [2022-11-18 20:32:55,258 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-18 20:32:55,284 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:32:55,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-18 20:32:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-18 20:32:55,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309267912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:55,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:55,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-11-18 20:32:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213306362] [2022-11-18 20:32:55,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:55,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:32:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:55,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:32:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2022-11-18 20:32:55,449 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:56,041 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-11-18 20:32:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:32:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 20:32:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:56,044 INFO L225 Difference]: With dead ends: 66 [2022-11-18 20:32:56,044 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 20:32:56,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=597, Unknown=1, NotChecked=50, Total=756 [2022-11-18 20:32:56,046 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:56,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 181 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-11-18 20:32:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 20:32:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-18 20:32:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-18 20:32:56,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-11-18 20:32:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:56,052 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-18 20:32:56,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-18 20:32:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:32:56,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:56,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:56,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:56,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:32:56,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash 666149519, now seen corresponding path program 1 times [2022-11-18 20:32:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:56,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647241131] [2022-11-18 20:32:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:56,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647241131] [2022-11-18 20:32:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647241131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600882612] [2022-11-18 20:32:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:56,832 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:56,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:32:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:56,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-18 20:32:56,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:56,958 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-18 20:32:56,994 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-18 20:32:57,008 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:32:57,008 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-18 20:32:57,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:57,039 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 21 treesize of output 20 [2022-11-18 20:32:57,074 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-18 20:32:57,126 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-18 20:32:57,190 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:32:57,190 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 19 treesize of output 22 [2022-11-18 20:32:57,383 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-18 20:32:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:32:57,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:57,500 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_85| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_568))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_85|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2022-11-18 20:32:57,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_85| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_568))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-18 20:32:57,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:57,699 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 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-18 20:32:57,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:57,731 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-18 20:32:57,748 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 535 treesize of output 503 [2022-11-18 20:32:57,800 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 6 treesize of output 4 [2022-11-18 20:32:57,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:57,971 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 285 treesize of output 275 [2022-11-18 20:32:58,365 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 275 treesize of output 259 [2022-11-18 20:32:59,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:59,303 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 371 treesize of output 357 [2022-11-18 20:33:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 20:33:00,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600882612] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:00,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:00,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-18 20:33:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016730937] [2022-11-18 20:33:00,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:00,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:33:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:33:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=336, Unknown=18, NotChecked=78, Total=506 [2022-11-18 20:33:00,033 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:01,091 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-11-18 20:33:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:33:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-18 20:33:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:01,092 INFO L225 Difference]: With dead ends: 82 [2022-11-18 20:33:01,093 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 20:33:01,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=250, Invalid=991, Unknown=27, NotChecked=138, Total=1406 [2022-11-18 20:33:01,094 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:01,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 177 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 165 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2022-11-18 20:33:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 20:33:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 46. [2022-11-18 20:33:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-11-18 20:33:01,102 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2022-11-18 20:33:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:01,102 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-11-18 20:33:01,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-11-18 20:33:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:33:01,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:01,104 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:01,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:33:01,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:33:01,320 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 3 times [2022-11-18 20:33:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:01,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583582152] [2022-11-18 20:33:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583582152] [2022-11-18 20:33:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583582152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218315143] [2022-11-18 20:33:02,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:33:02,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:02,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:02,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:33:02,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:33:02,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:33:02,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-18 20:33:02,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:02,367 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-18 20:33:02,449 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:33:02,449 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-18 20:33: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 11 treesize of output 7 [2022-11-18 20:33:02,528 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-18 20:33:02,599 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-18 20:33:02,623 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:33:02,623 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 21 treesize of output 25 [2022-11-18 20:33:02,629 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-18 20:33:02,657 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:33:02,658 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 22 treesize of output 22 [2022-11-18 20:33:02,768 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:33:02,768 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 101 treesize of output 92 [2022-11-18 20:33:02,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:02,779 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 41 treesize of output 36 [2022-11-18 20:33:02,785 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-18 20:33:02,911 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:33:02,912 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 56 treesize of output 56 [2022-11-18 20:33:02,935 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:33:02,935 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-18 20:33:02,968 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-18 20:33:02,968 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 2 case distinctions, treesize of input 36 treesize of output 47 [2022-11-18 20:33:02,986 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 15 treesize of output 11 [2022-11-18 20:33:03,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 59 treesize of output 47 [2022-11-18 20:33:03,541 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 109 treesize of output 85 [2022-11-18 20:33:03,570 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-18 20:33:03,570 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 77 [2022-11-18 20:33:03,972 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:33:03,972 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 22 treesize of output 14 [2022-11-18 20:33:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:04,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:04,727 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-18 20:33:04,727 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 2291 treesize of output 2179 [2022-11-18 20:33:04,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:04,776 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1488 treesize of output 1306 [2022-11-18 20:33:06,779 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 8 treesize of output 4 [2022-11-18 20:33:06,875 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 8 treesize of output 4 [2022-11-18 20:33:07,145 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 8 treesize of output 4 [2022-11-18 20:33:07,214 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 8 treesize of output 4 [2022-11-18 20:33:07,448 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse18 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse0 (not .cse17)) (.cse8 (not .cse18)) (.cse1 (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse28 0) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse6 (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse27 0) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (.cse9 (and (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse19)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse20 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse20 0)))))))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse21 0) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or (and (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse22 0)))))))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_660 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse23 0) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_15 .cse4) 0)))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse25)))) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) .cse7) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= (select v_arrayElimArr_15 .cse4) 0)))))) (.cse10 (and .cse17 .cse18))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_661 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse2) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse2)))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)))))) (or (and (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_661 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse5) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse5)))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)))) (not (= (select v_arrayElimArr_15 .cse4) 0)))) .cse6) .cse7)) .cse8) (or .cse9 .cse0 .cse8) (or .cse10 (and .cse1 (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_661 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse11) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse11)))) (or (and (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_661 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse12) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse12)))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse13) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse13)))) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))))) (not (= (select v_arrayElimArr_15 .cse4) 0)))) .cse6) .cse7) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse15) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse15)))) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse16)))))))))) (or .cse9 .cse10))))) is different from false [2022-11-18 20:33:08,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:08,995 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 51 treesize of output 41 [2022-11-18 20:33:09,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,005 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 25 treesize of output 26 [2022-11-18 20:33:09,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:09,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,026 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 61 treesize of output 54 [2022-11-18 20:33:09,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,037 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 31 treesize of output 27 [2022-11-18 20:33:09,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:09,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,066 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 36 treesize of output 35 [2022-11-18 20:33:09,072 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-18 20:33:09,119 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:33:09,120 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 25 treesize of output 1 [2022-11-18 20:33:09,131 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:33:09,131 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 76 treesize of output 1 [2022-11-18 20:33:09,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,149 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 51 treesize of output 41 [2022-11-18 20:33:09,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,162 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 25 treesize of output 26 [2022-11-18 20:33:09,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:09,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:09,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-11-18 20:33:09,181 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 15 treesize of output 7 [2022-11-18 20:33:09,186 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 8 treesize of output 4 [2022-11-18 20:33:09,193 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 10 treesize of output 4 [2022-11-18 20:33:09,198 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 7 treesize of output 3 [2022-11-18 20:33:09,213 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:33:09,213 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 51 treesize of output 1 [2022-11-18 20:33:09,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-18 20:33:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:09,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:09,234 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 19 [2022-11-18 20:33:09,239 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 7 treesize of output 3 [2022-11-18 20:33:09,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,263 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 76 treesize of output 56 [2022-11-18 20:33:09,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:09,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:09,284 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 86 treesize of output 73 [2022-11-18 20:33:09,293 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 34 treesize of output 22 [2022-11-18 20:33:09,328 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:33:09,335 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:33:09,343 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:33:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 20:33:09,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218315143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:09,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:09,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-11-18 20:33:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991500452] [2022-11-18 20:33:09,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:09,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 20:33:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 20:33:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=889, Unknown=3, NotChecked=60, Total=1056 [2022-11-18 20:33:09,686 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:11,184 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-11-18 20:33:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:33:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:33:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:11,186 INFO L225 Difference]: With dead ends: 61 [2022-11-18 20:33:11,186 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 20:33:11,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=196, Invalid=1697, Unknown=3, NotChecked=84, Total=1980 [2022-11-18 20:33:11,188 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:11,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 237 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 151 Invalid, 0 Unknown, 134 Unchecked, 0.2s Time] [2022-11-18 20:33:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 20:33:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2022-11-18 20:33:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-11-18 20:33:11,200 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 26 [2022-11-18 20:33:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:11,200 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-11-18 20:33:11,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-11-18 20:33:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:33:11,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:11,201 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:11,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:33:11,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:33:11,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173034, now seen corresponding path program 2 times [2022-11-18 20:33:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:11,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732097410] [2022-11-18 20:33:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:11,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732097410] [2022-11-18 20:33:11,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732097410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:11,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893830708] [2022-11-18 20:33:11,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:33:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:11,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:11,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:11,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:33:12,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:33:12,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:33:12,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 20:33:12,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:12,059 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-18 20:33:12,123 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:33:12,124 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-18 20:33:12,131 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-18 20:33:12,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:12,173 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 21 treesize of output 20 [2022-11-18 20:33:12,195 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-18 20:33:12,250 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-18 20:33:12,320 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:33:12,320 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 19 treesize of output 22 [2022-11-18 20:33:12,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:12,387 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 31 treesize of output 23 [2022-11-18 20:33:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:12,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:12,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_104| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_743))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_104| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_104|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-18 20:33:12,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_104| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_743))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_104| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_104|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-18 20:33:12,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:12,616 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 2 case distinctions, treesize of input 48 treesize of output 41 [2022-11-18 20:33:12,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:12,644 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 301 [2022-11-18 20:33:12,656 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 270 treesize of output 254 [2022-11-18 20:33:12,741 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 6 treesize of output 4 [2022-11-18 20:33:12,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:12,795 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 70 treesize of output 72 [2022-11-18 20:33:12,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 55 treesize of output 53 [2022-11-18 20:33:12,868 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 6 treesize of output 4 [2022-11-18 20:33:12,874 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 6 treesize of output 4 [2022-11-18 20:33:12,895 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 6 treesize of output 4 [2022-11-18 20:33:12,915 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2022-11-18 20:33:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:33:13,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893830708] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:13,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:13,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2022-11-18 20:33:13,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286324971] [2022-11-18 20:33:13,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:13,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:33:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:13,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:33:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=9, NotChecked=70, Total=420 [2022-11-18 20:33:13,067 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:13,479 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-11-18 20:33:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:33:13,480 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:33:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:13,481 INFO L225 Difference]: With dead ends: 73 [2022-11-18 20:33:13,481 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:33:13,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=474, Unknown=9, NotChecked=94, Total=702 [2022-11-18 20:33:13,482 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:13,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 145 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2022-11-18 20:33:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:33:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-11-18 20:33:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-11-18 20:33:13,496 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2022-11-18 20:33:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:13,496 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-11-18 20:33:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-11-18 20:33:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:33:13,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:13,498 INFO L195 NwaCegarLoop]: trace histogram [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-18 20:33:13,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:33:13,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:13,705 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1292940074, now seen corresponding path program 1 times [2022-11-18 20:33:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:13,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098596519] [2022-11-18 20:33:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:14,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098596519] [2022-11-18 20:33:14,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098596519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875253109] [2022-11-18 20:33:14,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:14,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:14,607 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:14,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:33:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:14,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-18 20:33:14,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:14,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 5 [2022-11-18 20:33:14,839 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:33:14,840 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 17 treesize of output 21 [2022-11-18 20:33:14,924 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-18 20:33:14,934 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-18 20:33:15,079 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:33:15,081 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 31 treesize of output 29 [2022-11-18 20:33:15,109 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-18 20:33:15,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:33:15,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:15,126 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 14 treesize of output 16 [2022-11-18 20:33:15,135 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-18 20:33:15,257 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-18 20:33:15,258 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 103 [2022-11-18 20:33:15,267 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 41 treesize of output 36 [2022-11-18 20:33:15,273 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2022-11-18 20:33:15,466 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:33:15,467 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 145 [2022-11-18 20:33:15,499 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:33:15,499 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 2 case distinctions, treesize of input 146 treesize of output 134 [2022-11-18 20:33:15,515 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 69 treesize of output 54 [2022-11-18 20:33:15,697 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-18 20:33:15,698 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 60 [2022-11-18 20:33:15,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2022-11-18 20:33:15,923 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:33:15,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-11-18 20:33:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:15,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:16,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:16,267 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2022-11-18 20:33:16,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:16,296 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 2606 treesize of output 2474 [2022-11-18 20:33:16,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:16,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1043 treesize of output 946 [2022-11-18 20:33:18,635 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 8 treesize of output 4 [2022-11-18 20:33:18,782 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 8 treesize of output 4 [2022-11-18 20:33:18,938 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 8 treesize of output 4 [2022-11-18 20:33:19,013 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 8 treesize of output 4 [2022-11-18 20:33:19,871 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 60 treesize of output 44 [2022-11-18 20:33:20,073 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 79 treesize of output 59 [2022-11-18 20:33:20,456 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 41 treesize of output 29 [2022-11-18 20:33:20,958 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 60 treesize of output 44 [2022-11-18 20:33:21,652 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 41 treesize of output 29 [2022-11-18 20:33:21,745 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 62 treesize of output 46 [2022-11-18 20:34:51,070 WARN L233 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 316 DAG size of output: 224 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:34:56,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,037 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 588 treesize of output 519 [2022-11-18 20:34:56,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,087 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 1593 treesize of output 1160 [2022-11-18 20:34:56,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,138 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 766 treesize of output 707 [2022-11-18 20:34:56,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,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 696 treesize of output 697 [2022-11-18 20:34:56,199 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 688 treesize of output 680 [2022-11-18 20:34:56,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,253 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 1193 treesize of output 1150 [2022-11-18 20:34:56,304 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 1134 treesize of output 1118 [2022-11-18 20:34:56,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,354 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 1118 treesize of output 1051 [2022-11-18 20:34:56,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,402 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 1042 treesize of output 1023 [2022-11-18 20:34:56,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,452 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 1014 treesize of output 995 [2022-11-18 20:34:56,480 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 986 treesize of output 970 [2022-11-18 20:34:56,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,527 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 970 treesize of output 911 [2022-11-18 20:34:56,556 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 902 treesize of output 894 [2022-11-18 20:34:56,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,607 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 894 treesize of output 863 [2022-11-18 20:34:56,640 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 854 treesize of output 846 [2022-11-18 20:34:56,674 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 846 treesize of output 838 [2022-11-18 20:34:56,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,726 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 838 treesize of output 835 [2022-11-18 20:34:56,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,771 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 826 treesize of output 823 [2022-11-18 20:34:56,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,821 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 814 treesize of output 815 [2022-11-18 20:34:56,850 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 806 treesize of output 790 [2022-11-18 20:34:56,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 790 treesize of output 782 [2022-11-18 20:34:56,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:56,942 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 782 treesize of output 783 [2022-11-18 20:34:57,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:57,001 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 774 treesize of output 727 [2022-11-18 20:34:57,039 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 718 treesize of output 710 [2022-11-18 20:34:57,072 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 710 treesize of output 702 [2022-11-18 20:34:57,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:34:57,121 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 702 treesize of output 703 [2022-11-18 20:35:20,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,240 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 1098 treesize of output 969 [2022-11-18 20:35:20,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,282 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 1324 treesize of output 1195 [2022-11-18 20:35:20,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,369 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 3307 treesize of output 2244 [2022-11-18 20:35:20,405 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 2216 treesize of output 2208 [2022-11-18 20:35:20,444 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 2208 treesize of output 2200 [2022-11-18 20:35:20,477 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 2200 treesize of output 2184 [2022-11-18 20:35:20,501 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 2184 treesize of output 2168 [2022-11-18 20:35:20,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,557 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 2168 treesize of output 2169 [2022-11-18 20:35:20,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,656 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 3771 treesize of output 3644 [2022-11-18 20:35:20,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,869 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 3506 treesize of output 3475 [2022-11-18 20:35:20,916 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 3466 treesize of output 3458 [2022-11-18 20:35:20,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:20,995 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 3458 treesize of output 3455 [2022-11-18 20:35:21,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,069 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 3446 treesize of output 3435 [2022-11-18 20:35:21,121 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 3426 treesize of output 3418 [2022-11-18 20:35:21,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,204 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 3418 treesize of output 3403 [2022-11-18 20:35:21,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,279 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 3394 treesize of output 3287 [2022-11-18 20:35:21,323 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 3278 treesize of output 3246 [2022-11-18 20:35:21,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,403 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 3246 treesize of output 3243 [2022-11-18 20:35:21,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 3234 treesize of output 3202 [2022-11-18 20:35:21,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,542 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 3202 treesize of output 3087 [2022-11-18 20:35:21,616 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 3078 treesize of output 3046 [2022-11-18 20:35:21,689 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 3046 treesize of output 3038 [2022-11-18 20:35:21,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,771 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 3038 treesize of output 3039 [2022-11-18 20:35:21,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:21,861 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 3030 treesize of output 2955 [2022-11-18 20:35:21,924 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 2946 treesize of output 2930 [2022-11-18 20:35:22,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,026 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 2930 treesize of output 2931 [2022-11-18 20:35:22,087 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 2922 treesize of output 2906 [2022-11-18 20:35:22,141 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 2906 treesize of output 2890 [2022-11-18 20:35:22,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,227 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 2890 treesize of output 2887 [2022-11-18 20:35:22,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,320 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 2878 treesize of output 2787 [2022-11-18 20:35:22,379 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 2778 treesize of output 2762 [2022-11-18 20:35:22,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,479 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 2762 treesize of output 2759 [2022-11-18 20:35:22,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,566 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 2750 treesize of output 2691 [2022-11-18 20:35:22,626 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 2682 treesize of output 2666 [2022-11-18 20:35:22,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,730 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 2666 treesize of output 2655 [2022-11-18 20:35:22,835 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 2646 treesize of output 2614 [2022-11-18 20:35:22,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:22,947 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 2614 treesize of output 2515 [2022-11-18 20:35:23,016 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 2506 treesize of output 2490 [2022-11-18 20:35:23,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:23,108 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 2490 treesize of output 2479 [2022-11-18 20:35:23,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:23,213 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 2470 treesize of output 2391 [2022-11-18 20:35:23,293 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 2382 treesize of output 2350 [2022-11-18 20:35:23,362 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 2350 treesize of output 2342 [2022-11-18 20:35:23,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:23,464 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 2342 treesize of output 2323 [2022-11-18 20:35:23,532 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 2314 treesize of output 2306 [2022-11-18 20:36:21,930 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-18 20:36:21,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:36:22,131 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Maybe an infinite loop at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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-18 20:36:22,137 INFO L158 Benchmark]: Toolchain (without parser) took 229098.93ms. Allocated memory was 123.7MB in the beginning and 453.0MB in the end (delta: 329.3MB). Free memory was 85.1MB in the beginning and 348.5MB in the end (delta: -263.4MB). Peak memory consumption was 266.6MB. Max. memory is 16.1GB. [2022-11-18 20:36:22,137 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:36:22,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.50ms. Allocated memory is still 123.7MB. Free memory was 84.9MB in the beginning and 90.9MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:36:22,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.59ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:36:22,138 INFO L158 Benchmark]: Boogie Preprocessor took 56.91ms. Allocated memory is still 123.7MB. Free memory was 89.3MB in the beginning and 87.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:36:22,139 INFO L158 Benchmark]: RCFGBuilder took 529.61ms. Allocated memory is still 123.7MB. Free memory was 87.3MB in the beginning and 74.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:36:22,139 INFO L158 Benchmark]: TraceAbstraction took 227798.78ms. Allocated memory was 123.7MB in the beginning and 453.0MB in the end (delta: 329.3MB). Free memory was 73.6MB in the beginning and 348.5MB in the end (delta: -274.9MB). Peak memory consumption was 254.4MB. Max. memory is 16.1GB. [2022-11-18 20:36:22,141 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.35ms. Allocated memory is still 123.7MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.50ms. Allocated memory is still 123.7MB. Free memory was 84.9MB in the beginning and 90.9MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.59ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.91ms. Allocated memory is still 123.7MB. Free memory was 89.3MB in the beginning and 87.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 529.61ms. Allocated memory is still 123.7MB. Free memory was 87.3MB in the beginning and 74.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 227798.78ms. Allocated memory was 123.7MB in the beginning and 453.0MB in the end (delta: 329.3MB). Free memory was 73.6MB in the beginning and 348.5MB in the end (delta: -274.9MB). Peak memory consumption was 254.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Maybe an infinite loop de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Maybe an infinite loop: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-18 20:36:22,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- 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-8393723 [2022-11-18 20:36:24,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:36:24,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:36:24,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:36:24,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:36:24,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:36:24,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:36:24,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:36:24,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:36:24,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:36:24,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:36:24,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:36:24,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:36:24,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:36:24,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:36:24,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:36:24,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:36:24,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:36:24,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:36:24,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:36:24,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:36:24,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:36:24,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:36:24,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:36:24,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:36:24,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:36:24,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:36:24,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:36:24,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:36:24,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:36:24,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:36:24,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:36:24,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:36:24,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:36:24,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:36:24,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:36:24,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:36:24,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:36:24,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:36:24,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:36:24,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:36:24,731 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 20:36:24,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:36:24,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:36:24,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:36:24,780 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:36:24,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:36:24,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:36:24,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:36:24,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:36:24,784 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:36:24,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:36:24,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:36:24,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:36:24,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:36:24,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:36:24,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:36:24,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:36:24,788 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:36:24,788 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:36:24,788 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:36:24,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:36:24,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:36:24,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:36:24,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:36:24,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:36:24,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:36:24,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:36:24,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:36:24,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:36:24,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:36:24,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:36:24,792 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:36:24,792 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:36:24,792 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:36:24,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:36:24,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:36:24,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:36:24,793 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2022-11-18 20:36:25,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:36:25,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:36:25,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:36:25,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:36:25,255 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:36:25,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-properties/list-1.i [2022-11-18 20:36:25,350 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/7a67e0dbb/02d40c78741c42da916f301a6b085a64/FLAG5b147dedc [2022-11-18 20:36:26,082 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:36:26,082 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/sv-benchmarks/c/list-properties/list-1.i [2022-11-18 20:36:26,096 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/7a67e0dbb/02d40c78741c42da916f301a6b085a64/FLAG5b147dedc [2022-11-18 20:36:26,382 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/data/7a67e0dbb/02d40c78741c42da916f301a6b085a64 [2022-11-18 20:36:26,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:36:26,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:36:26,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:36:26,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:36:26,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:36:26,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:26,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74593d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26, skipping insertion in model container [2022-11-18 20:36:26,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:26,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:36:26,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:36:26,842 WARN L234 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2022-11-18 20:36:26,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:36:26,875 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:36:26,947 WARN L234 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_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2022-11-18 20:36:26,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:36:26,991 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:36:26,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26 WrapperNode [2022-11-18 20:36:26,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:36:26,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:36:26,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:36:26,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:36:27,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,061 INFO L138 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-18 20:36:27,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:36:27,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:36:27,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:36:27,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:36:27,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,117 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:36:27,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:36:27,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:36:27,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:36:27,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (1/1) ... [2022-11-18 20:36:27,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:36:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:27,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:36:27,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:36:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-18 20:36:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-18 20:36:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 20:36:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:36:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:36:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:36:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:36:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:36:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:36:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:36:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:36:27,388 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:36:27,390 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:36:27,436 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-18 20:36:27,684 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:36:27,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:36:27,690 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:36:27,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:36:27 BoogieIcfgContainer [2022-11-18 20:36:27,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:36:27,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:36:27,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:36:27,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:36:27,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:36:26" (1/3) ... [2022-11-18 20:36:27,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2307516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:36:27, skipping insertion in model container [2022-11-18 20:36:27,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:36:26" (2/3) ... [2022-11-18 20:36:27,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2307516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:36:27, skipping insertion in model container [2022-11-18 20:36:27,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:36:27" (3/3) ... [2022-11-18 20:36:27,701 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2022-11-18 20:36:27,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:36:27,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:36:27,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:36:27,804 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79ea7067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:36:27,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:36:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 26 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:36:27,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:27,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:27,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1614508840, now seen corresponding path program 1 times [2022-11-18 20:36:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:27,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587289032] [2022-11-18 20:36:27,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:27,851 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-18 20:36:27,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:27,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:27,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:28,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:36:28,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:28,059 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-18 20:36:28,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:28,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587289032] [2022-11-18 20:36:28,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587289032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:28,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:28,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:36:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919484069] [2022-11-18 20:36:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:28,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:36:28,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:36:28,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:36:28,107 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 26 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:28,130 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2022-11-18 20:36:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:36:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-18 20:36:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:28,147 INFO L225 Difference]: With dead ends: 47 [2022-11-18 20:36:28,147 INFO L226 Difference]: Without dead ends: 19 [2022-11-18 20:36:28,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:36:28,162 INFO L413 NwaCegarLoop]: 34 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, 34 SdHoareTripleChecker+Invalid, 0 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-18 20:36:28,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:36:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-18 20:36:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-18 20:36:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-18 20:36:28,197 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-11-18 20:36:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:28,198 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-18 20:36:28,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-18 20:36:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:36:28,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:28,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:28,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:28,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:28,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1248373710, now seen corresponding path program 1 times [2022-11-18 20:36:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:28,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930896206] [2022-11-18 20:36:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:28,418 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-18 20:36:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:28,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:28,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:28,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:36:28,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:28,654 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-18 20:36:28,699 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-18 20:36:28,711 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-18 20:36:28,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:28,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930896206] [2022-11-18 20:36:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930896206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:28,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:28,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770120479] [2022-11-18 20:36:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:28,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:28,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:28,716 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:28,946 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-11-18 20:36:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:28,947 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:36:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:28,949 INFO L225 Difference]: With dead ends: 42 [2022-11-18 20:36:28,949 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 20:36:28,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:36:28,951 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:28,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:36:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 20:36:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-11-18 20:36:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-11-18 20:36:28,969 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2022-11-18 20:36:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:28,970 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-11-18 20:36:28,970 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-11-18 20:36:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:36:28,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:28,971 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:28,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:29,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1830328215, now seen corresponding path program 1 times [2022-11-18 20:36:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:29,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651525563] [2022-11-18 20:36:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:29,186 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-18 20:36:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:29,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:29,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:36:29,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:29,319 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-18 20:36:29,344 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-18 20:36:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:29,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:29,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:29,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651525563] [2022-11-18 20:36:29,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651525563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:29,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:29,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183292726] [2022-11-18 20:36:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:29,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:29,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:29,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:29,369 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:29,628 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-11-18 20:36:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:29,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 20:36:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:29,630 INFO L225 Difference]: With dead ends: 46 [2022-11-18 20:36:29,631 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 20:36:29,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:36:29,632 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:29,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:36:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 20:36:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-11-18 20:36:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-18 20:36:29,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2022-11-18 20:36:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:29,647 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-18 20:36:29,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-18 20:36:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:36:29,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:29,650 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:29,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1439936105, now seen corresponding path program 1 times [2022-11-18 20:36:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:29,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811123490] [2022-11-18 20:36:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:29,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-18 20:36:29,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:29,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:29,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:36:29,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:30,040 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-18 20:36:30,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 15 treesize of output 7 [2022-11-18 20:36:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:30,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:30,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:30,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811123490] [2022-11-18 20:36:30,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811123490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:30,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:30,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656927744] [2022-11-18 20:36:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:30,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:30,131 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:30,470 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-11-18 20:36:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 20:36:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:30,472 INFO L225 Difference]: With dead ends: 44 [2022-11-18 20:36:30,472 INFO L226 Difference]: Without dead ends: 33 [2022-11-18 20:36:30,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:36:30,474 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:30,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:36:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-18 20:36:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2022-11-18 20:36:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-18 20:36:30,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2022-11-18 20:36:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:30,482 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-18 20:36:30,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-18 20:36:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:36:30,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:30,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:30,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:30,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:30,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 694952227, now seen corresponding path program 1 times [2022-11-18 20:36:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:30,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10293109] [2022-11-18 20:36:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:30,704 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-18 20:36:30,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:30,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:30,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:30,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:36:30,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:30,851 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-18 20:36:30,955 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:36:30,955 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-18 20:36:30,967 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-18 20:36:31,064 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-18 20:36:31,130 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-18 20:36:31,166 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-18 20:36:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:31,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:31,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:31,520 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-18 20:36:31,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:31,546 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 30 treesize of output 33 [2022-11-18 20:36:31,568 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-18 20:36:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:33,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:33,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10293109] [2022-11-18 20:36:33,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10293109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:33,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:33,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-18 20:36:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213636106] [2022-11-18 20:36:33,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:33,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:36:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:33,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:36:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=79, Unknown=6, NotChecked=0, Total=110 [2022-11-18 20:36:33,780 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:34,197 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-11-18 20:36:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:34,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 20:36:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:34,199 INFO L225 Difference]: With dead ends: 44 [2022-11-18 20:36:34,199 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 20:36:34,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=57, Invalid=175, Unknown=8, NotChecked=0, Total=240 [2022-11-18 20:36:34,201 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:34,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 55 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 58 Unchecked, 0.2s Time] [2022-11-18 20:36:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 20:36:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2022-11-18 20:36:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-18 20:36:34,224 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2022-11-18 20:36:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:34,225 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-18 20:36:34,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-18 20:36:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:36:34,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:34,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:34,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:34,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:34,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 317397246, now seen corresponding path program 1 times [2022-11-18 20:36:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:34,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549982264] [2022-11-18 20:36:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:34,444 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-18 20:36:34,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:34,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:34,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:34,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:36:34,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:34,616 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-18 20:36:34,682 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-18 20:36:34,710 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:36:34,710 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-18 20:36:34,782 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-18 20:36:34,846 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-18 20:36:34,870 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-18 20:36:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:34,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:35,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:35,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-18 20:36:35,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:35,075 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 30 treesize of output 33 [2022-11-18 20:36:35,084 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-18 20:36:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:37,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:37,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549982264] [2022-11-18 20:36:37,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549982264] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:37,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:37,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-18 20:36:37,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999432062] [2022-11-18 20:36:37,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:36:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:37,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:36:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=77, Unknown=8, NotChecked=0, Total=110 [2022-11-18 20:36:37,199 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:37,589 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-18 20:36:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:37,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 20:36:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:37,591 INFO L225 Difference]: With dead ends: 50 [2022-11-18 20:36:37,591 INFO L226 Difference]: Without dead ends: 44 [2022-11-18 20:36:37,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=170, Unknown=10, NotChecked=0, Total=240 [2022-11-18 20:36:37,593 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:37,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 79 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-11-18 20:36:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-18 20:36:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-11-18 20:36:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-11-18 20:36:37,603 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-11-18 20:36:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:37,603 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-11-18 20:36:37,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-11-18 20:36:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:36:37,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:37,605 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:37,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:37,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:37,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1092428674, now seen corresponding path program 1 times [2022-11-18 20:36:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264456656] [2022-11-18 20:36:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:37,833 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-18 20:36:37,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:37,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:37,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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)] Waiting until timeout for monitored process [2022-11-18 20:36:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:37,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:36:37,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:38,076 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-18 20:36:38,186 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:36:38,187 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 54 treesize of output 57 [2022-11-18 20:36:38,197 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 25 treesize of output 17 [2022-11-18 20:36:38,233 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-18 20:36:38,234 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 37 treesize of output 45 [2022-11-18 20:36:38,248 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 23 treesize of output 15 [2022-11-18 20:36:38,292 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 55 treesize of output 39 [2022-11-18 20:36:38,453 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-18 20:36:38,458 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-18 20:36:38,571 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:36:38,576 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 22 treesize of output 14 [2022-11-18 20:36:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:38,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:38,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:38,774 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 94 treesize of output 97 [2022-11-18 20:36:38,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:38,944 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 53 treesize of output 54 [2022-11-18 20:36:38,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:38,973 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 83 treesize of output 52 [2022-11-18 20:36:39,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:39,003 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 58 treesize of output 57 [2022-11-18 20:36:39,012 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 41 treesize of output 37 [2022-11-18 20:36:39,021 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 37 treesize of output 33 [2022-11-18 20:36:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:39,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264456656] [2022-11-18 20:36:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264456656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:39,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:39,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-11-18 20:36:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195910103] [2022-11-18 20:36:39,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:39,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:36:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:39,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:36:39,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:36:39,174 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:39,974 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-11-18 20:36:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:36:39,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-18 20:36:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:39,976 INFO L225 Difference]: With dead ends: 44 [2022-11-18 20:36:39,976 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 20:36:39,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:36:39,977 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:39,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 61 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 22 Unchecked, 0.4s Time] [2022-11-18 20:36:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 20:36:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-11-18 20:36:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-11-18 20:36:39,988 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2022-11-18 20:36:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:39,989 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-11-18 20:36:39,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-11-18 20:36:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:36:39,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:39,990 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:40,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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)] Ended with exit code 0 [2022-11-18 20:36:40,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:40,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2117131650, now seen corresponding path program 1 times [2022-11-18 20:36:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:40,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654952195] [2022-11-18 20:36:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:40,205 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-18 20:36:40,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:40,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:40,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:40,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:36:40,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:40,328 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-18 20:36:40,403 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:36:40,403 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-18 20:36:40,460 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-18 20:36:40,536 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:36:40,536 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 64 treesize of output 61 [2022-11-18 20:36:40,544 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 19 [2022-11-18 20:36:40,550 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-18 20:36:40,646 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 39 treesize of output 21 [2022-11-18 20:36:40,653 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 23 treesize of output 11 [2022-11-18 20:36:40,685 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-18 20:36:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:40,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:40,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 79 treesize of output 57 [2022-11-18 20:36:40,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_153) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-18 20:36:40,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:40,842 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 38 treesize of output 31 [2022-11-18 20:36:40,849 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-18 20:36:40,883 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:36:40,884 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 22 treesize of output 1 [2022-11-18 20:36:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-18 20:36:41,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:41,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654952195] [2022-11-18 20:36:41,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654952195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:41,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:41,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-18 20:36:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045389431] [2022-11-18 20:36:41,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:41,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:36:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:36:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2022-11-18 20:36:41,020 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:43,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:45,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:36:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:46,005 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-11-18 20:36:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-18 20:36:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:46,006 INFO L225 Difference]: With dead ends: 64 [2022-11-18 20:36:46,006 INFO L226 Difference]: Without dead ends: 60 [2022-11-18 20:36:46,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-11-18 20:36:46,007 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:46,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 83 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 2 Unknown, 72 Unchecked, 4.8s Time] [2022-11-18 20:36:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-18 20:36:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-11-18 20:36:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-11-18 20:36:46,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 19 [2022-11-18 20:36:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:46,022 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-11-18 20:36:46,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-11-18 20:36:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:36:46,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:46,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:46,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:46,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2095001518, now seen corresponding path program 2 times [2022-11-18 20:36:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:46,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901554873] [2022-11-18 20:36:46,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:36:46,244 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-18 20:36:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:46,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:46,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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 (10)] Waiting until timeout for monitored process [2022-11-18 20:36:46,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:36:46,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:46,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:36:46,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:46,415 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-18 20:36:46,495 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-18 20:36:46,512 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:36:46,512 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-18 20:36:46,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:46,580 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 21 treesize of output 20 [2022-11-18 20:36:46,618 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-18 20:36:46,683 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-18 20:36:46,749 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:36:46,749 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 19 treesize of output 22 [2022-11-18 20:36:46,962 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-18 20:36:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:46,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:47,229 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_201))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_53| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_53|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv3 32)) (= .cse0 (_ bv2 32))))) is different from false [2022-11-18 20:36:47,271 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_201))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_53| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_53|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv2 32) .cse0) (= (_ bv3 32) .cse0)))) is different from false [2022-11-18 20:36:47,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_53| (_ BitVec 32)) (v_ArrVal_196 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_196)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_201))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_53| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_53|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv2 32)) (= .cse0 (_ bv3 32))))) is different from false [2022-11-18 20:36:47,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:47,398 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 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-18 20:36:47,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:47,459 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-18 20:36:47,498 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 535 treesize of output 503 [2022-11-18 20:36:47,625 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 6 treesize of output 4 [2022-11-18 20:36:47,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:47,991 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 285 treesize of output 275 [2022-11-18 20:36:48,903 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 275 treesize of output 259 [2022-11-18 20:36:49,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:49,916 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 488 treesize of output 460 [2022-11-18 20:36:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 20:36:51,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:51,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901554873] [2022-11-18 20:36:51,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901554873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:51,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:51,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-18 20:36:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790047480] [2022-11-18 20:36:51,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:36:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:36:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=254, Unknown=3, NotChecked=102, Total=420 [2022-11-18 20:36:51,068 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:52,413 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-11-18 20:36:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:36:52,415 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:36:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:52,416 INFO L225 Difference]: With dead ends: 60 [2022-11-18 20:36:52,416 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:36:52,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=156, Invalid=609, Unknown=3, NotChecked=162, Total=930 [2022-11-18 20:36:52,418 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:52,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 89 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 127 Invalid, 0 Unknown, 203 Unchecked, 0.5s Time] [2022-11-18 20:36:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:36:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2022-11-18 20:36:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-11-18 20:36:52,431 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 20 [2022-11-18 20:36:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:52,431 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-11-18 20:36:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-11-18 20:36:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:36:52,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:52,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:52,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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 (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:52,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:52,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1421056525, now seen corresponding path program 1 times [2022-11-18 20:36:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:52,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234041281] [2022-11-18 20:36:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:52,640 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-18 20:36:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:52,641 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:52,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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)] Waiting until timeout for monitored process [2022-11-18 20:36:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:52,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:36:52,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:52,786 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-18 20:36:52,852 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:36:52,852 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-18 20:36:52,870 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-18 20:36:52,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:52,936 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 21 treesize of output 20 [2022-11-18 20:36:52,985 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-18 20:36:53,050 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-18 20:36:53,116 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:36:53,117 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 19 treesize of output 22 [2022-11-18 20:36:53,312 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-18 20:36:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:53,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:53,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_249))) (store .cse1 v_ArrVal_253 (store (select .cse1 v_ArrVal_253) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= (_ bv3 32) .cse0)))) is different from false [2022-11-18 20:36:53,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_249))) (store .cse1 v_ArrVal_253 (store (select .cse1 v_ArrVal_253) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) is different from false [2022-11-18 20:36:53,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 (_ BitVec 32)) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_245)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_249))) (store .cse1 v_ArrVal_253 (store (select .cse1 v_ArrVal_253) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv1 32) .cse0)))) is different from false [2022-11-18 20:36:53,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:53,768 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 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-18 20:36:53,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:53,823 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-18 20:36:53,842 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 535 treesize of output 503 [2022-11-18 20:36:53,922 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 6 treesize of output 4 [2022-11-18 20:36:54,005 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 275 treesize of output 259 [2022-11-18 20:36:54,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:54,607 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 281 treesize of output 271 [2022-11-18 20:36:55,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:55,533 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 477 treesize of output 451 [2022-11-18 20:36:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-18 20:36:58,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:58,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234041281] [2022-11-18 20:36:58,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234041281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:58,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:58,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-18 20:36:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037265330] [2022-11-18 20:36:58,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:58,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:36:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:36:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=252, Unknown=4, NotChecked=102, Total=420 [2022-11-18 20:36:58,084 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:59,011 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-11-18 20:36:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:36:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:36:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:59,012 INFO L225 Difference]: With dead ends: 60 [2022-11-18 20:36:59,012 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:36:59,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=148, Invalid=616, Unknown=4, NotChecked=162, Total=930 [2022-11-18 20:36:59,014 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:59,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 103 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 166 Unchecked, 0.4s Time] [2022-11-18 20:36:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:36:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2022-11-18 20:36:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-11-18 20:36:59,025 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 20 [2022-11-18 20:36:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:59,025 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-11-18 20:36:59,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-11-18 20:36:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:36:59,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:59,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:59,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:59,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:59,239 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1798611506, now seen corresponding path program 2 times [2022-11-18 20:36:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:59,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112768032] [2022-11-18 20:36:59,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:36:59,240 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-18 20:36:59,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:59,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:59,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:36:59,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:36:59,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:59,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:36:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:59,392 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-18 20:36:59,440 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-18 20:36:59,462 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:36:59,463 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-18 20:36:59,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:59,517 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 21 treesize of output 20 [2022-11-18 20:36:59,548 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-18 20:36:59,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 14 treesize of output 16 [2022-11-18 20:36:59,685 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:36:59,685 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 19 treesize of output 22 [2022-11-18 20:36:59,871 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-18 20:36:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:59,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:00,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_69| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_301))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv1 32) .cse0) (= (_ bv3 32) .cse0)))) is different from false [2022-11-18 20:37:00,212 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_69| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_301))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) is different from false [2022-11-18 20:37:00,282 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_69| (_ BitVec 32)) (v_ArrVal_298 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_298)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_301))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) is different from false [2022-11-18 20:37:00,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:00,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-18 20:37:00,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:00,390 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-11-18 20:37:00,407 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 535 treesize of output 503 [2022-11-18 20:37:00,471 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 6 treesize of output 4 [2022-11-18 20:37:00,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:00,542 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 285 treesize of output 275 [2022-11-18 20:37:01,506 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 275 treesize of output 259 [2022-11-18 20:37:02,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:02,416 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 372 treesize of output 356 [2022-11-18 20:37:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 20:37:03,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:03,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112768032] [2022-11-18 20:37:03,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112768032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:03,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:03,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-18 20:37:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857120556] [2022-11-18 20:37:03,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:03,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:37:03,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:03,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:37:03,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=254, Unknown=3, NotChecked=102, Total=420 [2022-11-18 20:37:03,660 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:05,236 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-11-18 20:37:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:37:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:37:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:05,238 INFO L225 Difference]: With dead ends: 73 [2022-11-18 20:37:05,238 INFO L226 Difference]: Without dead ends: 69 [2022-11-18 20:37:05,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=689, Unknown=3, NotChecked=174, Total=1056 [2022-11-18 20:37:05,239 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:05,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 119 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 177 Invalid, 0 Unknown, 227 Unchecked, 0.6s Time] [2022-11-18 20:37:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-18 20:37:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-11-18 20:37:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-11-18 20:37:05,251 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 20 [2022-11-18 20:37:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:05,252 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-11-18 20:37:05,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-11-18 20:37:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:37:05,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:05,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:37:05,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:05,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:05,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1803259111, now seen corresponding path program 1 times [2022-11-18 20:37:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:05,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713019932] [2022-11-18 20:37:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:05,467 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-18 20:37:05,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:05,472 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:05,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:05,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:37:05,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:05,575 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-18 20:37:05,632 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:37:05,633 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-18 20:37:05,696 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-18 20:37:05,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 13 treesize of output 9 [2022-11-18 20:37:05,785 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:37:05,786 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 64 treesize of output 61 [2022-11-18 20:37:05,792 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 51 treesize of output 51 [2022-11-18 20:37:05,813 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 19 [2022-11-18 20:37:05,879 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 39 treesize of output 21 [2022-11-18 20:37:05,887 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 32 treesize of output 14 [2022-11-18 20:37:05,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 15 treesize of output 7 [2022-11-18 20:37:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:37:05,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:06,064 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 30 [2022-11-18 20:37:06,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_335) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-18 20:37:06,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:06,107 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-18 20:37:06,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:06,124 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 36 treesize of output 35 [2022-11-18 20:37:06,140 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 7 treesize of output 3 [2022-11-18 20:37:06,150 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:37:06,150 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 1 [2022-11-18 20:37:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-18 20:37:06,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:06,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713019932] [2022-11-18 20:37:06,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713019932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:06,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:06,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-18 20:37:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406919607] [2022-11-18 20:37:06,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:06,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:37:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:37:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2022-11-18 20:37:06,297 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:09,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:37:11,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:37:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:11,336 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-11-18 20:37:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:37:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 20:37:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:11,337 INFO L225 Difference]: With dead ends: 71 [2022-11-18 20:37:11,337 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 20:37:11,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=377, Unknown=1, NotChecked=40, Total=506 [2022-11-18 20:37:11,339 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:11,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 119 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 2 Unknown, 75 Unchecked, 4.7s Time] [2022-11-18 20:37:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 20:37:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-11-18 20:37:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2022-11-18 20:37:11,354 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 21 [2022-11-18 20:37:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:11,354 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2022-11-18 20:37:11,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-11-18 20:37:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:37:11,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:11,356 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:37:11,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:11,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:11,572 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1892794228, now seen corresponding path program 1 times [2022-11-18 20:37:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:11,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118972169] [2022-11-18 20:37:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:11,573 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-18 20:37:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:11,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:11,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:11,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:37:11,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:11,717 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-18 20:37:11,762 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:37:11,762 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-18 20:37:11,828 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-18 20:37:11,841 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-18 20:37:11,936 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:37:11,936 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 64 treesize of output 61 [2022-11-18 20:37:11,947 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 51 treesize of output 51 [2022-11-18 20:37:11,954 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 19 [2022-11-18 20:37:12,020 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 39 treesize of output 21 [2022-11-18 20:37:12,032 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 32 treesize of output 14 [2022-11-18 20:37:12,069 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-18 20:37:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:37:12,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:12,201 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 30 [2022-11-18 20:37:12,243 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-18 20:37:12,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:12,283 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-18 20:37:12,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:12,307 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 36 treesize of output 35 [2022-11-18 20:37:12,315 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 7 treesize of output 3 [2022-11-18 20:37:12,339 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:37:12,339 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 22 treesize of output 1 [2022-11-18 20:37:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-18 20:37:12,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:12,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118972169] [2022-11-18 20:37:12,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118972169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:12,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:12,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-18 20:37:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210779284] [2022-11-18 20:37:12,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:12,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:37:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:37:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2022-11-18 20:37:12,479 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:13,474 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-11-18 20:37:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:37:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 20:37:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:13,475 INFO L225 Difference]: With dead ends: 61 [2022-11-18 20:37:13,475 INFO L226 Difference]: Without dead ends: 39 [2022-11-18 20:37:13,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-11-18 20:37:13,476 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:13,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 48 Unchecked, 0.9s Time] [2022-11-18 20:37:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-18 20:37:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-11-18 20:37:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-18 20:37:13,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2022-11-18 20:37:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:13,486 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-18 20:37:13,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-18 20:37:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:37:13,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:13,487 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-18 20:37:13,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:13,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:13,702 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash 30176329, now seen corresponding path program 2 times [2022-11-18 20:37:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90206209] [2022-11-18 20:37:13,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:37:13,703 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-18 20:37:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:13,704 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:13,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:13,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:37:13,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:13,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:37:13,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:13,863 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-18 20:37:13,927 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-18 20:37:13,948 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:37:13,949 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-18 20:37:14,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:14,029 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 21 treesize of output 20 [2022-11-18 20:37:14,073 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-18 20:37:14,138 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-18 20:37:14,200 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:37:14,200 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 19 treesize of output 22 [2022-11-18 20:37:14,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:14,270 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 31 treesize of output 23 [2022-11-18 20:37:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:37:14,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:14,433 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_96| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_412))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_96| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_96|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2022-11-18 20:37:14,458 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_96| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_412))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_96| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_96|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2022-11-18 20:37:14,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (_ BitVec 32)) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_96| (_ BitVec 32))) (not (= (_ bv1 32) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_406)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_412))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_96| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_96|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-18 20:37:14,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:14,540 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 2 case distinctions, treesize of input 48 treesize of output 41 [2022-11-18 20:37:14,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:14,588 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 161 [2022-11-18 20:37:14,599 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 130 treesize of output 122 [2022-11-18 20:37:14,750 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 6 treesize of output 4 [2022-11-18 20:37:14,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:14,792 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 80 treesize of output 78 [2022-11-18 20:37:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 20:37:15,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:15,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90206209] [2022-11-18 20:37:15,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90206209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:15,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:15,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-18 20:37:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069341163] [2022-11-18 20:37:15,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:15,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:37:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:37:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=172, Unknown=3, NotChecked=84, Total=306 [2022-11-18 20:37:15,079 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:15,852 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-11-18 20:37:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:37:15,853 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 20:37:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:15,854 INFO L225 Difference]: With dead ends: 54 [2022-11-18 20:37:15,854 INFO L226 Difference]: Without dead ends: 46 [2022-11-18 20:37:15,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=333, Unknown=3, NotChecked=120, Total=552 [2022-11-18 20:37:15,855 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2022-11-18 20:37:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-18 20:37:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-11-18 20:37:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-11-18 20:37:15,873 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 22 [2022-11-18 20:37:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:15,874 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-11-18 20:37:15,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:37:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-11-18 20:37:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:37:15,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:15,879 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-18 20:37:15,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:16,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:16,105 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash -994526647, now seen corresponding path program 2 times [2022-11-18 20:37:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:16,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404659226] [2022-11-18 20:37:16,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:37:16,107 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-18 20:37:16,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:16,108 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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-18 20:37:16,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ac56b49-1c1a-4faa-95d4-c0b8a7c8431d/bin/uautomizer-TMbwUNV5ro/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 (16)] Waiting until timeout for monitored process [2022-11-18 20:37:16,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:37:16,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:16,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 20:37:16,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:16,287 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-18 20:37:16,390 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:37:16,391 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-18 20:37:16,462 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 6 treesize of output 5 [2022-11-18 20:37:16,472 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-18 20:37:16,530 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-18 20:37:16,558 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:37:16,558 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 39 treesize of output 37 [2022-11-18 20:37:16,592 INFO L321 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2022-11-18 20:37:16,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 20:37:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:16,637 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 16 treesize of output 18 [2022-11-18 20:37:16,783 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-18 20:37:16,783 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 117 [2022-11-18 20:37:16,800 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 51 treesize of output 44 [2022-11-18 20:37:16,805 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 109 [2022-11-18 20:37:17,008 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:37:17,009 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 175 [2022-11-18 20:37:17,052 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-18 20:37:17,053 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 2 case distinctions, treesize of input 180 treesize of output 166 [2022-11-18 20:37:17,082 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 85 treesize of output 66 [2022-11-18 20:37:17,427 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-18 20:37:17,427 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 60 [2022-11-18 20:37:17,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2022-11-18 20:37:17,525 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:37:17,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-11-18 20:37:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:37:17,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:18,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:18,380 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2022-11-18 20:37:18,487 INFO L321 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2022-11-18 20:37:18,487 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 1190 treesize of output 1148 [2022-11-18 20:37:18,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:18,514 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 685 treesize of output 623 [2022-11-18 20:37:20,337 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 8 treesize of output 4 [2022-11-18 20:37:20,362 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 8 treesize of output 4 [2022-11-18 20:37:20,414 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 60 treesize of output 44 [2022-11-18 20:37:21,519 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 41 treesize of output 29 [2022-11-18 20:37:21,659 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse1 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (or (and .cse0 .cse1) (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_13 .cse2))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse3 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse3))) (not (= .cse4 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse3 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3))))))))) (or (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse6))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse6 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse6 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse7 .cse6)))))))) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_13 .cse2))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse8 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse8))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse8 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse8)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse9))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse9 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse9 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse10))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse10 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse10 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse10)))))) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32)))))) .cse11) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse12))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse12 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse12)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse12) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse12 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse13))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse13 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse13) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse13 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse14) (= .cse2 .cse14))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse15))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse15) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse15 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse16) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse17))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse17 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse17)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse17) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse17 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse18 (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_13 .cse2))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse20 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= .cse19 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse19)))) (not (= (_ bv0 1) (select |c_#valid| .cse20))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse20) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse20 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse20)))))) (or (and (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_13 .cse2))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse22 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse21) (not (= (_ bv0 1) (select |c_#valid| .cse22))) (not (= .cse21 .cse22)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse22 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse23 (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse23)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse24 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse24 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse25) (= .cse2 .cse25))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse26 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= .cse27 (_ bv0 32))) (= .cse2 .cse27)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse26 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse28) (not (= .cse28 .cse26)))))))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_13 .cse2))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse30 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse29) (not (= (_ bv0 1) (select |c_#valid| .cse30))) (not (= .cse29 .cse30)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse30 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse31))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse31 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse32) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) .cse11) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_161 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_161 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse33) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161)))))) .cse11) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select v_arrayElimArr_13 .cse2))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse34 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse34))) (not (= .cse35 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse34) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse35) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse34 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse36 .cse34))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse37))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse37) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse37 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse37 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_13 .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse38 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= (_ bv0 1) (select |c_#valid| .cse38))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse38) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse38 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_13 .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse39 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse39))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse39 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) .cse11) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse40))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse40) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse40 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= .cse41 (_ bv0 32))) (= .cse2 .cse41)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse40 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse40)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_arrayElimCell_161 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_161 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= v_arrayElimCell_161 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse42) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161)))))))))) (or (and (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse43))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse43)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_162 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_162 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_162) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_162 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_162 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (select |c_#valid| v_arrayElimCell_162) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_162 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) .cse11) (or (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_13 .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse44 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= (_ bv0 1) (select |c_#valid| .cse44)))))) .cse11)) (not .cse1) (not .cse0)))) is different from false [2022-11-18 20:37:23,676 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse1 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (or (and .cse0 .cse1) (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_13 .cse2))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse3 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse3))) (not (= .cse4 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse3 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3))))))))) (or (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse6))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse6 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse6 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse7 .cse6)))))))) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_13 .cse2))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse8 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse8))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse8 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse8)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse9))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse9 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse9 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse10))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse10 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse10 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse10)))))) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32)))))) .cse11) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse12))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse12 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse12)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse12) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse12 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse13))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse13 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse13) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse13 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse14) (= .cse2 .cse14))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse15))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse15) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse15 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse16) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse17))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse17 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse17)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse17) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse17 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse18 (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_13 .cse2))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse20 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= .cse19 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse19)))) (not (= (_ bv0 1) (select |c_#valid| .cse20))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse20) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse20 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse20)))))) (or (and (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_13 .cse2))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse22 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse21) (not (= (_ bv0 1) (select |c_#valid| .cse22))) (not (= .cse21 .cse22)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse22 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse23 (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse23)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse24 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse24 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse25) (= .cse2 .cse25))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse26 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= .cse27 (_ bv0 32))) (= .cse2 .cse27)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse26 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse28) (not (= .cse28 .cse26)))))))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_13 .cse2))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse30 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse29) (not (= (_ bv0 1) (select |c_#valid| .cse30))) (not (= .cse29 .cse30)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse30 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse31))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse31 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse32) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) .cse11) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_161 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_161 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse33) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161)))))) .cse11) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select v_arrayElimArr_13 .cse2))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse34 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| .cse34))) (not (= .cse35 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse34) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse35) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse34 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse36 .cse34))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse37))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse37) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse37 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse37 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select v_arrayElimArr_13 .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse38 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= (_ bv0 1) (select |c_#valid| .cse38))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse38) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse38 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_13 .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse39 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse39))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse39 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) .cse11) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse40))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse40) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse40 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= .cse41 (_ bv0 32))) (= .cse2 .cse41)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse40 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse40)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (forall ((v_arrayElimCell_161 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_161 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= v_arrayElimCell_161 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse42) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_161)))))))))) (or (and (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_13 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse43))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse43)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_162 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_162 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_162) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_162 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_162 (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 .cse2) (_ bv0 32))) (not (= (select |c_#valid| v_arrayElimCell_162) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_162 v_ArrVal_468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) .cse11) (or (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_13 .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse44 v_ArrVal_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (not (= (_ bv0 1) (select |c_#valid| .cse44)))))) .cse11)) (not .cse1) (not .cse0)))) is different from true [2022-11-18 20:37:24,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:24,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:24,236 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 152 treesize of output 153 [2022-11-18 20:37:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:24,254 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 169 treesize of output 163 [2022-11-18 20:37:24,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:24,278 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2022-11-18 20:37:24,288 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 155 treesize of output 127 [2022-11-18 20:37:24,302 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 18 treesize of output 10 [2022-11-18 20:37:24,344 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 16 treesize of output 8 [2022-11-18 20:37:24,363 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 15 treesize of output 11 [2022-11-18 20:37:24,372 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 22 treesize of output 14 [2022-11-18 20:37:24,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 11 treesize of output 7 [2022-11-18 20:37:24,652 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 42370 treesize of output 41002 [2022-11-18 20:37:37,449 WARN L233 SmtUtils]: Spent 11.55s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-18 20:37:37,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:37,454 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 30562 treesize of output 30535 [2022-11-18 20:37:49,802 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-18 20:37:49,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:49,806 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 30546 treesize of output 25490 [2022-11-18 20:37:50,011 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 25466 treesize of output 25402 [2022-11-18 20:37:54,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:54,382 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 25402 treesize of output 25143 [2022-11-18 20:37:55,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:55,109 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 27825 treesize of output 27602 [2022-11-18 20:37:56,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:56,486 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 27464 treesize of output 27321 [2022-11-18 20:37:56,838 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 27312 treesize of output 27304 [2022-11-18 20:37:57,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:57,399 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 27304 treesize of output 27181 [2022-11-18 20:37:58,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:58,019 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 27172 treesize of output 27113 [2022-11-18 20:37:58,344 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 27104 treesize of output 26848 [2022-11-18 20:37:58,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:58,985 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 26848 treesize of output 26581 [2022-11-18 20:37:59,248 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 26572 treesize of output 26540 [2022-11-18 20:37:59,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:59,854 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 26540 treesize of output 26425 [2022-11-18 20:38:00,118 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 26416 treesize of output 26384 [2022-11-18 20:38:00,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:00,673 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 26384 treesize of output 26373 [2022-11-18 20:38:00,961 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 26364 treesize of output 26348 [2022-11-18 20:38:01,196 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 26348 treesize of output 26220 [2022-11-18 20:38:01,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:01,706 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 26220 treesize of output 26057 [2022-11-18 20:38:01,993 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 26048 treesize of output 26032 [2022-11-18 20:38:02,259 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 26032 treesize of output 26000 [2022-11-18 20:38:02,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:02,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 26000 treesize of output 25941 [2022-11-18 20:38:03,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:03,430 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 25932 treesize of output 25873 [2022-11-18 20:38:04,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:04,027 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 25864 treesize of output 25797 [2022-11-18 20:38:04,335 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 25788 treesize of output 25660 [2022-11-18 20:38:04,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:04,977 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 25660 treesize of output 25489 [2022-11-18 20:38:05,362 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 25480 treesize of output 25352 [2022-11-18 20:38:06,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:06,058 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 25352 treesize of output 25233 [2022-11-18 20:38:06,376 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 25224 treesize of output 25208 [2022-11-18 20:38:07,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:07,086 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 25208 treesize of output 25149 [2022-11-18 20:38:07,418 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 25140 treesize of output 25012 [2022-11-18 20:38:08,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:08,087 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 25012 treesize of output 24953 [2022-11-18 20:38:08,445 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 24944 treesize of output 24656 [2022-11-18 20:38:08,924 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 24656 treesize of output 24528 [2022-11-18 20:38:09,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:09,429 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 24528 treesize of output 24501 [2022-11-18 20:38:09,916 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 24492 treesize of output 24428 [2022-11-18 20:38:10,217 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 24428 treesize of output 24420 [2022-11-18 20:38:10,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:10,757 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 24420 treesize of output 24385 [2022-11-18 20:38:11,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:11,291 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 24376 treesize of output 24333 [2022-11-18 20:38:11,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:11,954 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 24324 treesize of output 24249 [2022-11-18 20:38:12,312 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 24240 treesize of output 24112 [2022-11-18 20:38:12,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:12,949 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 24112 treesize of output 23989 [2022-11-18 20:38:13,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:13,518 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 23980 treesize of output 23897 [2022-11-18 20:38:14,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:14,197 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 23888 treesize of output 23721 [2022-11-18 20:38:14,571 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 23712 treesize of output 23568 [2022-11-18 20:38:15,007 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 23568 treesize of output 23552 [2022-11-18 20:38:15,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:15,528 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 23552 treesize of output 23225 [2022-11-18 20:38:16,042 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 23216 treesize of output 23200 [2022-11-18 20:38:16,413 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 23200 treesize of output 23184 [2022-11-18 20:38:16,910 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 23184 treesize of output 23120 [2022-11-18 20:38:17,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:17,536 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 23120 treesize of output 23061 [2022-11-18 20:38:18,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:18,159 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 23052 treesize of output 22885 [2022-11-18 20:38:18,547 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 22876 treesize of output 22868 [2022-11-18 20:38:19,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:19,125 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 22868 treesize of output 22745 [2022-11-18 20:38:19,526 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 22736 treesize of output 22480 [2022-11-18 20:38:20,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:20,163 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 22480 treesize of output 22221 [2022-11-18 20:38:20,606 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 22212 treesize of output 22204 [2022-11-18 20:38:21,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:21,215 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 22204 treesize of output 22117 [2022-11-18 20:38:21,700 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 22108 treesize of output 22100 [2022-11-18 20:38:22,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:22,573 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 22100 treesize of output 21945 [2022-11-18 20:38:23,051 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 21936 treesize of output 21904 [2022-11-18 20:38:23,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:23,736 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 21904 treesize of output 21893 [2022-11-18 20:38:24,349 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 21884 treesize of output 21852 [2022-11-18 20:38:25,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:25,039 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 21852 treesize of output 21785 [2022-11-18 20:38:25,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:25,888 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 21776 treesize of output 21581 [2022-11-18 20:38:26,479 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 21572 treesize of output 21564 [2022-11-18 20:38:27,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:27,251 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 21564 treesize of output 21525 [2022-11-18 20:38:27,969 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 21516 treesize of output 21500 [2022-11-18 20:38:28,609 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 21500 treesize of output 21492 [2022-11-18 20:38:29,220 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 21492 treesize of output 21460 [2022-11-18 20:38:29,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:29,787 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 21460 treesize of output 21337 [2022-11-18 20:38:30,414 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 21328 treesize of output 21072 [2022-11-18 20:38:31,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:31,192 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 21072 treesize of output 20825 [2022-11-18 20:38:31,638 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 20816 treesize of output 20808 [2022-11-18 20:38:32,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:32,344 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 20808 treesize of output 20749 [2022-11-18 20:38:33,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:33,139 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 20740 treesize of output 20621 [2022-11-18 20:38:33,703 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 20612 treesize of output 20484 [2022-11-18 20:38:34,345 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 20484 treesize of output 20356 [2022-11-18 20:38:35,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:35,176 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 20356 treesize of output 20297 [2022-11-18 20:38:35,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:35,884 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 20288 treesize of output 20061 [2022-11-18 20:38:36,589 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 20052 treesize of output 20044 [2022-11-18 20:38:37,090 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 20044 treesize of output 20036 [2022-11-18 20:38:37,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:38:37,791 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 20036 treesize of output 20017 [2022-11-18 20:38:38,384 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 20008 treesize of output 20000