./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:17:59,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:17:59,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:17:59,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:17:59,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:17:59,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:17:59,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:17:59,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:17:59,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:17:59,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:17:59,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:17:59,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:17:59,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:17:59,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:17:59,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:17:59,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:17:59,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:17:59,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:17:59,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:17:59,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:17:59,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:17:59,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:17:59,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:17:59,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:17:59,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:17:59,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:17:59,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:17:59,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:17:59,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:17:59,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:17:59,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:17:59,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:17:59,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:17:59,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:17:59,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:17:59,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:17:59,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:17:59,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:17:59,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:17:59,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:17:59,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:17:59,721 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:17:59,761 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:17:59,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:17:59,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:17:59,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:17:59,764 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:17:59,764 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:17:59,764 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:17:59,764 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:17:59,765 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:17:59,765 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:17:59,766 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:17:59,766 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:17:59,766 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:17:59,767 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:17:59,767 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:17:59,767 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:17:59,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:17:59,768 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:17:59,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:17:59,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:17:59,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:17:59,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:17:59,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:17:59,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:17:59,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:17:59,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:17:59,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:17:59,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:17:59,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:17:59,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:17:59,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:17:59,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:17:59,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:17:59,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:17:59,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:17:59,773 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:17:59,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:17:59,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:17:59,774 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:17:59,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:17:59,774 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 [2021-11-19 14:18:00,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:18:00,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:18:00,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:18:00,078 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:18:00,079 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:18:00,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2021-11-19 14:18:00,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/e45631d48/c31684a049804dc48e2f8a3de7f527c0/FLAGf8543f2fc [2021-11-19 14:18:00,620 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:18:00,620 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2021-11-19 14:18:00,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/e45631d48/c31684a049804dc48e2f8a3de7f527c0/FLAGf8543f2fc [2021-11-19 14:18:01,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/e45631d48/c31684a049804dc48e2f8a3de7f527c0 [2021-11-19 14:18:01,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:18:01,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:18:01,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:18:01,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:18:01,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:18:01,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1c7bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01, skipping insertion in model container [2021-11-19 14:18:01,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:18:01,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:18:01,232 WARN L230 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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c[712,725] [2021-11-19 14:18:01,247 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:18:01,255 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:18:01,267 WARN L230 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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c[712,725] [2021-11-19 14:18:01,271 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:18:01,281 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:18:01,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01 WrapperNode [2021-11-19 14:18:01,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:18:01,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:18:01,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:18:01,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:18:01,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,327 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2021-11-19 14:18:01,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:18:01,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:18:01,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:18:01,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:18:01,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:18:01,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:18:01,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:18:01,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:18:01,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (1/1) ... [2021-11-19 14:18:01,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:18:01,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:18:01,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:18:01,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:18:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:18:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:18:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:18:01,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:18:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-19 14:18:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-19 14:18:01,512 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:18:01,515 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:18:01,629 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:18:01,641 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:18:01,641 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 14:18:01,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:01 BoogieIcfgContainer [2021-11-19 14:18:01,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:18:01,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:18:01,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:18:01,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:18:01,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:18:01" (1/3) ... [2021-11-19 14:18:01,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644ee4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:18:01, skipping insertion in model container [2021-11-19 14:18:01,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:01" (2/3) ... [2021-11-19 14:18:01,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644ee4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:18:01, skipping insertion in model container [2021-11-19 14:18:01,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:01" (3/3) ... [2021-11-19 14:18:01,652 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound2.c [2021-11-19 14:18:01,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:18:01,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:18:01,706 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:18:01,713 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 14:18:01,714 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:18:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:18:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-19 14:18:01,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:18:01,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-19 14:18:01,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:18:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:18:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2109616992, now seen corresponding path program 1 times [2021-11-19 14:18:01,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:18:01,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146780664] [2021-11-19 14:18:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:18:01,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:18:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:18:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:18:01,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:18:01,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146780664] [2021-11-19 14:18:01,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146780664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:18:01,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:18:01,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 14:18:01,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122922303] [2021-11-19 14:18:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:18:01,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:18:01,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:18:01,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:18:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:18:01,935 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:18:01,991 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-11-19 14:18:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:18:02,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-19 14:18:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:18:02,013 INFO L225 Difference]: With dead ends: 27 [2021-11-19 14:18:02,013 INFO L226 Difference]: Without dead ends: 12 [2021-11-19 14:18:02,016 INFO L932 BasicCegarLoop]: 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 [2021-11-19 14:18:02,020 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:18:02,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:18:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-19 14:18:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-19 14:18:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 14:18:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-19 14:18:02,055 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2021-11-19 14:18:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:18:02,055 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-19 14:18:02,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-19 14:18:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 14:18:02,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:18:02,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:18:02,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:18:02,057 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:18:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:18:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 574117089, now seen corresponding path program 1 times [2021-11-19 14:18:02,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:18:02,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308428092] [2021-11-19 14:18:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:18:02,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:18:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:18:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:18:02,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:18:02,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308428092] [2021-11-19 14:18:02,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308428092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:18:02,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:18:02,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 14:18:02,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463498106] [2021-11-19 14:18:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:18:02,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:18:02,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:18:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:18:02,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:18:02,132 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:18:02,164 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-11-19 14:18:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:18:02,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-19 14:18:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:18:02,165 INFO L225 Difference]: With dead ends: 21 [2021-11-19 14:18:02,166 INFO L226 Difference]: Without dead ends: 14 [2021-11-19 14:18:02,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 14:18:02,168 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:18:02,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:18:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-19 14:18:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-19 14:18:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 14:18:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-19 14:18:02,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-11-19 14:18:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:18:02,174 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-19 14:18:02,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-19 14:18:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 14:18:02,176 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:18:02,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:18:02,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 14:18:02,176 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:18:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:18:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash 575904549, now seen corresponding path program 1 times [2021-11-19 14:18:02,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:18:02,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171410526] [2021-11-19 14:18:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:18:02,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:18:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:18:02,192 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:18:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:18:02,220 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 14:18:02,220 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:18:02,222 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:18:02,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 14:18:02,227 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-19 14:18:02,230 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:18:02,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:18:02 BoogieIcfgContainer [2021-11-19 14:18:02,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:18:02,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:18:02,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:18:02,252 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:18:02,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:01" (3/4) ... [2021-11-19 14:18:02,256 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 14:18:02,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:18:02,257 INFO L158 Benchmark]: Toolchain (without parser) took 1223.87ms. Allocated memory is still 138.4MB. Free memory was 106.2MB in the beginning and 74.6MB in the end (delta: 31.6MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2021-11-19 14:18:02,258 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 90.2MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:18:02,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.63ms. Allocated memory is still 138.4MB. Free memory was 106.2MB in the beginning and 114.5MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 14:18:02,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.31ms. Allocated memory is still 138.4MB. Free memory was 114.5MB in the beginning and 112.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:18:02,260 INFO L158 Benchmark]: Boogie Preprocessor took 20.15ms. Allocated memory is still 138.4MB. Free memory was 112.9MB in the beginning and 111.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:18:02,260 INFO L158 Benchmark]: RCFGBuilder took 294.12ms. Allocated memory is still 138.4MB. Free memory was 111.8MB in the beginning and 102.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 14:18:02,261 INFO L158 Benchmark]: TraceAbstraction took 606.01ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 75.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-19 14:18:02,261 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 138.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:18:02,265 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.23ms. Allocated memory is still 90.2MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.63ms. Allocated memory is still 138.4MB. Free memory was 106.2MB in the beginning and 114.5MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.31ms. Allocated memory is still 138.4MB. Free memory was 114.5MB in the beginning and 112.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.15ms. Allocated memory is still 138.4MB. Free memory was 112.9MB in the beginning and 111.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.12ms. Allocated memory is still 138.4MB. Free memory was 111.8MB in the beginning and 102.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 606.01ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 75.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 138.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [counter=0, r=0] [L32] EXPR counter++ VAL [counter=1, counter++=0, r=0] [L32] COND TRUE counter++<2 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-19 14:18:02,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:18:04,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:18:04,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:18:04,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:18:04,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:18:04,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:18:04,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:18:04,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:18:04,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:18:04,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:18:04,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:18:04,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:18:04,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:18:04,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:18:04,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:18:04,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:18:04,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:18:04,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:18:04,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:18:04,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:18:04,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:18:04,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:18:04,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:18:04,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:18:04,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:18:04,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:18:04,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:18:04,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:18:04,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:18:04,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:18:04,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:18:04,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:18:04,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:18:04,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:18:04,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:18:04,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:18:04,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:18:04,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:18:04,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:18:04,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:18:04,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:18:04,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:18:04,825 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:18:04,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:18:04,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:18:04,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:18:04,827 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:18:04,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:18:04,828 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:18:04,828 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:18:04,828 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:18:04,828 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:18:04,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:18:04,829 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:18:04,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:18:04,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:18:04,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:18:04,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:18:04,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:18:04,830 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:18:04,830 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:18:04,831 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:18:04,831 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:18:04,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:18:04,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:18:04,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:18:04,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:18:04,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:18:04,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:18:04,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:18:04,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:18:04,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:18:04,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:18:04,833 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:18:04,833 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:18:04,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:18:04,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:18:04,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:18:04,834 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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 [2021-11-19 14:18:05,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:18:05,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:18:05,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:18:05,188 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:18:05,188 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:18:05,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2021-11-19 14:18:05,258 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/2f3e38868/253fbcd90f004cd891ecdec2ad549ac4/FLAG791866f49 [2021-11-19 14:18:05,813 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:18:05,813 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2021-11-19 14:18:05,820 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/2f3e38868/253fbcd90f004cd891ecdec2ad549ac4/FLAG791866f49 [2021-11-19 14:18:06,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/data/2f3e38868/253fbcd90f004cd891ecdec2ad549ac4 [2021-11-19 14:18:06,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:18:06,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:18:06,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:18:06,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:18:06,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:18:06,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68baf4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06, skipping insertion in model container [2021-11-19 14:18:06,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:18:06,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:18:06,372 WARN L230 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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c[712,725] [2021-11-19 14:18:06,388 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:18:06,400 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:18:06,412 WARN L230 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_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c[712,725] [2021-11-19 14:18:06,418 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:18:06,432 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:18:06,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06 WrapperNode [2021-11-19 14:18:06,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:18:06,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:18:06,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:18:06,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:18:06,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,468 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2021-11-19 14:18:06,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:18:06,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:18:06,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:18:06,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:18:06,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:18:06,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:18:06,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:18:06,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:18:06,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (1/1) ... [2021-11-19 14:18:06,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:18:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:18:06,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:18:06,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:18:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:18:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:18:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:18:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:18:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-19 14:18:06,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-19 14:18:06,639 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:18:06,641 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:18:08,061 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:18:08,067 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:18:08,067 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 14:18:08,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:08 BoogieIcfgContainer [2021-11-19 14:18:08,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:18:08,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:18:08,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:18:08,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:18:08,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:18:06" (1/3) ... [2021-11-19 14:18:08,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a43c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:18:08, skipping insertion in model container [2021-11-19 14:18:08,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:18:06" (2/3) ... [2021-11-19 14:18:08,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a43c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:18:08, skipping insertion in model container [2021-11-19 14:18:08,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:08" (3/3) ... [2021-11-19 14:18:08,077 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound2.c [2021-11-19 14:18:08,083 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:18:08,083 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:18:08,131 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:18:08,139 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 14:18:08,139 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:18:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:18:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 14:18:08,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:18:08,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:18:08,161 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:18:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:18:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2021-11-19 14:18:08,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:18:08,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663239790] [2021-11-19 14:18:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:18:08,179 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:18:08,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:18:08,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:18:08,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:18:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:18:08,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 14:18:08,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:18:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:18:08,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:18:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:18:08,657 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:18:08,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663239790] [2021-11-19 14:18:08,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663239790] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:18:08,659 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:18:08,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 14:18:08,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978690104] [2021-11-19 14:18:08,662 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:18:08,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:18:08,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:18:08,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:18:08,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:18:08,696 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:18:08,715 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2021-11-19 14:18:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:18:08,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-19 14:18:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:18:08,724 INFO L225 Difference]: With dead ends: 32 [2021-11-19 14:18:08,725 INFO L226 Difference]: Without dead ends: 13 [2021-11-19 14:18:08,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:18:08,732 INFO L933 BasicCegarLoop]: 19 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, 19 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 [2021-11-19 14:18:08,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:18:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-19 14:18:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-19 14:18:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 14:18:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-19 14:18:08,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-11-19 14:18:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:18:08,770 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-19 14:18:08,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-19 14:18:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 14:18:08,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:18:08,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:18:08,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 14:18:08,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:18:08,986 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:18:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:18:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2021-11-19 14:18:08,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:18:08,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237457340] [2021-11-19 14:18:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:18:08,991 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:18:08,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:18:08,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:18:09,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:18:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:18:09,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 14:18:09,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:18:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:18:09,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:18:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:18:09,579 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:18:09,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237457340] [2021-11-19 14:18:09,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237457340] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:18:09,581 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:18:09,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-19 14:18:09,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301566657] [2021-11-19 14:18:09,585 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:18:09,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:18:09,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:18:09,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:18:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:18:09,588 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:12,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:18:14,578 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:18:16,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:18:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:18:16,837 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-19 14:18:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:18:16,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-19 14:18:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:18:16,839 INFO L225 Difference]: With dead ends: 33 [2021-11-19 14:18:16,839 INFO L226 Difference]: Without dead ends: 26 [2021-11-19 14:18:16,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-19 14:18:16,841 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:18:16,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2021-11-19 14:18:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-19 14:18:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-19 14:18:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:18:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-11-19 14:18:16,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2021-11-19 14:18:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:18:16,851 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-11-19 14:18:16,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:18:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-11-19 14:18:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 14:18:16,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:18:16,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:18:16,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-19 14:18:17,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:18:17,066 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:18:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:18:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2021-11-19 14:18:17,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:18:17,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596875703] [2021-11-19 14:18:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:18:17,067 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:18:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:18:17,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:18:17,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:18:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:18:19,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 14:18:19,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:18:44,879 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) is different from false [2021-11-19 14:18:55,979 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= c___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-11-19 14:19:04,195 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from false [2021-11-19 14:19:06,230 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from true [2021-11-19 14:19:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:19:06,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:19:12,724 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-19 14:19:14,785 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-19 14:19:27,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) is different from false [2021-11-19 14:19:29,558 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) is different from true [2021-11-19 14:19:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:19:29,559 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:19:29,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596875703] [2021-11-19 14:19:29,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596875703] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:19:29,560 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:19:29,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-11-19 14:19:29,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816219188] [2021-11-19 14:19:29,561 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:19:29,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 14:19:29,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:19:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 14:19:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2021-11-19 14:19:29,563 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:19:32,621 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:19:34,667 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 14:19:36,714 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:19:38,770 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 14:19:40,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (and (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse2)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) (not .cse1))) is different from false [2021-11-19 14:19:42,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse2)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) .cse0)))) is different from false [2021-11-19 14:19:45,348 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:19:47,591 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:19:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:19:47,655 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-19 14:19:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:19:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-19 14:19:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:19:47,657 INFO L225 Difference]: With dead ends: 28 [2021-11-19 14:19:47,658 INFO L226 Difference]: Without dead ends: 26 [2021-11-19 14:19:47,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2021-11-19 14:19:47,660 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-19 14:19:47,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 2 Unknown, 35 Unchecked, 5.7s Time] [2021-11-19 14:19:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-19 14:19:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-19 14:19:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:19:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-19 14:19:47,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2021-11-19 14:19:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:19:47,670 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-19 14:19:47,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:19:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-11-19 14:19:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 14:19:47,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:19:47,672 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:19:47,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 14:19:47,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:19:47,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:19:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:19:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2021-11-19 14:19:47,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:19:47,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174692610] [2021-11-19 14:19:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:19:47,881 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:19:47,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:19:47,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:19:47,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 14:19:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:19:48,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 14:19:48,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:19:54,559 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-19 14:19:56,623 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-19 14:20:09,050 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-19 14:20:17,340 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-19 14:20:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 14:20:17,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:20:42,415 WARN L227 SmtUtils]: Spent 16.70s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-19 14:20:59,149 WARN L227 SmtUtils]: Spent 16.73s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-19 14:21:07,473 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-19 14:21:22,020 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-19 14:21:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 14:21:22,035 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:21:22,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174692610] [2021-11-19 14:21:22,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174692610] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:21:22,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [308669637] [2021-11-19 14:21:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:21:22,036 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 14:21:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 14:21:22,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 14:21:22,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-19 14:21:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:21:22,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 14:21:22,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:21:38,911 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-19 14:21:47,233 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-19 14:21:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 14:21:47,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:22:12,403 WARN L227 SmtUtils]: Spent 16.77s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-19 14:22:29,125 WARN L227 SmtUtils]: Spent 16.72s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-19 14:22:37,426 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) is different from true [2021-11-19 14:22:51,975 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) is different from true [2021-11-19 14:22:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 14:22:51,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [308669637] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:22:51,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806320429] [2021-11-19 14:22:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:22:51,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:22:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:22:52,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:22:52,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 14:22:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:22:52,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 14:22:52,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:23:08,922 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-19 14:23:17,215 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-19 14:23:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 14:23:17,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:23:42,114 WARN L227 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-19 14:23:58,624 WARN L227 SmtUtils]: Spent 16.51s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-19 14:24:06,931 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-19 14:24:21,462 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-19 14:24:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-19 14:24:21,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806320429] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:24:21,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-19 14:24:21,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2021-11-19 14:24:21,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699891259] [2021-11-19 14:24:21,480 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-19 14:24:21,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 14:24:21,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:24:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 14:24:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2021-11-19 14:24:21,482 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 14:24:23,646 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:24:25,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 14:24:27,897 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1))) is different from true [2021-11-19 14:24:30,075 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) (or .cse0 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) .cse0)) is different from true [2021-11-19 14:24:32,259 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-19 14:24:34,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from false [2021-11-19 14:24:36,636 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from true [2021-11-19 14:24:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:24:36,640 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-19 14:24:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 14:24:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 14 [2021-11-19 14:24:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:24:36,642 INFO L225 Difference]: With dead ends: 31 [2021-11-19 14:24:36,642 INFO L226 Difference]: Without dead ends: 23 [2021-11-19 14:24:36,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2021-11-19 14:24:36,644 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:24:36,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 89 Unchecked, 4.2s Time] [2021-11-19 14:24:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-19 14:24:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-19 14:24:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 14:24:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-19 14:24:36,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2021-11-19 14:24:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:24:36,661 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-19 14:24:36,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 14:24:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-19 14:24:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 14:24:36,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:24:36,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:24:36,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-19 14:24:36,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-19 14:24:37,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-19 14:24:37,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:24:37,267 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:24:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:24:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2021-11-19 14:24:37,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:24:37,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509154716] [2021-11-19 14:24:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:24:37,268 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:24:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:24:37,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:24:37,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-19 14:24:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:24:43,081 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:24:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:24:54,775 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-11-19 14:24:54,775 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:24:54,776 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:24:54,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-19 14:24:54,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:24:54,982 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-19 14:24:54,984 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:24:55,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:24:55 BoogieIcfgContainer [2021-11-19 14:24:55,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:24:55,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:24:55,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:24:55,012 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:24:55,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:18:08" (3/4) ... [2021-11-19 14:24:55,014 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-19 14:24:55,062 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/witness.graphml [2021-11-19 14:24:55,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:24:55,063 INFO L158 Benchmark]: Toolchain (without parser) took 408877.55ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 40.6MB in the beginning and 31.2MB in the end (delta: 9.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,063 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 60.8MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:24:55,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.81ms. Allocated memory is still 60.8MB. Free memory was 40.3MB in the beginning and 29.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.29ms. Allocated memory is still 60.8MB. Free memory was 29.8MB in the beginning and 28.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,064 INFO L158 Benchmark]: Boogie Preprocessor took 27.21ms. Allocated memory is still 60.8MB. Free memory was 28.3MB in the beginning and 27.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,065 INFO L158 Benchmark]: RCFGBuilder took 1572.38ms. Allocated memory is still 60.8MB. Free memory was 27.0MB in the beginning and 37.2MB in the end (delta: -10.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,065 INFO L158 Benchmark]: TraceAbstraction took 406939.46ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.6MB in the beginning and 33.3MB in the end (delta: 3.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,066 INFO L158 Benchmark]: Witness Printer took 51.13ms. Allocated memory is still 73.4MB. Free memory was 33.3MB in the beginning and 31.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:24:55,068 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.27ms. Allocated memory is still 60.8MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.81ms. Allocated memory is still 60.8MB. Free memory was 40.3MB in the beginning and 29.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.29ms. Allocated memory is still 60.8MB. Free memory was 29.8MB in the beginning and 28.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.21ms. Allocated memory is still 60.8MB. Free memory was 28.3MB in the beginning and 27.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1572.38ms. Allocated memory is still 60.8MB. Free memory was 27.0MB in the beginning and 37.2MB in the end (delta: -10.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * TraceAbstraction took 406939.46ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.6MB in the beginning and 33.3MB in the end (delta: 3.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 51.13ms. Allocated memory is still 73.4MB. Free memory was 33.3MB in the beginning and 31.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [a=15727414336364550, counter=0, r=0, x=7863707168182275] [L32] EXPR counter++ VAL [a=15727414336364550, counter=1, counter++=0, r=0, x=7863707168182275] [L32] COND TRUE counter++<2 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=1, counter=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L33] RET __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [a=15727414336364550, counter=1, r=0, x=7863707168182275] [L35] COND FALSE !(!(x > r)) [L37] x = x - r [L38] r = r + 1 VAL [a=15727414336364550, counter=1, r=1, x=7863707168182275] [L32] EXPR counter++ VAL [a=15727414336364550, counter=2, counter++=1, r=1, x=7863707168182275] [L32] COND TRUE counter++<2 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=2] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 406.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 40.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 124 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 51 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 72.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 343.3s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 118 ConstructedInterpolants, 19 QuantifiedInterpolants, 1226 SizeOfPredicates, 15 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-19 14:24:55,284 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-19 14:24:55,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3e0d60-1d1a-4bd8-bea8-d22adb39999c/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE