./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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 cb6ce2ff229d0487f93903d488050ba589e9ec8da79902739cdfa980edb7ba6d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:39:36,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:39:36,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:39:36,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:39:36,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:39:36,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:39:36,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:39:36,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:39:36,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:39:36,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:39:36,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:39:36,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:39:36,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:39:36,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:39:36,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:39:36,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:39:36,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:39:36,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:39:36,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:39:36,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:39:36,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:39:36,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:39:36,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:39:36,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:39:36,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:39:36,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:39:36,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:39:36,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:39:36,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:39:36,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:39:36,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:39:36,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:39:36,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:39:36,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:39:36,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:39:36,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:39:36,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:39:36,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:39:36,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:39:36,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:39:36,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:39:36,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 13:39:36,685 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:39:36,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:39:36,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:39:36,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:39:36,687 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:39:36,687 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:39:36,688 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:39:36,688 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:39:36,688 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:39:36,689 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:39:36,689 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:39:36,689 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:39:36,690 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:39:36,690 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:39:36,691 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:39:36,691 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:39:36,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:39:36,692 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:39:36,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:39:36,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:39:36,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:39:36,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:39:36,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:39:36,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:39:36,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:39:36,695 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:39:36,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:39:36,696 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:39:36,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:39:36,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:39:36,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:39:36,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:39:36,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:39:36,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:39:36,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:39:36,699 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:39:36,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:39:36,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:39:36,699 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:39:36,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:39:36,700 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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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 -> cb6ce2ff229d0487f93903d488050ba589e9ec8da79902739cdfa980edb7ba6d [2021-11-19 13:39:37,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:39:37,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:39:37,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:39:37,065 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:39:37,066 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:39:37,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c [2021-11-19 13:39:37,162 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/49dff031f/4583de10177c49139b28691e95b807c5/FLAG2bdd1489f [2021-11-19 13:39:37,742 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:39:37,743 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c [2021-11-19 13:39:37,750 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/49dff031f/4583de10177c49139b28691e95b807c5/FLAG2bdd1489f [2021-11-19 13:39:38,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/49dff031f/4583de10177c49139b28691e95b807c5 [2021-11-19 13:39:38,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:39:38,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:39:38,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:39:38,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:39:38,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:39:38,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb80e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38, skipping insertion in model container [2021-11-19 13:39:38,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:39:38,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:39:38,337 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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c[712,725] [2021-11-19 13:39:38,363 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:39:38,381 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:39:38,399 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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c[712,725] [2021-11-19 13:39:38,410 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:39:38,426 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:39:38,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38 WrapperNode [2021-11-19 13:39:38,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:39:38,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:39:38,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:39:38,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:39:38,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,470 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2021-11-19 13:39:38,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:39:38,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:39:38,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:39:38,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:39:38,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:39:38,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:39:38,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:39:38,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:39:38,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (1/1) ... [2021-11-19 13:39:38,534 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:39:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:39:38,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:39:38,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:39:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:39:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 13:39:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:39:38,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:39:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-19 13:39:38,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-19 13:39:38,695 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:39:38,697 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:39:38,847 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:39:38,868 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:39:38,869 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 13:39:38,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:39:38 BoogieIcfgContainer [2021-11-19 13:39:38,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:39:38,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:39:38,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:39:38,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:39:38,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:39:38" (1/3) ... [2021-11-19 13:39:38,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b405ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:39:38, skipping insertion in model container [2021-11-19 13:39:38,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:38" (2/3) ... [2021-11-19 13:39:38,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b405ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:39:38, skipping insertion in model container [2021-11-19 13:39:38,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:39:38" (3/3) ... [2021-11-19 13:39:38,884 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound5.c [2021-11-19 13:39:38,890 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:39:38,890 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 13:39:38,937 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:39:38,945 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 13:39:38,946 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 13:39:38,964 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 13:39:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-19 13:39:38,970 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:39:38,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-19 13:39:38,971 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:39:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:39:38,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2109616992, now seen corresponding path program 1 times [2021-11-19 13:39:38,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:39:38,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948535384] [2021-11-19 13:39:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:39:38,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:39:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:39:39,117 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 13:39:39,117 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:39:39,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948535384] [2021-11-19 13:39:39,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948535384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:39:39,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:39:39,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:39:39,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985922511] [2021-11-19 13:39:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:39:39,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 13:39:39,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:39:39,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 13:39:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 13:39:39,177 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 13:39:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:39:39,204 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-11-19 13:39:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 13:39:39,207 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 13:39:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:39:39,216 INFO L225 Difference]: With dead ends: 27 [2021-11-19 13:39:39,217 INFO L226 Difference]: Without dead ends: 12 [2021-11-19 13:39:39,221 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 13:39:39,225 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 13:39:39,227 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 13:39:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-19 13:39:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-19 13:39:39,269 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 13:39:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-19 13:39:39,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2021-11-19 13:39:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:39:39,272 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-19 13:39:39,273 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 13:39:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-19 13:39:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 13:39:39,274 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:39:39,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:39:39,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 13:39:39,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:39:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:39:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 574117089, now seen corresponding path program 1 times [2021-11-19 13:39:39,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:39:39,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551948581] [2021-11-19 13:39:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:39:39,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:39:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:39:39,381 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 13:39:39,382 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:39:39,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551948581] [2021-11-19 13:39:39,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551948581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:39:39,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:39:39,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 13:39:39,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702661041] [2021-11-19 13:39:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:39:39,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 13:39:39,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:39:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 13:39:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 13:39:39,388 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 13:39:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:39:39,411 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-11-19 13:39:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 13:39:39,412 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 13:39:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:39:39,413 INFO L225 Difference]: With dead ends: 21 [2021-11-19 13:39:39,413 INFO L226 Difference]: Without dead ends: 14 [2021-11-19 13:39:39,414 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 13:39:39,417 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 13:39:39,419 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 13:39:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-19 13:39:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-19 13:39:39,424 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 13:39:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-19 13:39:39,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-11-19 13:39:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:39:39,427 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-19 13:39:39,427 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 13:39:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-19 13:39:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 13:39:39,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:39:39,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:39:39,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 13:39:39,429 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:39:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:39:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 575904549, now seen corresponding path program 1 times [2021-11-19 13:39:39,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:39:39,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262547334] [2021-11-19 13:39:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:39:39,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:39:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:39:39,462 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 13:39:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:39:39,525 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 13:39:39,526 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 13:39:39,527 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 13:39:39,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 13:39:39,535 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-19 13:39:39,539 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 13:39:39,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:39:39 BoogieIcfgContainer [2021-11-19 13:39:39,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 13:39:39,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 13:39:39,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 13:39:39,567 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 13:39:39,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:39:38" (3/4) ... [2021-11-19 13:39:39,571 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 13:39:39,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 13:39:39,573 INFO L158 Benchmark]: Toolchain (without parser) took 1463.45ms. Allocated memory is still 127.9MB. Free memory was 93.8MB in the beginning and 63.2MB in the end (delta: 30.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2021-11-19 13:39:39,573 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory was 46.4MB in the beginning and 46.4MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:39:39,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.65ms. Allocated memory is still 127.9MB. Free memory was 93.7MB in the beginning and 102.6MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 13:39:39,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 127.9MB. Free memory was 102.6MB in the beginning and 101.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:39:39,576 INFO L158 Benchmark]: Boogie Preprocessor took 50.20ms. Allocated memory is still 127.9MB. Free memory was 101.5MB in the beginning and 100.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:39:39,577 INFO L158 Benchmark]: RCFGBuilder took 349.69ms. Allocated memory is still 127.9MB. Free memory was 100.2MB in the beginning and 90.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 13:39:39,577 INFO L158 Benchmark]: TraceAbstraction took 689.15ms. Allocated memory is still 127.9MB. Free memory was 90.4MB in the beginning and 63.3MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-19 13:39:39,578 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 127.9MB. Free memory was 63.3MB in the beginning and 63.2MB in the end (delta: 161.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:39:39,582 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.29ms. Allocated memory is still 92.3MB. Free memory was 46.4MB in the beginning and 46.4MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.65ms. Allocated memory is still 127.9MB. Free memory was 93.7MB in the beginning and 102.6MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 127.9MB. Free memory was 102.6MB in the beginning and 101.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.20ms. Allocated memory is still 127.9MB. Free memory was 101.5MB in the beginning and 100.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.69ms. Allocated memory is still 127.9MB. Free memory was 100.2MB in the beginning and 90.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 689.15ms. Allocated memory is still 127.9MB. Free memory was 90.4MB in the beginning and 63.3MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 127.9MB. Free memory was 63.3MB in the beginning and 63.2MB in the end (delta: 161.9kB). 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++<5 [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.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, 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.1s 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 13:39:39,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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 cb6ce2ff229d0487f93903d488050ba589e9ec8da79902739cdfa980edb7ba6d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:39:42,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:39:42,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:39:42,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:39:42,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:39:42,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:39:42,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:39:42,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:39:42,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:39:42,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:39:42,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:39:42,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:39:42,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:39:42,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:39:42,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:39:42,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:39:42,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:39:42,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:39:42,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:39:42,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:39:42,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:39:42,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:39:42,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:39:42,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:39:42,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:39:42,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:39:42,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:39:42,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:39:42,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:39:42,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:39:42,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:39:42,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:39:42,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:39:42,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:39:42,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:39:42,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:39:42,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:39:42,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:39:42,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:39:42,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:39:42,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:39:42,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 13:39:42,407 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:39:42,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:39:42,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:39:42,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:39:42,409 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:39:42,409 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:39:42,410 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:39:42,410 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:39:42,410 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:39:42,410 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:39:42,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:39:42,413 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:39:42,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:39:42,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:39:42,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:39:42,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:39:42,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:39:42,415 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:39:42,415 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 13:39:42,415 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 13:39:42,415 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:39:42,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:39:42,416 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:39:42,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:39:42,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:39:42,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 13:39:42,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:39:42,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:39:42,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:39:42,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:39:42,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:39:42,418 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 13:39:42,418 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 13:39:42,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:39:42,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:39:42,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:39:42,420 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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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 -> cb6ce2ff229d0487f93903d488050ba589e9ec8da79902739cdfa980edb7ba6d [2021-11-19 13:39:42,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:39:42,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:39:42,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:39:42,849 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:39:42,850 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:39:42,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c [2021-11-19 13:39:42,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/e5e2f5596/09716ffede7343a196eb41f050c049a8/FLAGec0f4befc [2021-11-19 13:39:43,506 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:39:43,507 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c [2021-11-19 13:39:43,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/e5e2f5596/09716ffede7343a196eb41f050c049a8/FLAGec0f4befc [2021-11-19 13:39:43,905 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/data/e5e2f5596/09716ffede7343a196eb41f050c049a8 [2021-11-19 13:39:43,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:39:43,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:39:43,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:39:43,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:39:43,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:39:43,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:39:43" (1/1) ... [2021-11-19 13:39:43,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3a15f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:43, skipping insertion in model container [2021-11-19 13:39:43,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:39:43" (1/1) ... [2021-11-19 13:39:43,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:39:43,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:39:44,154 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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c[712,725] [2021-11-19 13:39:44,185 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:39:44,202 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:39:44,219 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_79f6cefa-ba16-4c94-a2be-3d7e9813db19/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound5.c[712,725] [2021-11-19 13:39:44,238 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:39:44,268 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:39:44,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44 WrapperNode [2021-11-19 13:39:44,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:39:44,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:39:44,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:39:44,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:39:44,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,330 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2021-11-19 13:39:44,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:39:44,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:39:44,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:39:44,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:39:44,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:39:44,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:39:44,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:39:44,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:39:44,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (1/1) ... [2021-11-19 13:39:44,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:39:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:39:44,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:39:44,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:39:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:39:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 13:39:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:39:44,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:39:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-19 13:39:44,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-19 13:39:44,537 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:39:44,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:39:45,589 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:39:45,596 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:39:45,596 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 13:39:45,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:39:45 BoogieIcfgContainer [2021-11-19 13:39:45,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:39:45,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:39:45,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:39:45,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:39:45,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:39:43" (1/3) ... [2021-11-19 13:39:45,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc46ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:39:45, skipping insertion in model container [2021-11-19 13:39:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:39:44" (2/3) ... [2021-11-19 13:39:45,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc46ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:39:45, skipping insertion in model container [2021-11-19 13:39:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:39:45" (3/3) ... [2021-11-19 13:39:45,607 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound5.c [2021-11-19 13:39:45,612 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:39:45,612 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 13:39:45,662 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:39:45,670 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 13:39:45,670 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 13:39:45,686 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 13:39:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 13:39:45,690 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:39:45,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:39:45,692 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:39:45,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:39:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2021-11-19 13:39:45,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:39:45,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842445460] [2021-11-19 13:39:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:39:45,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:39:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:39:45,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:39:45,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 13:39:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:39:46,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 13:39:46,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:39:46,284 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 13:39:46,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:39:46,326 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 13:39:46,327 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:39:46,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842445460] [2021-11-19 13:39:46,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842445460] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:39:46,328 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:39:46,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 13:39:46,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929903233] [2021-11-19 13:39:46,332 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:39:46,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 13:39:46,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:39:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 13:39:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 13:39:46,370 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 13:39:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:39:46,393 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2021-11-19 13:39:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 13:39:46,396 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 13:39:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:39:46,405 INFO L225 Difference]: With dead ends: 32 [2021-11-19 13:39:46,406 INFO L226 Difference]: Without dead ends: 13 [2021-11-19 13:39:46,409 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 13:39:46,414 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 13:39:46,416 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 13:39:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-19 13:39:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-19 13:39:46,452 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 13:39:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-19 13:39:46,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-11-19 13:39:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:39:46,455 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-19 13:39:46,456 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 13:39:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-19 13:39:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 13:39:46,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:39:46,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:39:46,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-19 13:39:46,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:39:46,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:39:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:39:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2021-11-19 13:39:46,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:39:46,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488941526] [2021-11-19 13:39:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:39:46,674 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:39:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:39:46,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:39:46,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 13:39:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:39:47,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 13:39:47,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:39:47,149 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 13:39:47,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:39:47,223 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 13:39:47,223 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:39:47,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488941526] [2021-11-19 13:39:47,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488941526] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:39:47,224 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:39:47,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-19 13:39:47,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92139725] [2021-11-19 13:39:47,224 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:39:47,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 13:39:47,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:39:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 13:39:47,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 13:39:47,227 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 13:39:48,779 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 13:39:51,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 13:39:53,286 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 13:39:55,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 13:39:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:39:55,562 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-19 13:39:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:39:55,563 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 13:39:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:39:55,564 INFO L225 Difference]: With dead ends: 33 [2021-11-19 13:39:55,564 INFO L226 Difference]: Without dead ends: 26 [2021-11-19 13:39:55,565 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 13:39:55,567 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.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, 8.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:39:55,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2021-11-19 13:39:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-19 13:39:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-19 13:39:55,578 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 13:39:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-11-19 13:39:55,580 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2021-11-19 13:39:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:39:55,580 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-11-19 13:39:55,580 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 13:39:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-11-19 13:39:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 13:39:55,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:39:55,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:39:55,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 13:39:55,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:39:55,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:39:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:39:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2021-11-19 13:39:55,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:39:55,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648475485] [2021-11-19 13:39:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:39:55,783 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:39:55,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:39:55,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:39:55,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 13:39:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:39:58,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:39:58,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:40:22,829 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 13:40:33,813 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 13:40:42,043 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 13:40:44,075 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 13:40:44,075 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 13:40:44,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:40:50,561 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 13:40:52,621 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 13:41:05,341 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 13:41:07,389 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 13:41:07,390 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 13:41:07,390 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:41:07,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648475485] [2021-11-19 13:41:07,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648475485] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:41:07,390 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:41:07,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-11-19 13:41:07,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876352151] [2021-11-19 13:41:07,391 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:41:07,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 13:41:07,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:41:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 13:41:07,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2021-11-19 13:41:07,393 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 13:41:09,507 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 13:41:11,553 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 13:41:13,607 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 13:41:15,669 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 13:41:36,463 WARN L227 SmtUtils]: Spent 16.00s on a formula simplification. DAG size of input: 28 DAG size of output: 3 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 13:41:38,545 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)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from false [2021-11-19 13:41:40,864 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 13:41:41,897 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-19 13:41:44,047 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 13:41:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:41:44,117 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-19 13:41:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:41:44,118 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 13:41:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:41:44,119 INFO L225 Difference]: With dead ends: 28 [2021-11-19 13:41:44,119 INFO L226 Difference]: Without dead ends: 26 [2021-11-19 13:41:44,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=29, Invalid=30, Unknown=15, NotChecked=136, Total=210 [2021-11-19 13:41:44,122 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-19 13:41:44,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 43 Unchecked, 5.7s Time] [2021-11-19 13:41:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-19 13:41:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-19 13:41:44,129 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 13:41:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-19 13:41:44,130 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2021-11-19 13:41:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:41:44,131 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-19 13:41:44,131 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 13:41:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-11-19 13:41:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 13:41:44,132 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:41:44,132 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:41:44,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 13:41:44,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:41:44,333 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:41:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:41:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2021-11-19 13:41:44,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:41:44,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275741163] [2021-11-19 13:41:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:41:44,334 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:41:44,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:41:44,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:41:44,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 13:41:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:41:44,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:41:44,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:41:51,011 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 13:41:53,066 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 13:42:05,469 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 13:42:13,749 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 13:42:13,763 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 13:42:13,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:38,861 WARN L227 SmtUtils]: Spent 16.69s 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 13:42:55,572 WARN L227 SmtUtils]: Spent 16.71s 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 13:43:03,889 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 13:43:18,422 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 13:43:18,438 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 13:43:18,439 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:43:18,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275741163] [2021-11-19 13:43:18,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275741163] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:43:18,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [483833721] [2021-11-19 13:43:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:43:18,440 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-19 13:43:18,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/cvc4 [2021-11-19 13:43:18,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-19 13:43:18,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-19 13:43:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:43:18,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:43:18,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:43:35,153 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 13:43:43,440 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 13:43:43,450 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 13:43:43,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:44:08,418 WARN L227 SmtUtils]: Spent 16.64s 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 13:44:25,096 WARN L227 SmtUtils]: Spent 16.68s 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 13:44:33,406 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 13:44:47,913 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 13:44:47,928 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 13:44:47,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [483833721] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:44:47,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362033575] [2021-11-19 13:44:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:44:47,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:44:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:44:47,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:44:47,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 13:44:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:44:48,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:44:48,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:45:04,743 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 13:45:13,031 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 13:45:13,046 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 13:45:13,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:45:37,881 WARN L227 SmtUtils]: Spent 16.49s 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 13:45:54,370 WARN L227 SmtUtils]: Spent 16.49s 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 13:46:02,645 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 13:46:17,180 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 13:46:17,190 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 13:46:17,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362033575] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:46:17,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-19 13:46:17,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2021-11-19 13:46:17,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358939022] [2021-11-19 13:46:17,191 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-19 13:46:17,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 13:46:17,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:46:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 13:46:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2021-11-19 13:46:17,193 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 13:46:19,357 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 13:46:21,359 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 13:46:23,603 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 13:46:25,765 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 13:46:27,968 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 13:46:30,141 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 13:46:32,285 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 13:46:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:46:32,288 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-19 13:46:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 13:46:32,288 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 13:46:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:46:32,289 INFO L225 Difference]: With dead ends: 31 [2021-11-19 13:46:32,289 INFO L226 Difference]: Without dead ends: 23 [2021-11-19 13:46:32,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2021-11-19 13:46:32,291 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 13:46:32,291 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 13:46:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-19 13:46:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-19 13:46:32,296 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 13:46:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-19 13:46:32,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2021-11-19 13:46:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:46:32,297 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-19 13:46:32,297 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 13:46:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-19 13:46:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 13:46:32,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:46:32,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:46:32,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 13:46:32,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-19 13:46:32,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 13:46:32,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:46:32,919 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:46:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:46:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2021-11-19 13:46:32,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:46:32,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86581513] [2021-11-19 13:46:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:46:32,920 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:46:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:46:32,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:46:32,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-19 13:46:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:46:44,637 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 13:46:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:46:58,670 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-11-19 13:46:58,671 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 13:46:58,672 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 13:46:58,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-19 13:46:58,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:46:58,877 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-19 13:46:58,880 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 13:46:58,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:46:58 BoogieIcfgContainer [2021-11-19 13:46:58,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 13:46:58,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 13:46:58,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 13:46:58,915 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 13:46:58,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:39:45" (3/4) ... [2021-11-19 13:46:58,917 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-19 13:46:58,951 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/witness.graphml [2021-11-19 13:46:58,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 13:46:58,952 INFO L158 Benchmark]: Toolchain (without parser) took 435041.20ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 49.1MB in the beginning and 54.0MB in the end (delta: -5.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2021-11-19 13:46:58,952 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 69.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:46:58,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.09ms. Allocated memory is still 69.2MB. Free memory was 48.8MB in the beginning and 52.9MB in the end (delta: -4.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2021-11-19 13:46:58,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.42ms. Allocated memory is still 69.2MB. Free memory was 52.9MB in the beginning and 51.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:46:58,953 INFO L158 Benchmark]: Boogie Preprocessor took 28.73ms. Allocated memory is still 69.2MB. Free memory was 51.3MB in the beginning and 50.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:46:58,954 INFO L158 Benchmark]: RCFGBuilder took 1236.96ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 41.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 13:46:58,954 INFO L158 Benchmark]: TraceAbstraction took 433309.79ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 40.9MB in the beginning and 56.2MB in the end (delta: -15.3MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2021-11-19 13:46:58,955 INFO L158 Benchmark]: Witness Printer took 36.69ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 54.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:46:58,957 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.21ms. Allocated memory is still 69.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.09ms. Allocated memory is still 69.2MB. Free memory was 48.8MB in the beginning and 52.9MB in the end (delta: -4.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.42ms. Allocated memory is still 69.2MB. Free memory was 52.9MB in the beginning and 51.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.73ms. Allocated memory is still 69.2MB. Free memory was 51.3MB in the beginning and 50.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1236.96ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 41.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 433309.79ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 40.9MB in the beginning and 56.2MB in the end (delta: -15.3MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Witness Printer took 36.69ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 54.0MB 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=17592187153494154, counter=0, r=0, x=8796093576747077] [L32] EXPR counter++ VAL [a=17592187153494154, counter=1, counter++=0, r=0, x=8796093576747077] [L32] COND TRUE counter++<5 [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=17592187153494154, counter=1, r=0, x=8796093576747077] [L35] COND FALSE !(!(x > r)) [L37] x = x - r [L38] r = r + 1 VAL [a=17592187153494154, counter=1, r=1, x=8796093576747077] [L32] EXPR counter++ VAL [a=17592187153494154, counter=2, counter++=1, r=1, x=8796093576747077] [L32] COND TRUE counter++<5 [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: 433.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 60.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 17.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 132 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 51 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.3s 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.1s SsaConstructionTime, 15.3s SatisfiabilityAnalysisTime, 341.8s 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 13:46:59,194 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-19 13:46:59,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79f6cefa-ba16-4c94-a2be-3d7e9813db19/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