./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s2if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN --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 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 --- 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-6b4ec56 [2022-11-20 11:32:54,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:32:54,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:32:54,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:32:54,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:32:54,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:32:54,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:32:54,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:32:54,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:32:54,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:32:54,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:32:54,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:32:54,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:32:54,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:32:54,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:32:54,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:32:54,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:32:54,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:32:54,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:32:54,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:32:54,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:32:54,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:32:54,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:32:54,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:32:54,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:32:54,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:32:54,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:32:54,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:32:54,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:32:54,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:32:54,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:32:54,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:32:54,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:32:54,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:32:54,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:32:54,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:32:54,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:32:54,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:32:54,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:32:54,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:32:54,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:32:54,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:32:54,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:32:54,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:32:54,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:32:54,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:32:54,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:32:54,671 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:32:54,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:32:54,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:32:54,673 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:32:54,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:32:54,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:32:54,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:32:54,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:32:54,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:32:54,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:32:54,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:32:54,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:32:54,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:32:54,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:32:54,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:32:54,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:32:54,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:32:54,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:32:54,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:32:54,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:32:54,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:32:54,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:32:54,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:32:54,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:32:54,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:32:54,680 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:32:54,681 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:32:54,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:32:54,681 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_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN 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 -> 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 [2022-11-20 11:32:55,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:32:55,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:32:55,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:32:55,128 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:32:55,129 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:32:55,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s2if.c [2022-11-20 11:32:58,159 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:32:58,409 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:32:58,410 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/sv-benchmarks/c/array-fpi/s2if.c [2022-11-20 11:32:58,418 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data/cb4e56310/ea32d03db5c043dabb9981b1981e8594/FLAG725e6c05b [2022-11-20 11:32:58,443 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data/cb4e56310/ea32d03db5c043dabb9981b1981e8594 [2022-11-20 11:32:58,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:32:58,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:32:58,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:32:58,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:32:58,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:32:58,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29532295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58, skipping insertion in model container [2022-11-20 11:32:58,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:32:58,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:32:58,721 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-20 11:32:58,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:32:58,757 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:32:58,777 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-20 11:32:58,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:32:58,809 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:32:58,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58 WrapperNode [2022-11-20 11:32:58,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:32:58,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:32:58,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:32:58,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:32:58,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,861 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-20 11:32:58,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:32:58,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:32:58,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:32:58,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:32:58,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,890 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:32:58,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:32:58,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:32:58,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:32:58,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (1/1) ... [2022-11-20 11:32:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:32:58,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:32:58,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:32:58,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:32:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:32:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:32:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:32:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:32:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:32:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:32:59,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:32:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:32:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:32:59,104 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:32:59,106 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:32:59,310 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:32:59,318 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:32:59,319 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 11:32:59,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:32:59 BoogieIcfgContainer [2022-11-20 11:32:59,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:32:59,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:32:59,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:32:59,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:32:59,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:32:58" (1/3) ... [2022-11-20 11:32:59,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2184bcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:32:59, skipping insertion in model container [2022-11-20 11:32:59,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:32:58" (2/3) ... [2022-11-20 11:32:59,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2184bcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:32:59, skipping insertion in model container [2022-11-20 11:32:59,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:32:59" (3/3) ... [2022-11-20 11:32:59,337 INFO L112 eAbstractionObserver]: Analyzing ICFG s2if.c [2022-11-20 11:32:59,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:32:59,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:32:59,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:32:59,431 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;@4b51cf4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:32:59,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:32:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-20 11:32:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:32:59,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:59,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:59,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:32:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-11-20 11:32:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376933708] [2022-11-20 11:32:59,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:59,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:59,689 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-20 11:32:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:32:59,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376933708] [2022-11-20 11:32:59,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376933708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:32:59,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:32:59,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:32:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821057137] [2022-11-20 11:32:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:32:59,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:32:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:32:59,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:32:59,757 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:32:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:59,798 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-20 11:32:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:32:59,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:32:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:59,812 INFO L225 Difference]: With dead ends: 34 [2022-11-20 11:32:59,813 INFO L226 Difference]: Without dead ends: 15 [2022-11-20 11:32:59,817 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-20 11:32:59,823 INFO L413 NwaCegarLoop]: 22 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, 22 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-20 11:32:59,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:32:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-20 11:32:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-20 11:32:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:32:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-20 11:32:59,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-20 11:32:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:59,869 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-20 11:32:59,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:32:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-20 11:32:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:32:59,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:59,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:32:59,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:32:59,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:32:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-11-20 11:32:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:59,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121159588] [2022-11-20 11:32:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:00,054 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-20 11:33:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:00,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121159588] [2022-11-20 11:33:00,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121159588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:33:00,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:33:00,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:33:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881990562] [2022-11-20 11:33:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:33:00,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:33:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:33:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:33:00,059 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:00,137 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-20 11:33:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:33:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:33:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:00,139 INFO L225 Difference]: With dead ends: 28 [2022-11-20 11:33:00,139 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 11:33:00,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:33:00,142 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:00,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:33:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 11:33:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-11-20 11:33:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-20 11:33:00,149 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-20 11:33:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:00,149 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-20 11:33:00,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-20 11:33:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:33:00,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:00,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:00,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:33:00,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:00,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-11-20 11:33:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:00,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578136537] [2022-11-20 11:33:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:01,346 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-20 11:33:01,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:01,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578136537] [2022-11-20 11:33:01,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578136537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:01,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859794138] [2022-11-20 11:33:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:01,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:01,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:01,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:01,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:33:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:01,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 11:33:01,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:01,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-20 11:33:01,541 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 10 treesize of output 8 [2022-11-20 11:33:01,591 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-20 11:33:01,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:33:01,877 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 0 case distinctions, treesize of input 51 treesize of output 27 [2022-11-20 11:33:01,906 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-20 11:33:01,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:02,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:02,588 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 79 treesize of output 72 [2022-11-20 11:33:02,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:33:02,611 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 66 treesize of output 54 [2022-11-20 11:33:02,618 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 10 [2022-11-20 11:33:02,627 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 10 [2022-11-20 11:33:02,644 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-20 11:33:02,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859794138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:02,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:02,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-11-20 11:33:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721823908] [2022-11-20 11:33:02,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:33:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:33:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=269, Unknown=2, NotChecked=0, Total=342 [2022-11-20 11:33:02,656 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-20 11:33:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:02,867 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-11-20 11:33:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:33:02,868 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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) Word has length 16 [2022-11-20 11:33:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:02,869 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:33:02,870 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 11:33:02,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=346, Unknown=2, NotChecked=0, Total=462 [2022-11-20 11:33:02,872 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:02,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 49 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-11-20 11:33:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 11:33:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2022-11-20 11:33:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-20 11:33:02,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2022-11-20 11:33:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:02,881 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-20 11:33:02,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-20 11:33:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-20 11:33:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:33:02,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:02,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:02,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:33:03,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:03,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-11-20 11:33:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:03,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497742248] [2022-11-20 11:33:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:03,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:33:03,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22308464] [2022-11-20 11:33:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:03,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:03,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:33:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:03,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:33:03,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:03,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 11 treesize of output 7 [2022-11-20 11:33:03,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 15 treesize of output 7 [2022-11-20 11:33:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:03,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:03,277 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 14 treesize of output 12 [2022-11-20 11:33:03,280 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 16 [2022-11-20 11:33:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:03,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497742248] [2022-11-20 11:33:03,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:33:03,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22308464] [2022-11-20 11:33:03,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22308464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:03,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:33:03,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-20 11:33:03,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577164834] [2022-11-20 11:33:03,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:03,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:33:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:33:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:33:03,299 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-20 11:33:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:03,388 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-20 11:33:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:33:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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) Word has length 16 [2022-11-20 11:33:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:03,390 INFO L225 Difference]: With dead ends: 38 [2022-11-20 11:33:03,390 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 11:33:03,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:33:03,392 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:03,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:33:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 11:33:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-20 11:33:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-20 11:33:03,405 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-11-20 11:33:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:03,405 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-20 11:33:03,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-20 11:33:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-20 11:33:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:33:03,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:03,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:03,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:03,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-20 11:33:03,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-11-20 11:33:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:03,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547744232] [2022-11-20 11:33:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:03,774 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-20 11:33:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:03,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547744232] [2022-11-20 11:33:03,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547744232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:03,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537749763] [2022-11-20 11:33:03,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:33:03,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:03,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:03,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:03,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:33:03,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:33:03,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:03,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:33:03,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:03,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:04,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537749763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:04,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:04,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 11:33:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842738605] [2022-11-20 11:33:04,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:33:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:33:04,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:33:04,015 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:04,207 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-20 11:33:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:33:04,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 11:33:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:04,210 INFO L225 Difference]: With dead ends: 33 [2022-11-20 11:33:04,210 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 11:33:04,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:33:04,216 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:04,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 25 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:33:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 11:33:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-11-20 11:33:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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-20 11:33:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-20 11:33:04,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-11-20 11:33:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:04,233 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-20 11:33:04,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-20 11:33:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:33:04,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:04,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:04,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:04,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:04,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-11-20 11:33:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:04,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720101301] [2022-11-20 11:33:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:04,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720101301] [2022-11-20 11:33:04,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720101301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:04,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449064624] [2022-11-20 11:33:04,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:33:04,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:04,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:04,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:04,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:33:04,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:33:04,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:04,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:33:04,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:04,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:04,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449064624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:04,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:04,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 11:33:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521009182] [2022-11-20 11:33:04,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:04,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:33:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:33:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:33:04,773 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-20 11:33:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:04,882 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-11-20 11:33:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:33:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-20 11:33:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:04,883 INFO L225 Difference]: With dead ends: 37 [2022-11-20 11:33:04,883 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 11:33:04,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:33:04,885 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:04,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:33:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 11:33:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-11-20 11:33:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-20 11:33:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-20 11:33:04,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-11-20 11:33:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:04,892 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-20 11:33:04,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-20 11:33:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-20 11:33:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:33:04,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:04,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:04,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:05,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-11-20 11:33:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:05,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6214521] [2022-11-20 11:33:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:05,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6214521] [2022-11-20 11:33:05,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6214521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011318833] [2022-11-20 11:33:05,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:33:05,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:05,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:05,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:33:06,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:33:06,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:06,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-20 11:33:06,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:06,044 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-20 11:33:06,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 10 treesize of output 8 [2022-11-20 11:33:06,093 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-20 11:33:06,142 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-20 11:33:06,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:33:06,590 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:33:06,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:33:06,819 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:33:06,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 58 treesize of output 30 [2022-11-20 11:33:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:06,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:08,774 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse0 2)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (< (+ .cse0 .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~0#1_42| 2) 3)) (not (= 2 .cse2)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse5 2)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (< (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) 1) (+ .cse5 .cse6 .cse7)) (not (= 2 .cse7)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|))))))))) is different from false [2022-11-20 11:33:08,890 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse0 2)) (< .cse1 |v_ULTIMATE.start_main_~i~0#1_42|) (< (+ .cse0 .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~0#1_42| 2) 3)) (not (= 2 .cse3)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse6 2)) (< .cse1 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= 2 .cse7)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)) (< (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) 3) (+ .cse6 .cse8 .cse7)))))))))) is different from false [2022-11-20 11:33:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 11:33:09,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011318833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:09,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:09,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2022-11-20 11:33:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9011945] [2022-11-20 11:33:09,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:09,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 11:33:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 11:33:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=935, Unknown=2, NotChecked=126, Total=1190 [2022-11-20 11:33:09,050 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:10,077 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-20 11:33:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:33:10,078 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:33:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:10,080 INFO L225 Difference]: With dead ends: 43 [2022-11-20 11:33:10,080 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:33:10,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=229, Invalid=1583, Unknown=2, NotChecked=166, Total=1980 [2022-11-20 11:33:10,082 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:10,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 155 Invalid, 0 Unknown, 172 Unchecked, 0.2s Time] [2022-11-20 11:33:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:33:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-20 11:33:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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-20 11:33:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-20 11:33:10,090 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 21 [2022-11-20 11:33:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:10,091 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-20 11:33:10,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-20 11:33:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:33:10,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:10,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:10,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:10,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:10,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-11-20 11:33:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541270602] [2022-11-20 11:33:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:10,322 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:33:10,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011088535] [2022-11-20 11:33:10,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:10,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:10,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:10,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:33:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:10,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:33:10,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:10,461 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-20 11:33:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:10,562 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 16 treesize of output 18 [2022-11-20 11:33:10,604 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-20 11:33:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:10,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:10,702 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-11-20 11:33:10,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:10,718 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 24 treesize of output 25 [2022-11-20 11:33:10,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:10,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 38 treesize of output 34 [2022-11-20 11:33:10,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 7 treesize of output 3 [2022-11-20 11:33:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:33:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541270602] [2022-11-20 11:33:10,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:33:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011088535] [2022-11-20 11:33:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011088535] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:10,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:33:10,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-20 11:33:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954457217] [2022-11-20 11:33:10,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:33:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:33:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=146, Unknown=2, NotChecked=24, Total=210 [2022-11-20 11:33:10,795 INFO L87 Difference]: Start difference. First operand 33 states and 38 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-20 11:33:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:11,024 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-11-20 11:33:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:33:11,024 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-20 11:33:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:11,025 INFO L225 Difference]: With dead ends: 44 [2022-11-20 11:33:11,025 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:33:11,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=268, Unknown=2, NotChecked=34, Total=380 [2022-11-20 11:33:11,026 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:11,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-11-20 11:33:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:33:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-11-20 11:33:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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-20 11:33:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-11-20 11:33:11,034 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2022-11-20 11:33:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:11,034 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-11-20 11:33:11,035 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-20 11:33:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-11-20 11:33:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:33:11,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:11,036 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:11,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:11,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 11:33:11,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-11-20 11:33:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:11,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31734120] [2022-11-20 11:33:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:11,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31734120] [2022-11-20 11:33:11,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31734120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:11,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612214301] [2022-11-20 11:33:11,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:33:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:11,391 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:11,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:33:11,486 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 11:33:11,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:11,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:33:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:11,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:11,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612214301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:11,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:33:11,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 11:33:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490202235] [2022-11-20 11:33:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:11,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:33:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:33:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:33:11,661 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-20 11:33:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:11,907 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-20 11:33:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:33:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:33:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:11,908 INFO L225 Difference]: With dead ends: 44 [2022-11-20 11:33:11,909 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:33:11,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:33:11,910 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:11,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 31 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:33:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:33:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-11-20 11:33:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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-20 11:33:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-11-20 11:33:11,920 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2022-11-20 11:33:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:11,920 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-11-20 11:33:11,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-20 11:33:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-11-20 11:33:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:33:11,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:11,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:11,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:12,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:12,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2022-11-20 11:33:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:12,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643285171] [2022-11-20 11:33:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:12,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:33:12,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46041116] [2022-11-20 11:33:12,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:33:12,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:12,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:12,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:12,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:33:12,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:33:12,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:12,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:33:12,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:12,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:12,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643285171] [2022-11-20 11:33:12,418 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:33:12,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46041116] [2022-11-20 11:33:12,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46041116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:12,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:33:12,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-20 11:33:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715263648] [2022-11-20 11:33:12,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:12,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:33:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:33:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:33:12,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:33:12,424 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-20 11:33:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:12,582 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-20 11:33:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:33:12,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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 24 [2022-11-20 11:33:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:12,583 INFO L225 Difference]: With dead ends: 48 [2022-11-20 11:33:12,583 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:33:12,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:33:12,585 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:12,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 27 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:33:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:33:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-11-20 11:33:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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-20 11:33:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-11-20 11:33:12,606 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-11-20 11:33:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:12,609 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-11-20 11:33:12,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-20 11:33:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-11-20 11:33:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:33:12,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:12,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:12,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 11:33:12,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:33:12,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2022-11-20 11:33:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:33:12,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840804664] [2022-11-20 11:33:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:33:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840804664] [2022-11-20 11:33:14,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840804664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91618235] [2022-11-20 11:33:14,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:33:14,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:14,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:14,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:14,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:33:14,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 11:33:14,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:33:14,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-20 11:33:14,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:14,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:33:14,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:14,289 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-20 11:33:14,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:14,305 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-20 11:33:14,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:14,330 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-20 11:33:14,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:14,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:33:14,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:14,660 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:33:14,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2022-11-20 11:33:14,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:14,957 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 11:33:14,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 51 [2022-11-20 11:33:15,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:15,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:15,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 35 [2022-11-20 11:33:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:33:15,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:36,864 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-20 11:33:36,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-20 11:33:36,865 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-20 11:33:36,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:33:37,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:33:37,066 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 46 more [2022-11-20 11:33:37,069 INFO L158 Benchmark]: Toolchain (without parser) took 38617.54ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 122.2MB in the beginning and 93.5MB in the end (delta: 28.7MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2022-11-20 11:33:37,069 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:33:37,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.29ms. Allocated memory is still 161.5MB. Free memory was 121.8MB in the beginning and 126.3MB in the end (delta: -4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:33:37,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.45ms. Allocated memory is still 161.5MB. Free memory was 126.3MB in the beginning and 124.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:33:37,070 INFO L158 Benchmark]: Boogie Preprocessor took 30.92ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 123.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:33:37,070 INFO L158 Benchmark]: RCFGBuilder took 426.87ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 111.6MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:33:37,071 INFO L158 Benchmark]: TraceAbstraction took 37744.00ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 110.9MB in the beginning and 93.5MB in the end (delta: 17.4MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2022-11-20 11:33:37,075 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 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.29ms. Allocated memory is still 161.5MB. Free memory was 121.8MB in the beginning and 126.3MB in the end (delta: -4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.45ms. Allocated memory is still 161.5MB. Free memory was 126.3MB in the beginning and 124.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.92ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 123.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.87ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 111.6MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37744.00ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 110.9MB in the beginning and 93.5MB in the end (delta: 17.4MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN --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 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 --- 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-6b4ec56 [2022-11-20 11:33:39,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:33:39,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:33:39,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:33:39,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:33:39,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:33:39,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:33:39,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:33:39,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:33:39,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:33:39,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:33:39,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:33:39,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:33:39,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:33:39,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:33:39,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:33:39,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:33:39,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:33:39,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:33:39,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:33:39,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:33:39,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:33:39,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:33:39,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:33:39,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:33:39,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:33:39,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:33:39,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:33:39,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:33:39,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:33:39,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:33:39,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:33:39,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:33:39,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:33:39,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:33:39,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:33:39,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:33:39,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:33:39,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:33:39,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:33:39,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:33:39,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 11:33:39,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:33:39,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:33:39,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:33:39,630 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:33:39,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:33:39,631 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:33:39,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:33:39,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:33:39,632 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:33:39,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:33:39,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:33:39,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:33:39,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:33:39,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:33:39,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:33:39,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:33:39,634 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:33:39,634 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:33:39,634 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:33:39,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:33:39,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:33:39,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:33:39,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:33:39,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:33:39,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:33:39,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:33:39,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:33:39,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:33:39,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:33:39,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:33:39,637 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:33:39,638 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:33:39,638 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:33:39,638 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:33:39,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:33:39,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:33:39,639 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_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN 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 -> 42b59db67e4ff104bf70a3f31bfda20f06e9930727bb99d5ddebd47ecfc54cb7 [2022-11-20 11:33:40,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:33:40,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:33:40,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:33:40,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:33:40,087 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:33:40,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s2if.c [2022-11-20 11:33:43,796 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:33:44,034 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:33:44,035 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/sv-benchmarks/c/array-fpi/s2if.c [2022-11-20 11:33:44,044 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data/f0781ede7/ee08f7171d614477b328f0aabd0bf27d/FLAG564171a29 [2022-11-20 11:33:44,073 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/data/f0781ede7/ee08f7171d614477b328f0aabd0bf27d [2022-11-20 11:33:44,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:33:44,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:33:44,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:33:44,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:33:44,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:33:44,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a43593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44, skipping insertion in model container [2022-11-20 11:33:44,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:33:44,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:33:44,382 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-20 11:33:44,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:33:44,437 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:33:44,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/sv-benchmarks/c/array-fpi/s2if.c[587,600] [2022-11-20 11:33:44,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:33:44,521 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:33:44,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44 WrapperNode [2022-11-20 11:33:44,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:33:44,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:33:44,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:33:44,525 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:33:44,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,635 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-11-20 11:33:44,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:33:44,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:33:44,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:33:44,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:33:44,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:33:44,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:33:44,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:33:44,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:33:44,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (1/1) ... [2022-11-20 11:33:44,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:33:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:44,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:33:44,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:33:44,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:33:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:33:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:33:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-20 11:33:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:33:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 11:33:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:33:44,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:33:44,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-20 11:33:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:33:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 11:33:44,923 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:33:44,925 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:33:45,301 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:33:45,308 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:33:45,309 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 11:33:45,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:33:45 BoogieIcfgContainer [2022-11-20 11:33:45,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:33:45,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:33:45,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:33:45,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:33:45,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:33:44" (1/3) ... [2022-11-20 11:33:45,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af05d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:33:45, skipping insertion in model container [2022-11-20 11:33:45,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:33:44" (2/3) ... [2022-11-20 11:33:45,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af05d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:33:45, skipping insertion in model container [2022-11-20 11:33:45,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:33:45" (3/3) ... [2022-11-20 11:33:45,343 INFO L112 eAbstractionObserver]: Analyzing ICFG s2if.c [2022-11-20 11:33:45,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:33:45,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:33:45,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:33:45,476 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;@77a8aad2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:33:45,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:33:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-20 11:33:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:33:45,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:45,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:45,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:45,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-11-20 11:33:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:33:45,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521014069] [2022-11-20 11:33:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:45,517 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-20 11:33:45,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:33:45,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:45,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:45,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 11:33:45,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:45,761 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-20 11:33:45,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:33:45,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:33:45,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521014069] [2022-11-20 11:33:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521014069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:33:45,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:33:45,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:33:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067808628] [2022-11-20 11:33:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:33:45,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:33:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:33:45,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:33:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:33:45,827 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:45,845 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-20 11:33:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:33:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:33:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:45,857 INFO L225 Difference]: With dead ends: 34 [2022-11-20 11:33:45,858 INFO L226 Difference]: Without dead ends: 15 [2022-11-20 11:33:45,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-20 11:33:45,866 INFO L413 NwaCegarLoop]: 22 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, 22 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-20 11:33:45,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:33:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-20 11:33:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-20 11:33:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-20 11:33:45,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-20 11:33:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-20 11:33:45,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-20 11:33:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:33:45,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:45,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:45,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:46,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:46,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-11-20 11:33:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:33:46,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776298196] [2022-11-20 11:33:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:46,129 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-20 11:33:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:33:46,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:46,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:46,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:33:46,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:46,519 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-20 11:33:46,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:33:46,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:33:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776298196] [2022-11-20 11:33:46,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776298196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:33:46,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:33:46,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:33:46,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027202573] [2022-11-20 11:33:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:33:46,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:33:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:33:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:33:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:33:46,534 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:46,919 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-20 11:33:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:33:46,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:33:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:46,930 INFO L225 Difference]: With dead ends: 28 [2022-11-20 11:33:46,930 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 11:33:46,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:33:46,932 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:46,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 8 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:33:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 11:33:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-11-20 11:33:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-20 11:33:46,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-20 11:33:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:46,953 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-20 11:33:46,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-20 11:33:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:33:46,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:46,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:46,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:47,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:47,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-11-20 11:33:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:33:47,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821996176] [2022-11-20 11:33:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:47,176 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-20 11:33:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:33:47,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:47,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:47,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 11:33:47,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:47,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 11:33:47,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:33:47,533 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 18 treesize of output 19 [2022-11-20 11:33:47,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:47,654 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 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 11:33:48,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:48,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-11-20 11:33:48,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:48,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 94 treesize of output 52 [2022-11-20 11:33:48,645 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-20 11:33:48,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:55,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:33:55,990 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-20 11:33:55,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:33:55,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821996176] [2022-11-20 11:33:55,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821996176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:55,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:33:55,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-20 11:33:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107754502] [2022-11-20 11:33:55,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:55,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:33:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:33:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:33:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=297, Unknown=1, NotChecked=0, Total=380 [2022-11-20 11:33:55,995 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 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-20 11:33:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:58,779 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-20 11:33:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:33:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 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 16 [2022-11-20 11:33:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:58,791 INFO L225 Difference]: With dead ends: 43 [2022-11-20 11:33:58,792 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 11:33:58,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=172, Invalid=583, Unknown=1, NotChecked=0, Total=756 [2022-11-20 11:33:58,794 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:58,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 61 Unchecked, 1.3s Time] [2022-11-20 11:33:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 11:33:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2022-11-20 11:33:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-20 11:33:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-20 11:33:58,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-20 11:33:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:58,811 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-20 11:33:58,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 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-20 11:33:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-20 11:33:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:33:58,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:58,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:58,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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)] Ended with exit code 0 [2022-11-20 11:33:59,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:59,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:33:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:33:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-11-20 11:33:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:33:59,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187719409] [2022-11-20 11:33:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:59,030 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-20 11:33:59,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:33:59,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:59,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:33:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:59,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:33:59,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:59,198 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-20 11:33:59,266 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-20 11:33:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:59,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:59,368 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 14 treesize of output 12 [2022-11-20 11:33:59,373 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 16 [2022-11-20 11:33:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:33:59,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:33:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187719409] [2022-11-20 11:33:59,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187719409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:33:59,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:33:59,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-20 11:33:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413146188] [2022-11-20 11:33:59,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:33:59,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:33:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:33:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:33:59,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:33:59,404 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:33:59,893 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-11-20 11:33:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:33:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 11:33:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:33:59,896 INFO L225 Difference]: With dead ends: 33 [2022-11-20 11:33:59,896 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 11:33:59,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:33:59,899 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:33:59,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:33:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 11:33:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-20 11:33:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-20 11:33:59,920 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-11-20 11:33:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:33:59,922 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-20 11:33:59,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:33:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-20 11:33:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:33:59,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:33:59,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:33:59,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:00,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:00,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-11-20 11:34:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:34:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422488614] [2022-11-20 11:34:00,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:34:00,148 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-20 11:34:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:34:00,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:00,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:00,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:34:00,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:34:00,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:34:00,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:00,701 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-20 11:34:00,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:34:01,079 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-20 11:34:01,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:34:01,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422488614] [2022-11-20 11:34:01,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422488614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:01,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:34:01,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-11-20 11:34:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441328409] [2022-11-20 11:34:01,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:01,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:34:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:34:01,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:34:01,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:34:01,082 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-20 11:34:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:02,785 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-11-20 11:34:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:34:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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 18 [2022-11-20 11:34:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:02,787 INFO L225 Difference]: With dead ends: 54 [2022-11-20 11:34:02,787 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 11:34:02,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:34:02,788 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:02,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 21 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 11:34:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 11:34:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-11-20 11:34:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 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-20 11:34:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-20 11:34:02,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 18 [2022-11-20 11:34:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:02,802 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-20 11:34:02,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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-20 11:34:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-20 11:34:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:34:02,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:02,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:02,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:03,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-11-20 11:34:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:34:03,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217553884] [2022-11-20 11:34:03,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:34:03,016 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-20 11:34:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:34:03,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:03,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:03,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:34:03,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:34:03,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:34:03,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:03,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:34:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:03,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:34:03,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217553884] [2022-11-20 11:34:03,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217553884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:03,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:34:03,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-20 11:34:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448432881] [2022-11-20 11:34:03,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:03,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:34:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:34:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:34:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:34:03,637 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:34:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:04,558 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-11-20 11:34:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:34:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 11:34:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:04,569 INFO L225 Difference]: With dead ends: 46 [2022-11-20 11:34:04,570 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 11:34:04,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:34:04,571 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:04,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 18 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:34:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 11:34:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-20 11:34:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-20 11:34:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-20 11:34:04,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2022-11-20 11:34:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:04,588 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-20 11:34:04,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:34:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-20 11:34:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:34:04,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:04,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:04,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:04,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:04,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-11-20 11:34:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:34:04,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717152883] [2022-11-20 11:34:04,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:34:04,804 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-20 11:34:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:34:04,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:04,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:04,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:34:04,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:34:04,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 11:34:04,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:05,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:05,010 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 18 treesize of output 19 [2022-11-20 11:34:05,031 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 10 treesize of output 8 [2022-11-20 11:34:05,108 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 25 treesize of output 25 [2022-11-20 11:34:05,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:05,231 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 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 11:34:05,868 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:34:05,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 63 [2022-11-20 11:34:06,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:06,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2022-11-20 11:34:06,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:06,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 83 [2022-11-20 11:34:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:06,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:34:17,920 INFO L321 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-11-20 11:34:17,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 869 treesize of output 557 [2022-11-20 11:34:28,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:28,249 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 11:34:28,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 546 treesize of output 1 [2022-11-20 11:34:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:28,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:34:28,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717152883] [2022-11-20 11:34:28,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717152883] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:28,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:34:28,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2022-11-20 11:34:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973377003] [2022-11-20 11:34:28,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:28,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:34:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:34:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:34:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=586, Unknown=10, NotChecked=0, Total=702 [2022-11-20 11:34:28,258 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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-20 11:34:33,486 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-20 11:34:39,743 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 62 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:34:43,154 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-20 11:34:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:43,685 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-11-20 11:34:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 11:34:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 21 [2022-11-20 11:34:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:43,687 INFO L225 Difference]: With dead ends: 39 [2022-11-20 11:34:43,687 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 11:34:43,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=245, Invalid=1305, Unknown=10, NotChecked=0, Total=1560 [2022-11-20 11:34:43,689 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:43,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 52 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 258 Invalid, 2 Unknown, 102 Unchecked, 5.6s Time] [2022-11-20 11:34:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 11:34:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-20 11:34:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 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-20 11:34:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 11:34:43,700 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 21 [2022-11-20 11:34:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:43,700 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 11:34:43,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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-20 11:34:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 11:34:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:34:43,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:43,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:43,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:34:43,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:43,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-11-20 11:34:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:34:43,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888943550] [2022-11-20 11:34:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:43,903 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-20 11:34:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:34:43,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:43,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:44,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:34:44,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:44,041 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 10 treesize of output 8 [2022-11-20 11:34:44,091 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-20 11:34:44,206 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 16 treesize of output 18 [2022-11-20 11:34:44,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 11:34:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:44,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:34:44,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 11:34:44,452 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) is different from false [2022-11-20 11:34:44,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:44,481 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 24 treesize of output 25 [2022-11-20 11:34:44,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:44,498 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 34 [2022-11-20 11:34:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 11:34:44,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:34:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888943550] [2022-11-20 11:34:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888943550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:44,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:34:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-20 11:34:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630944443] [2022-11-20 11:34:44,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:44,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:34:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:34:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:34:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-11-20 11:34:44,628 INFO L87 Difference]: Start difference. First operand 32 states and 35 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-20 11:34:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:45,270 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-20 11:34:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:34:45,280 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-20 11:34:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:45,280 INFO L225 Difference]: With dead ends: 41 [2022-11-20 11:34:45,280 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 11:34:45,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2022-11-20 11:34:45,281 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:45,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 38 Unchecked, 0.4s Time] [2022-11-20 11:34:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 11:34:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-20 11:34:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-20 11:34:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-11-20 11:34:45,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-11-20 11:34:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:45,289 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-11-20 11:34:45,289 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-20 11:34:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-11-20 11:34:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:34:45,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:45,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:45,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:45,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:45,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-11-20 11:34:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:34:45,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490538316] [2022-11-20 11:34:45,493 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:34:45,493 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-20 11:34:45,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:34:45,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:45,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:45,602 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 11:34:45,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:34:45,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:34:45,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:46,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:34:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:34:46,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:34:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490538316] [2022-11-20 11:34:46,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490538316] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:46,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:34:46,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2022-11-20 11:34:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100782007] [2022-11-20 11:34:46,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:46,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:34:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:34:46,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:34:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:34:46,496 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-20 11:34:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:47,625 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-20 11:34:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:34:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:34:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:47,633 INFO L225 Difference]: With dead ends: 34 [2022-11-20 11:34:47,634 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:34:47,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:34:47,635 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:47,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 18 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:34:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:34:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-11-20 11:34:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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-20 11:34:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-11-20 11:34:47,645 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-11-20 11:34:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:47,645 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-11-20 11:34:47,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-20 11:34:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-11-20 11:34:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:34:47,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:47,647 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:47,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:47,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:47,850 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2022-11-20 11:34:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:34:47,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2886625] [2022-11-20 11:34:47,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:34:47,852 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-20 11:34:47,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:34:47,853 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:47,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:34:48,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 11:34:48,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:34:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 11:34:48,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:34:48,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:48,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-20 11:34:48,127 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 10 treesize of output 8 [2022-11-20 11:34:48,187 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 25 treesize of output 25 [2022-11-20 11:34:48,281 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 25 treesize of output 25 [2022-11-20 11:34:48,342 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 25 treesize of output 25 [2022-11-20 11:34:48,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:48,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 51 [2022-11-20 11:34:49,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:49,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 75 [2022-11-20 11:34:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:49,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:34:49,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:34:49,743 INFO L321 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-11-20 11:34:49,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 172 treesize of output 107 [2022-11-20 11:34:50,346 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-20 11:34:50,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 210 treesize of output 130 [2022-11-20 11:34:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:34:50,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:00,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:35:00,460 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:35:00,461 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 2 case distinctions, treesize of input 3069 treesize of output 1 [2022-11-20 11:35:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:35:00,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:35:00,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2886625] [2022-11-20 11:35:00,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2886625] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:00,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:35:00,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2022-11-20 11:35:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858707243] [2022-11-20 11:35:00,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:00,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 11:35:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:35:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 11:35:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2022-11-20 11:35:00,467 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 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-20 11:35:26,985 WARN L233 SmtUtils]: Spent 9.87s on a formula simplification. DAG size of input: 114 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:35:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:37,299 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-11-20 11:35:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 11:35:37,301 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 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 26 [2022-11-20 11:35:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:37,302 INFO L225 Difference]: With dead ends: 55 [2022-11-20 11:35:37,302 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 11:35:37,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=507, Invalid=2798, Unknown=1, NotChecked=0, Total=3306 [2022-11-20 11:35:37,304 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:37,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 39 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 299 Invalid, 0 Unknown, 62 Unchecked, 5.3s Time] [2022-11-20 11:35:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 11:35:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-11-20 11:35:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 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-20 11:35:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-11-20 11:35:37,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2022-11-20 11:35:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:37,328 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-11-20 11:35:37,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 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-20 11:35:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-11-20 11:35:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:35:37,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:37,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:37,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:37,537 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:35:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2022-11-20 11:35:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:35:37,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781132719] [2022-11-20 11:35:37,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:35:37,538 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-20 11:35:37,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:35:37,539 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:37,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:37,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:35:37,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:35:37,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:35:37,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:37,737 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 10 treesize of output 8 [2022-11-20 11:35:37,821 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-20 11:35:37,940 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 16 treesize of output 18 [2022-11-20 11:35:38,022 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 16 treesize of output 18 [2022-11-20 11:35:38,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 11:35:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:38,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:38,252 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 11:35:38,274 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (_ bv2 32))) is different from false [2022-11-20 11:35:38,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:38,380 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 24 treesize of output 25 [2022-11-20 11:35:38,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:35:38,395 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 34 [2022-11-20 11:35:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 11:35:38,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:35:38,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781132719] [2022-11-20 11:35:38,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781132719] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:38,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:35:38,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-20 11:35:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379953782] [2022-11-20 11:35:38,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:38,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:35:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:35:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:35:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=225, Unknown=4, NotChecked=62, Total=342 [2022-11-20 11:35:38,578 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:39,480 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-11-20 11:35:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:35:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:35:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:39,482 INFO L225 Difference]: With dead ends: 47 [2022-11-20 11:35:39,482 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:35:39,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=380, Unknown=4, NotChecked=82, Total=552 [2022-11-20 11:35:39,483 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:39,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 208 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2022-11-20 11:35:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:35:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-20 11:35:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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-20 11:35:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-20 11:35:39,495 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 26 [2022-11-20 11:35:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:39,495 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-20 11:35:39,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-20 11:35:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:35:39,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:39,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:39,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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)] Ended with exit code 0 [2022-11-20 11:35:39,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:39,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:35:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1421579903, now seen corresponding path program 3 times [2022-11-20 11:35:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:35:39,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405266015] [2022-11-20 11:35:39,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:35:39,712 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-20 11:35:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:35:39,713 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:39,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:39,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 11:35:39,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:35:39,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:35:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:40,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:41,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:35:41,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405266015] [2022-11-20 11:35:41,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405266015] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:41,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:35:41,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2022-11-20 11:35:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343021186] [2022-11-20 11:35:41,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:41,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:35:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:35:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:35:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-20 11:35:41,536 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-20 11:35:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:47,168 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-11-20 11:35:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 11:35:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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 29 [2022-11-20 11:35:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:47,170 INFO L225 Difference]: With dead ends: 116 [2022-11-20 11:35:47,170 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 11:35:47,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=718, Invalid=2588, Unknown=0, NotChecked=0, Total=3306 [2022-11-20 11:35:47,171 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 260 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:47,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 36 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 11:35:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 11:35:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-11-20 11:35:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 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-20 11:35:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-11-20 11:35:47,193 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 29 [2022-11-20 11:35:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:47,193 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-11-20 11:35:47,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-20 11:35:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-11-20 11:35:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:35:47,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:47,194 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:47,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:47,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:47,406 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:35:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 4 times [2022-11-20 11:35:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:35:47,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146632152] [2022-11-20 11:35:47,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:35:47,408 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-20 11:35:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:35:47,408 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:47,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:47,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:35:47,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:35:47,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:35:47,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:47,657 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 10 treesize of output 8 [2022-11-20 11:35:47,765 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-20 11:35:47,884 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 16 treesize of output 18 [2022-11-20 11:35:47,961 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 16 treesize of output 18 [2022-11-20 11:35:48,048 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 16 treesize of output 18 [2022-11-20 11:35:48,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 11:35:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:48,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:48,341 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (_ bv2 32))) is different from false [2022-11-20 11:35:48,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (_ bv2 32))) is different from false [2022-11-20 11:35:48,582 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 16 treesize of output 14 [2022-11-20 11:35:48,586 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 20 treesize of output 16 [2022-11-20 11:35:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-20 11:35:48,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:35:48,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146632152] [2022-11-20 11:35:48,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146632152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:48,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:35:48,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-11-20 11:35:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91019467] [2022-11-20 11:35:48,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:48,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 11:35:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:35:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:35:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=327, Unknown=2, NotChecked=74, Total=462 [2022-11-20 11:35:48,838 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:50,731 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-20 11:35:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:35:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 11:35:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:50,732 INFO L225 Difference]: With dead ends: 70 [2022-11-20 11:35:50,733 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:35:50,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=560, Unknown=2, NotChecked=98, Total=756 [2022-11-20 11:35:50,734 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:50,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 71 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 267 Invalid, 0 Unknown, 84 Unchecked, 1.6s Time] [2022-11-20 11:35:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:35:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2022-11-20 11:35:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 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-20 11:35:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-20 11:35:50,748 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2022-11-20 11:35:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:50,749 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-20 11:35:50,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-20 11:35:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:35:50,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:50,750 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:50,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:50,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:50,964 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:35:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1038743711, now seen corresponding path program 5 times [2022-11-20 11:35:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:35:50,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845925695] [2022-11-20 11:35:50,966 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:35:50,966 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-20 11:35:50,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:35:50,967 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:50,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:51,197 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-20 11:35:51,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:35:51,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:35:51,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:51,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:53,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:35:53,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845925695] [2022-11-20 11:35:53,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845925695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:53,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:35:53,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2022-11-20 11:35:53,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094395956] [2022-11-20 11:35:53,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:53,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:35:53,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:35:53,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:35:53,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:35:53,579 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:55,881 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-11-20 11:35:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:35:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 11:35:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:55,883 INFO L225 Difference]: With dead ends: 72 [2022-11-20 11:35:55,883 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 11:35:55,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2022-11-20 11:35:55,885 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 175 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:55,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 33 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:35:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 11:35:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-11-20 11:35:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-20 11:35:55,899 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 34 [2022-11-20 11:35:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:55,900 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-20 11:35:55,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-20 11:35:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:35:55,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:55,901 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:55,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:56,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:56,101 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:35:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash -539064675, now seen corresponding path program 6 times [2022-11-20 11:35:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:35:56,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394555164] [2022-11-20 11:35:56,102 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:35:56,102 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-20 11:35:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:35:56,103 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:56,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:56,461 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-20 11:35:56,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:35:56,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 11:35:56,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:56,483 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 10 treesize of output 8 [2022-11-20 11:35:56,628 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-20 11:35:56,752 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 16 treesize of output 18 [2022-11-20 11:35:56,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:35:56,924 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 16 treesize of output 18 [2022-11-20 11:35:57,005 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 16 treesize of output 18 [2022-11-20 11:35:57,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 11:35:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:57,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:35:57,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 11:35:57,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 11:35:57,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-20 11:35:57,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-20 11:35:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-11-20 11:35:58,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:35:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394555164] [2022-11-20 11:35:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394555164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:35:58,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:35:58,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-11-20 11:35:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639212512] [2022-11-20 11:35:58,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:35:58,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:35:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:35:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:35:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=485, Unknown=2, NotChecked=90, Total=650 [2022-11-20 11:35:58,066 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:35:59,559 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-11-20 11:35:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:35:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:35:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:35:59,561 INFO L225 Difference]: With dead ends: 51 [2022-11-20 11:35:59,561 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 11:35:59,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=821, Unknown=2, NotChecked=118, Total=1056 [2022-11-20 11:35:59,562 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:35:59,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 92 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 438 Invalid, 0 Unknown, 132 Unchecked, 1.1s Time] [2022-11-20 11:35:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 11:35:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-11-20 11:35:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-20 11:35:59,579 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2022-11-20 11:35:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:35:59,579 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-20 11:35:59,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:35:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-20 11:35:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:35:59,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:35:59,581 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:35:59,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:35:59,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:59,795 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:35:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:35:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 523206789, now seen corresponding path program 7 times [2022-11-20 11:35:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:35:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256872174] [2022-11-20 11:35:59,796 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:35:59,796 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-20 11:35:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:35:59,797 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:35:59,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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 (17)] Waiting until timeout for monitored process [2022-11-20 11:35:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:00,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 11:36:00,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:00,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:02,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:36:02,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256872174] [2022-11-20 11:36:02,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256872174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:02,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:36:02,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2022-11-20 11:36:02,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525509671] [2022-11-20 11:36:02,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:02,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 11:36:02,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:36:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 11:36:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-11-20 11:36:02,198 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:05,112 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-11-20 11:36:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:36:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:36:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:05,114 INFO L225 Difference]: With dead ends: 74 [2022-11-20 11:36:05,114 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 11:36:05,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=451, Invalid=1805, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 11:36:05,116 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 253 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:05,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 25 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 11:36:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 11:36:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-11-20 11:36:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 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-20 11:36:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-20 11:36:05,130 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2022-11-20 11:36:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:05,130 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-20 11:36:05,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-20 11:36:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:36:05,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:05,131 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:05,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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 (17)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:05,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:36:05,334 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:36:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -495320761, now seen corresponding path program 8 times [2022-11-20 11:36:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:36:05,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436597983] [2022-11-20 11:36:05,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:36:05,335 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-20 11:36:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:36:05,337 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:36:05,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-20 11:36:05,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:36:05,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:36:05,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:36:05,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:05,598 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 10 treesize of output 8 [2022-11-20 11:36:05,803 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-20 11:36:05,949 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 16 treesize of output 18 [2022-11-20 11:36:06,044 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 16 treesize of output 18 [2022-11-20 11:36:06,135 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 16 treesize of output 18 [2022-11-20 11:36:06,244 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 16 treesize of output 18 [2022-11-20 11:36:06,345 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 16 treesize of output 18 [2022-11-20 11:36:06,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 11:36:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:06,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:06,665 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 11:36:06,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (_ bv2 32))) is different from false [2022-11-20 11:36:06,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~a~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 11:36:06,874 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (_ bv2 32))) is different from false [2022-11-20 11:36:06,978 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 16 treesize of output 14 [2022-11-20 11:36:06,983 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 20 treesize of output 16 [2022-11-20 11:36:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2022-11-20 11:36:07,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:36:07,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436597983] [2022-11-20 11:36:07,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436597983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:07,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:36:07,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-11-20 11:36:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613319451] [2022-11-20 11:36:07,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:07,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:36:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:36:07,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:36:07,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=578, Unknown=5, NotChecked=204, Total=870 [2022-11-20 11:36:07,457 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:10,005 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-11-20 11:36:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:36:10,006 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-20 11:36:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:10,006 INFO L225 Difference]: With dead ends: 53 [2022-11-20 11:36:10,006 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 11:36:10,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=130, Invalid=1003, Unknown=5, NotChecked=268, Total=1406 [2022-11-20 11:36:10,008 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:10,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 525 Invalid, 0 Unknown, 190 Unchecked, 2.0s Time] [2022-11-20 11:36:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 11:36:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-11-20 11:36:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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-20 11:36:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-20 11:36:10,024 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2022-11-20 11:36:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:10,025 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-20 11:36:10,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-20 11:36:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 11:36:10,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:10,026 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:10,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-20 11:36:10,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:36:10,241 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:36:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 7 times [2022-11-20 11:36:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:36:10,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702218057] [2022-11-20 11:36:10,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:36:10,242 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-20 11:36:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:36:10,243 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:36:10,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-20 11:36:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:36:10,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 11:36:10,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:11,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:13,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:36:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702218057] [2022-11-20 11:36:13,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702218057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:36:13,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:36:13,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2022-11-20 11:36:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454047231] [2022-11-20 11:36:13,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:36:13,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 11:36:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:36:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 11:36:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2022-11-20 11:36:13,202 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:36:16,893 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-11-20 11:36:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 11:36:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-20 11:36:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:36:16,901 INFO L225 Difference]: With dead ends: 77 [2022-11-20 11:36:16,901 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 11:36:16,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=573, Invalid=2507, Unknown=0, NotChecked=0, Total=3080 [2022-11-20 11:36:16,903 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 232 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:36:16,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 39 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-20 11:36:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 11:36:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-20 11:36:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-11-20 11:36:16,921 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2022-11-20 11:36:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:36:16,921 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-11-20 11:36:16,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:36:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-11-20 11:36:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:36:16,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:36:16,922 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:36:16,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-20 11:36:17,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:36:17,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:36:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:36:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash -111213349, now seen corresponding path program 8 times [2022-11-20 11:36:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:36:17,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519461993] [2022-11-20 11:36:17,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:36:17,127 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-20 11:36:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:36:17,129 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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-20 11:36:17,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02070a94-f8c0-410b-8782-5c89424ab396/bin/uautomizer-ug76WZFUDN/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 (20)] Waiting until timeout for monitored process [2022-11-20 11:36:17,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:36:17,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:36:17,383 WARN L261 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 11:36:17,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:36:17,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 10 treesize of output 8 [2022-11-20 11:36:17,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:36:17,471 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 18 treesize of output 19 [2022-11-20 11:36:17,535 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 25 treesize of output 25 [2022-11-20 11:36:17,629 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 25 treesize of output 25 [2022-11-20 11:36:17,764 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 25 treesize of output 25 [2022-11-20 11:36:17,870 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 25 treesize of output 25 [2022-11-20 11:36:18,058 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 25 treesize of output 25 [2022-11-20 11:36:18,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 25 treesize of output 25 [2022-11-20 11:36:18,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:18,480 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 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 11:36:19,312 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:36:19,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 63 [2022-11-20 11:36:19,908 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 11:36:19,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 92 [2022-11-20 11:36:20,799 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-20 11:36:20,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 173 treesize of output 127 [2022-11-20 11:36:21,783 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-20 11:36:21,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 262 treesize of output 195 [2022-11-20 11:36:23,009 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-11-20 11:36:23,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 419 treesize of output 319 [2022-11-20 11:36:24,568 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-20 11:36:24,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 736 treesize of output 555 [2022-11-20 11:36:26,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:26,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 1346 treesize of output 1001 [2022-11-20 11:36:27,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:36:27,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 1976 treesize of output 1834 [2022-11-20 11:36:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:36:27,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:40:03,503 WARN L233 SmtUtils]: Spent 14.88s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:40:12,878 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (let ((.cse32 (bvadd (concat (select .cse31 .cse6) (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) .cse14)))) (let ((.cse30 ((_ extract 31 0) .cse32)) (.cse29 ((_ extract 63 32) .cse32))) (let ((.cse27 (store (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse30) .cse6 .cse29))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse7)))) (let ((.cse28 (bvadd ((_ sign_extend 32) .cse0) (concat .cse29 .cse30)))) (let ((.cse26 ((_ extract 31 0) .cse28)) (.cse25 ((_ extract 63 32) .cse28))) (let ((.cse23 (store (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26) .cse6 .cse25))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse7)))) (let ((.cse24 (bvadd ((_ sign_extend 32) .cse12) (concat .cse25 .cse26)))) (let ((.cse22 ((_ extract 31 0) .cse24)) (.cse21 ((_ extract 63 32) .cse24))) (let ((.cse19 (store (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse22) .cse6 .cse21))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse19) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) .cse7)))) (let ((.cse20 (bvadd ((_ sign_extend 32) .cse11) (concat .cse21 .cse22)))) (let ((.cse18 ((_ extract 31 0) .cse20)) (.cse17 ((_ extract 63 32) .cse20))) (let ((.cse15 (store (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse18) .cse6 .cse17))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse15) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (let ((.cse16 (bvadd (concat .cse17 .cse18) ((_ sign_extend 32) .cse13)))) (let ((.cse10 ((_ extract 31 0) .cse16)) (.cse9 ((_ extract 63 32) .cse16))) (let ((.cse5 (store (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse10) .cse6 .cse9))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32) .cse7)))) (or (not (= (_ bv2 32) .cse0)) (not (= (_ bv2 32) .cse1)) (= ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))) (let ((.cse2 (let ((.cse8 (bvadd ((_ sign_extend 32) .cse1) (concat .cse9 .cse10)))) (let ((.cse4 ((_ extract 31 0) .cse8)) (.cse3 ((_ extract 63 32) .cse8))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse6 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32) .cse7)))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (= (_ bv2 32) .cse11)) (not (= (_ bv2 32) .cse12)) (not (= (_ bv2 32) .cse13)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))) is different from false [2022-11-20 11:42:05,969 WARN L233 SmtUtils]: Spent 7.61s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:42:15,167 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (bvadd (concat (select .cse30 .cse6) (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) .cse12)))) (let ((.cse29 ((_ extract 31 0) .cse31)) (.cse28 ((_ extract 63 32) .cse31))) (let ((.cse26 (store (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29) .cse6 .cse28))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (let ((.cse27 (bvadd ((_ sign_extend 32) .cse13) (concat .cse28 .cse29)))) (let ((.cse25 ((_ extract 31 0) .cse27)) (.cse24 ((_ extract 63 32) .cse27))) (let ((.cse22 (store (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25) .cse6 .cse24))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))))) (let ((.cse23 (bvadd (concat .cse24 .cse25) ((_ sign_extend 32) .cse0)))) (let ((.cse21 ((_ extract 31 0) .cse23)) (.cse20 ((_ extract 63 32) .cse23))) (let ((.cse18 (store (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse21) .cse6 .cse20))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse19 (bvadd (concat .cse20 .cse21) ((_ sign_extend 32) .cse10)))) (let ((.cse17 ((_ extract 31 0) .cse19)) (.cse16 ((_ extract 63 32) .cse19))) (let ((.cse14 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse6 .cse16))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (bvadd ((_ sign_extend 32) .cse11) (concat .cse16 .cse17)))) (let ((.cse9 ((_ extract 31 0) .cse15)) (.cse8 ((_ extract 63 32) .cse15))) (let ((.cse5 (store (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9) .cse6 .cse8))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) .cse0)) (not (= .cse1 (_ bv2 32))) (= ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))) (let ((.cse2 (let ((.cse7 (bvadd ((_ sign_extend 32) .cse1) (concat .cse8 .cse9)))) (let ((.cse4 ((_ extract 31 0) .cse7)) (.cse3 ((_ extract 63 32) .cse7))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse6 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (= (_ bv2 32) .cse10)) (not (= (_ bv2 32) .cse11)) (not (= (_ bv2 32) .cse12)) (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (not (= .cse13 (_ bv2 32))))))))))))))))))))))))) is different from false [2022-11-20 11:42:26,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (bvadd (concat (select .cse30 .cse6) (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) .cse12)))) (let ((.cse29 ((_ extract 31 0) .cse31)) (.cse28 ((_ extract 63 32) .cse31))) (let ((.cse26 (store (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse29) .cse6 .cse28))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (let ((.cse27 (bvadd ((_ sign_extend 32) .cse13) (concat .cse28 .cse29)))) (let ((.cse25 ((_ extract 31 0) .cse27)) (.cse24 ((_ extract 63 32) .cse27))) (let ((.cse22 (store (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25) .cse6 .cse24))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))))) (let ((.cse23 (bvadd (concat .cse24 .cse25) ((_ sign_extend 32) .cse0)))) (let ((.cse21 ((_ extract 31 0) .cse23)) (.cse20 ((_ extract 63 32) .cse23))) (let ((.cse18 (store (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse21) .cse6 .cse20))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse19 (bvadd (concat .cse20 .cse21) ((_ sign_extend 32) .cse10)))) (let ((.cse17 ((_ extract 31 0) .cse19)) (.cse16 ((_ extract 63 32) .cse19))) (let ((.cse14 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse6 .cse16))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (bvadd ((_ sign_extend 32) .cse11) (concat .cse16 .cse17)))) (let ((.cse9 ((_ extract 31 0) .cse15)) (.cse8 ((_ extract 63 32) .cse15))) (let ((.cse5 (store (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9) .cse6 .cse8))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) .cse0)) (not (= .cse1 (_ bv2 32))) (= ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))) (let ((.cse2 (let ((.cse7 (bvadd ((_ sign_extend 32) .cse1) (concat .cse8 .cse9)))) (let ((.cse4 ((_ extract 31 0) .cse7)) (.cse3 ((_ extract 63 32) .cse7))) (bvadd (concat .cse3 .cse4) ((_ sign_extend 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4) .cse6 .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (= (_ bv2 32) .cse10)) (not (= (_ bv2 32) .cse11)) (not (= (_ bv2 32) .cse12)) (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (= .cse13 (_ bv2 32))))))))))))))))))))))))) is different from false [2022-11-20 11:43:30,478 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:45:12,613 WARN L233 SmtUtils]: Spent 34.17s on a formula simplification. DAG size of input: 23 DAG size of output: 20 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 11:45:12,613 INFO L321 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-11-20 11:45:12,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1774141 treesize of output 1052425 [2022-11-20 11:45:59,039 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 ((_ sign_extend 32) (_ bv2 32))) (.cse35 (= (bvadd (_ bv4 32) .cse0) (_ bv0 32)))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse32 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse9) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse9 .cse30))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) .cse1)))) (let ((.cse27 ((_ extract 31 0) .cse29)) (.cse26 ((_ extract 63 32) .cse29))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse9 .cse26))) (let ((.cse15 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse25 (bvadd ((_ sign_extend 32) .cse15) (concat .cse26 .cse27)))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse9 .cse22))) (let ((.cse14 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse21 (bvadd ((_ sign_extend 32) .cse14) (concat .cse22 .cse23)))) (let ((.cse19 ((_ extract 31 0) .cse21)) (.cse18 ((_ extract 63 32) .cse21))) (let ((.cse16 (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse9 .cse18))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) .cse2)))) (let ((.cse12 ((_ extract 31 0) .cse17)) (.cse11 ((_ extract 63 32) .cse17))) (let ((.cse8 (store (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse9 .cse11))) (let ((.cse13 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse0)))) (not (= .cse1 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse2)) (= .cse3 (let ((.cse4 (let ((.cse10 (bvadd (concat .cse11 .cse12) ((_ sign_extend 32) .cse13)))) (let ((.cse6 ((_ extract 31 0) .cse10)) (.cse5 ((_ extract 63 32) .cse10))) (bvadd (concat .cse5 .cse6) ((_ sign_extend 32) (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6) .cse9 .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4)))) (not (= (_ bv2 32) .cse14)) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse13)))))))))))))))))))))))))) .cse35) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse9) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse9 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse9 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse9 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse9 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse9 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse0)))) (not (= .cse36 (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse3 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse9 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))) (not .cse35))))) (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from false [2022-11-20 11:46:01,064 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 ((_ sign_extend 32) (_ bv2 32))) (.cse35 (= (bvadd (_ bv4 32) .cse0) (_ bv0 32)))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse32 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse9) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse9 .cse30))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) .cse1)))) (let ((.cse27 ((_ extract 31 0) .cse29)) (.cse26 ((_ extract 63 32) .cse29))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse9 .cse26))) (let ((.cse15 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse25 (bvadd ((_ sign_extend 32) .cse15) (concat .cse26 .cse27)))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse9 .cse22))) (let ((.cse14 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse21 (bvadd ((_ sign_extend 32) .cse14) (concat .cse22 .cse23)))) (let ((.cse19 ((_ extract 31 0) .cse21)) (.cse18 ((_ extract 63 32) .cse21))) (let ((.cse16 (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse9 .cse18))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) .cse2)))) (let ((.cse12 ((_ extract 31 0) .cse17)) (.cse11 ((_ extract 63 32) .cse17))) (let ((.cse8 (store (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse9 .cse11))) (let ((.cse13 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse0)))) (not (= .cse1 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse2)) (= .cse3 (let ((.cse4 (let ((.cse10 (bvadd (concat .cse11 .cse12) ((_ sign_extend 32) .cse13)))) (let ((.cse6 ((_ extract 31 0) .cse10)) (.cse5 ((_ extract 63 32) .cse10))) (bvadd (concat .cse5 .cse6) ((_ sign_extend 32) (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6) .cse9 .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4)))) (not (= (_ bv2 32) .cse14)) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse13)))))))))))))))))))))))))) .cse35) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse9) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse9 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse9 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse9 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse9 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse9 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse0)))) (not (= .cse36 (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse3 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse9 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))) (not .cse35))))) (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2022-11-20 11:46:18,143 WARN L837 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (bvadd (_ bv8 32) .cse1) (_ bv0 32))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 ((_ sign_extend 32) (_ bv2 32)))) (and (or (not .cse0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse33 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse10 .cse31))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse30 (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) .cse2)))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse10 .cse27))) (let ((.cse16 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse26 (bvadd ((_ sign_extend 32) .cse16) (concat .cse27 .cse28)))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse10 .cse23))) (let ((.cse15 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse22 (bvadd ((_ sign_extend 32) .cse15) (concat .cse23 .cse24)))) (let ((.cse20 ((_ extract 31 0) .cse22)) (.cse19 ((_ extract 63 32) .cse22))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse10 .cse19))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) .cse3)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (let ((.cse9 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse10 .cse12))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse2 (_ bv2 32))) (not (= (_ bv2 32) .cse3)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse12 .cse13) ((_ sign_extend 32) .cse14)))) (let ((.cse7 ((_ extract 31 0) .cse11)) (.cse6 ((_ extract 63 32) .cse11))) (bvadd (concat .cse6 .cse7) ((_ sign_extend 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse10 .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse16)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))))) (or .cse0 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse10) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse10 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse10 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse10 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse10 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse10 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse4 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse10 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from false [2022-11-20 11:46:20,166 WARN L859 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (bvadd (_ bv8 32) .cse1) (_ bv0 32))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 ((_ sign_extend 32) (_ bv2 32)))) (and (or (not .cse0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse33 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse10 .cse31))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse30 (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) .cse2)))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse10 .cse27))) (let ((.cse16 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse26 (bvadd ((_ sign_extend 32) .cse16) (concat .cse27 .cse28)))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse10 .cse23))) (let ((.cse15 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse22 (bvadd ((_ sign_extend 32) .cse15) (concat .cse23 .cse24)))) (let ((.cse20 ((_ extract 31 0) .cse22)) (.cse19 ((_ extract 63 32) .cse22))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse10 .cse19))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) .cse3)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (let ((.cse9 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse10 .cse12))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse2 (_ bv2 32))) (not (= (_ bv2 32) .cse3)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse12 .cse13) ((_ sign_extend 32) .cse14)))) (let ((.cse7 ((_ extract 31 0) .cse11)) (.cse6 ((_ extract 63 32) .cse11))) (bvadd (concat .cse6 .cse7) ((_ sign_extend 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse10 .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse16)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))))) (or .cse0 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse10) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse10 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse10 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse10 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse10 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse10 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse4 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse10 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2022-11-20 11:46:40,530 WARN L837 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (bvadd (_ bv8 32) .cse1) (_ bv0 32))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 ((_ sign_extend 32) (_ bv2 32)))) (and (or (not .cse0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse33 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse10 .cse31))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse30 (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) .cse2)))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse10 .cse27))) (let ((.cse16 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse26 (bvadd ((_ sign_extend 32) .cse16) (concat .cse27 .cse28)))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse10 .cse23))) (let ((.cse15 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse22 (bvadd ((_ sign_extend 32) .cse15) (concat .cse23 .cse24)))) (let ((.cse20 ((_ extract 31 0) .cse22)) (.cse19 ((_ extract 63 32) .cse22))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse10 .cse19))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) .cse3)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (let ((.cse9 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse10 .cse12))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse2 (_ bv2 32))) (not (= (_ bv2 32) .cse3)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse12 .cse13) ((_ sign_extend 32) .cse14)))) (let ((.cse7 ((_ extract 31 0) .cse11)) (.cse6 ((_ extract 63 32) .cse11))) (bvadd (concat .cse6 .cse7) ((_ sign_extend 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse10 .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse16)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))))) (or .cse0 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse10) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse10 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse10 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse10 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse10 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse10 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse4 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse10 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) is different from false [2022-11-20 11:46:42,552 WARN L859 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (bvadd (_ bv8 32) .cse1) (_ bv0 32))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 ((_ sign_extend 32) (_ bv2 32)))) (and (or (not .cse0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse33 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse10 .cse31))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse30 (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) .cse2)))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse10 .cse27))) (let ((.cse16 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse26 (bvadd ((_ sign_extend 32) .cse16) (concat .cse27 .cse28)))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse10 .cse23))) (let ((.cse15 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse22 (bvadd ((_ sign_extend 32) .cse15) (concat .cse23 .cse24)))) (let ((.cse20 ((_ extract 31 0) .cse22)) (.cse19 ((_ extract 63 32) .cse22))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse10 .cse19))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) .cse3)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (let ((.cse9 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse10 .cse12))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse2 (_ bv2 32))) (not (= (_ bv2 32) .cse3)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse12 .cse13) ((_ sign_extend 32) .cse14)))) (let ((.cse7 ((_ extract 31 0) .cse11)) (.cse6 ((_ extract 63 32) .cse11))) (bvadd (concat .cse6 .cse7) ((_ sign_extend 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse10 .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse16)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))))) (or .cse0 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse10) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse10 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse10 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse10 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse10 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse10 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (_ bv2 32) (select v_arrayElimArr_6 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse4 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse10 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) is different from true [2022-11-20 11:46:59,929 WARN L859 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (_ bv0 32) (bvadd (_ bv12 32) .cse1))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 ((_ sign_extend 32) (_ bv2 32)))) (and (or (not .cse0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse33 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse10 .cse31))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse30 (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) .cse2)))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse10 .cse27))) (let ((.cse16 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse26 (bvadd ((_ sign_extend 32) .cse16) (concat .cse27 .cse28)))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse10 .cse23))) (let ((.cse15 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse22 (bvadd ((_ sign_extend 32) .cse15) (concat .cse23 .cse24)))) (let ((.cse20 ((_ extract 31 0) .cse22)) (.cse19 ((_ extract 63 32) .cse22))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse10 .cse19))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) .cse3)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (let ((.cse9 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse10 .cse12))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (select v_arrayElimArr_6 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) .cse1)) (_ bv2 32))) (not (= .cse2 (_ bv2 32))) (not (= (_ bv2 32) .cse3)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse12 .cse13) ((_ sign_extend 32) .cse14)))) (let ((.cse7 ((_ extract 31 0) .cse11)) (.cse6 ((_ extract 63 32) .cse11))) (bvadd (concat .cse6 .cse7) ((_ sign_extend 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse10 .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse16)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))))) (or .cse0 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse10) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse10 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse10 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse10 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse10 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse10 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (select v_arrayElimArr_6 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) .cse1)) (_ bv2 32))) (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse4 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse10 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2022-11-20 11:47:18,313 WARN L859 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (_ bv0 32) (bvadd (_ bv12 32) .cse1))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 ((_ sign_extend 32) (_ bv2 32)))) (and (or (not .cse0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse33 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse10 .cse31))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse30 (bvadd (concat .cse31 .cse32) ((_ sign_extend 32) .cse2)))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse10 .cse27))) (let ((.cse16 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse26 (bvadd ((_ sign_extend 32) .cse16) (concat .cse27 .cse28)))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse10 .cse23))) (let ((.cse15 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse22 (bvadd ((_ sign_extend 32) .cse15) (concat .cse23 .cse24)))) (let ((.cse20 ((_ extract 31 0) .cse22)) (.cse19 ((_ extract 63 32) .cse22))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse20) .cse10 .cse19))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse18 (bvadd (concat .cse19 .cse20) ((_ sign_extend 32) .cse3)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (let ((.cse9 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse10 .cse12))) (let ((.cse14 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (select v_arrayElimArr_6 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) .cse1)) (_ bv2 32))) (not (= .cse2 (_ bv2 32))) (not (= (_ bv2 32) .cse3)) (= .cse4 (let ((.cse5 (let ((.cse11 (bvadd (concat .cse12 .cse13) ((_ sign_extend 32) .cse14)))) (let ((.cse7 ((_ extract 31 0) .cse11)) (.cse6 ((_ extract 63 32) .cse11))) (bvadd (concat .cse6 .cse7) ((_ sign_extend 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse7) .cse10 .cse6)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (not (= (_ bv2 32) .cse15)) (not (= (_ bv2 32) .cse16)) (not (= (_ bv2 32) .cse14))))))))))))))))))))))))))) (or .cse0 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse10) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse35))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse10 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse10 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse10 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse10 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse10 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= (select v_arrayElimArr_6 (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32) .cse1)) (_ bv2 32))) (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse4 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse10 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2022-11-20 11:47:35,586 WARN L837 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse15 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse35 (= (bvadd (_ bv16 32) .cse15) (_ bv0 32))) (.cse2 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 ((_ sign_extend 32) (_ bv2 32)))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse32 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse8) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse8 .cse30))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) .cse0)))) (let ((.cse27 ((_ extract 31 0) .cse29)) (.cse26 ((_ extract 63 32) .cse29))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse8 .cse26))) (let ((.cse14 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse25 (bvadd ((_ sign_extend 32) .cse14) (concat .cse26 .cse27)))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse8 .cse22))) (let ((.cse13 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse21 (bvadd ((_ sign_extend 32) .cse13) (concat .cse22 .cse23)))) (let ((.cse19 ((_ extract 31 0) .cse21)) (.cse18 ((_ extract 63 32) .cse21))) (let ((.cse16 (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse8 .cse18))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) .cse1)))) (let ((.cse11 ((_ extract 31 0) .cse17)) (.cse10 ((_ extract 63 32) .cse17))) (let ((.cse7 (store (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11) .cse8 .cse10))) (let ((.cse12 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= .cse0 (_ bv2 32))) (not (= (_ bv2 32) .cse1)) (= .cse2 (let ((.cse3 (let ((.cse9 (bvadd (concat .cse10 .cse11) ((_ sign_extend 32) .cse12)))) (let ((.cse5 ((_ extract 31 0) .cse9)) (.cse4 ((_ extract 63 32) .cse9))) (bvadd (concat .cse4 .cse5) ((_ sign_extend 32) (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5) .cse8 .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3)))) (not (= (_ bv2 32) .cse13)) (not (= (_ bv2 32) .cse14)) (not (= (select v_arrayElimArr_6 (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset| .cse15)) (_ bv2 32))) (not (= (_ bv2 32) .cse12)))))))))))))))))))))))))) (not .cse35)) (or .cse35 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse8) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse8 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse8 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse8 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse8 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse8 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse2 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse8 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (select v_arrayElimArr_6 (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset| .cse15)) (_ bv2 32))) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from false [2022-11-20 11:47:37,605 WARN L859 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse15 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse35 (= (bvadd (_ bv16 32) .cse15) (_ bv0 32))) (.cse2 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 ((_ sign_extend 32) (_ bv2 32)))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse32 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse8) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse8 .cse30))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) .cse0)))) (let ((.cse27 ((_ extract 31 0) .cse29)) (.cse26 ((_ extract 63 32) .cse29))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse8 .cse26))) (let ((.cse14 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse25 (bvadd ((_ sign_extend 32) .cse14) (concat .cse26 .cse27)))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse8 .cse22))) (let ((.cse13 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse21 (bvadd ((_ sign_extend 32) .cse13) (concat .cse22 .cse23)))) (let ((.cse19 ((_ extract 31 0) .cse21)) (.cse18 ((_ extract 63 32) .cse21))) (let ((.cse16 (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse8 .cse18))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) .cse1)))) (let ((.cse11 ((_ extract 31 0) .cse17)) (.cse10 ((_ extract 63 32) .cse17))) (let ((.cse7 (store (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11) .cse8 .cse10))) (let ((.cse12 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= .cse0 (_ bv2 32))) (not (= (_ bv2 32) .cse1)) (= .cse2 (let ((.cse3 (let ((.cse9 (bvadd (concat .cse10 .cse11) ((_ sign_extend 32) .cse12)))) (let ((.cse5 ((_ extract 31 0) .cse9)) (.cse4 ((_ extract 63 32) .cse9))) (bvadd (concat .cse4 .cse5) ((_ sign_extend 32) (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5) .cse8 .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3)))) (not (= (_ bv2 32) .cse13)) (not (= (_ bv2 32) .cse14)) (not (= (select v_arrayElimArr_6 (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset| .cse15)) (_ bv2 32))) (not (= (_ bv2 32) .cse12)))))))))))))))))))))))))) (not .cse35)) (or .cse35 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse65 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (bvadd (concat (select .cse65 .cse8) (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse34))) (let ((.cse64 ((_ extract 31 0) .cse66)) (.cse63 ((_ extract 63 32) .cse66))) (let ((.cse61 (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse8 .cse63))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) .cse36)))) (let ((.cse60 ((_ extract 31 0) .cse62)) (.cse59 ((_ extract 63 32) .cse62))) (let ((.cse57 (store (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60) .cse8 .cse59))) (let ((.cse48 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse57) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse58 (bvadd ((_ sign_extend 32) .cse48) (concat .cse59 .cse60)))) (let ((.cse56 ((_ extract 31 0) .cse58)) (.cse55 ((_ extract 63 32) .cse58))) (let ((.cse53 (store (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse56) .cse8 .cse55))) (let ((.cse47 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))))) (let ((.cse54 (bvadd ((_ sign_extend 32) .cse47) (concat .cse55 .cse56)))) (let ((.cse52 ((_ extract 31 0) .cse54)) (.cse51 ((_ extract 63 32) .cse54))) (let ((.cse49 (store (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse8 .cse51))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse49) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) .cse37)))) (let ((.cse45 ((_ extract 31 0) .cse50)) (.cse44 ((_ extract 63 32) .cse50))) (let ((.cse42 (store (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse8 .cse44))) (let ((.cse46 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32))))) (or (not (= .cse36 (_ bv2 32))) (not (= (select v_arrayElimArr_6 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv2 32) .cse37)) (= .cse2 (let ((.cse38 (let ((.cse43 (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) .cse46)))) (let ((.cse40 ((_ extract 31 0) .cse43)) (.cse39 ((_ extract 63 32) .cse43))) (bvadd (concat .cse39 .cse40) ((_ sign_extend 32) (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse40) .cse8 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |ULTIMATE.start_main_~a~0#1.offset| (_ bv24 32))))))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))) (not (= (_ bv2 32) .cse47)) (not (= (_ bv2 32) .cse48)) (not (= (select v_arrayElimArr_6 (bvadd (_ bv16 32) |ULTIMATE.start_main_~a~0#1.offset| .cse15)) (_ bv2 32))) (not (= (_ bv2 32) .cse46)))))))))))))))))))))))))))))) (not (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true