./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:16:21,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:16:21,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:16:21,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:16:21,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:16:21,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:16:21,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:16:21,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:16:21,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:16:21,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:16:21,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:16:21,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:16:21,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:16:21,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:16:21,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:16:21,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:16:21,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:16:21,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:16:21,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:16:21,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:16:21,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:16:21,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:16:21,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:16:21,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:16:21,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:16:21,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:16:21,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:16:21,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:16:21,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:16:21,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:16:21,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:16:21,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:16:21,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:16:21,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:16:21,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:16:21,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:16:21,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:16:21,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:16:21,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:16:21,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:16:21,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:16:21,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:16:21,639 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:16:21,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:16:21,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:16:21,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:16:21,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:16:21,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:16:21,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:16:21,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:16:21,641 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:16:21,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:16:21,641 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:16:21,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:16:21,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:16:21,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:16:21,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:16:21,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:16:21,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:16:21,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:16:21,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:16:21,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:16:21,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/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_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f [2021-12-06 17:16:21,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:16:21,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:16:21,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:16:21,839 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:16:21,840 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:16:21,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-12-06 17:16:21,889 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/2dc52dbbf/7cc0ae39986f4c1a8bb4f223185fdba8/FLAG2eece3ce9 [2021-12-06 17:16:22,275 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:16:22,276 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-12-06 17:16:22,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/2dc52dbbf/7cc0ae39986f4c1a8bb4f223185fdba8/FLAG2eece3ce9 [2021-12-06 17:16:22,292 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/2dc52dbbf/7cc0ae39986f4c1a8bb4f223185fdba8 [2021-12-06 17:16:22,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:16:22,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:16:22,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:16:22,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:16:22,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:16:22,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7a15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22, skipping insertion in model container [2021-12-06 17:16:22,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:16:22,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:16:22,429 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_d698e13b-0074-467f-bab8-87fdba457578/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-12-06 17:16:22,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:16:22,445 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:16:22,454 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_d698e13b-0074-467f-bab8-87fdba457578/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-12-06 17:16:22,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:16:22,467 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:16:22,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22 WrapperNode [2021-12-06 17:16:22,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:16:22,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:16:22,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:16:22,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:16:22,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,491 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-12-06 17:16:22,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:16:22,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:16:22,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:16:22,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:16:22,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:16:22,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:16:22,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:16:22,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:16:22,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (1/1) ... [2021-12-06 17:16:22,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:16:22,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:16:22,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:16:22,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:16:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:16:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:16:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:16:22,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:16:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 17:16:22,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 17:16:22,621 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:16:22,622 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:16:22,698 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:16:22,703 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:16:22,704 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 17:16:22,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:22 BoogieIcfgContainer [2021-12-06 17:16:22,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:16:22,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:16:22,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:16:22,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:16:22,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:16:22" (1/3) ... [2021-12-06 17:16:22,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1225ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:16:22, skipping insertion in model container [2021-12-06 17:16:22,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:22" (2/3) ... [2021-12-06 17:16:22,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1225ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:16:22, skipping insertion in model container [2021-12-06 17:16:22,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:22" (3/3) ... [2021-12-06 17:16:22,714 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound1.c [2021-12-06 17:16:22,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:16:22,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:16:22,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:16:22,774 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:16:22,774 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:16:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-12-06 17:16:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:16:22,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:16:22,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:16:22,795 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:16:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:16:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-06 17:16:22,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:16:22,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052762227] [2021-12-06 17:16:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:22,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:16:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:16:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:16:22,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:16:22,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052762227] [2021-12-06 17:16:22,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052762227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:16:22,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:16:22,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:16:22,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794295087] [2021-12-06 17:16:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:16:22,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 17:16:22,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:16:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 17:16:22,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 17:16:22,936 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12-06 17:16:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:16:22,950 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-06 17:16:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:16:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2021-12-06 17:16:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:16:22,957 INFO L225 Difference]: With dead ends: 33 [2021-12-06 17:16:22,957 INFO L226 Difference]: Without dead ends: 14 [2021-12-06 17:16:22,959 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-12-06 17:16:22,962 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-12-06 17:16:22,963 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-12-06 17:16:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-06 17:16:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-06 17:16:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 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-12-06 17:16:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-06 17:16:22,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-06 17:16:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:16:22,990 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-06 17:16:22,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12-06 17:16:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-06 17:16:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:16:22,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:16:22,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:16:22,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:16:22,991 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:16:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:16:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-06 17:16:22,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:16:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906485885] [2021-12-06 17:16:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:22,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:16:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:16:23,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:16:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:16:23,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:16:23,031 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:16:23,032 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:16:23,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:16:23,037 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-06 17:16:23,039 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:16:23,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:16:23 BoogieIcfgContainer [2021-12-06 17:16:23,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:16:23,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:16:23,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:16:23,054 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:16:23,055 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:22" (3/4) ... [2021-12-06 17:16:23,057 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:16:23,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:16:23,058 INFO L158 Benchmark]: Toolchain (without parser) took 761.64ms. Allocated memory is still 161.5MB. Free memory was 122.8MB in the beginning and 97.6MB in the end (delta: 25.2MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2021-12-06 17:16:23,058 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory was 134.2MB in the beginning and 134.1MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:16:23,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.58ms. Allocated memory is still 161.5MB. Free memory was 122.5MB in the beginning and 133.3MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:16:23,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.43ms. Allocated memory is still 161.5MB. Free memory was 133.3MB in the beginning and 131.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:16:23,059 INFO L158 Benchmark]: Boogie Preprocessor took 14.44ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 130.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:16:23,060 INFO L158 Benchmark]: RCFGBuilder took 199.20ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 121.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:16:23,060 INFO L158 Benchmark]: TraceAbstraction took 346.38ms. Allocated memory is still 161.5MB. Free memory was 121.3MB in the beginning and 97.8MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-06 17:16:23,061 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 161.5MB. Free memory was 97.8MB in the beginning and 97.6MB in the end (delta: 215.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:16:23,063 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.15ms. Allocated memory is still 161.5MB. Free memory was 134.2MB in the beginning and 134.1MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.58ms. Allocated memory is still 161.5MB. Free memory was 122.5MB in the beginning and 133.3MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.43ms. Allocated memory is still 161.5MB. Free memory was 133.3MB in the beginning and 131.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.44ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 130.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 199.20ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 121.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 346.38ms. Allocated memory is still 161.5MB. Free memory was 121.3MB in the beginning and 97.8MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 161.5MB. Free memory was 97.8MB in the beginning and 97.6MB in the end (delta: 215.6kB). 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 someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=1) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=1) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, 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, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-12-06 17:16:23,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/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_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:16:24,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:16:24,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:16:24,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:16:24,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:16:24,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:16:24,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:16:24,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:16:24,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:16:24,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:16:24,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:16:24,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:16:24,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:16:24,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:16:24,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:16:24,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:16:24,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:16:24,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:16:24,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:16:24,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:16:24,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:16:24,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:16:24,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:16:24,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:16:24,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:16:24,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:16:24,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:16:24,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:16:24,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:16:24,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:16:24,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:16:24,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:16:24,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:16:24,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:16:24,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:16:24,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:16:24,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:16:24,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:16:24,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:16:24,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:16:24,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:16:24,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-06 17:16:24,724 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:16:24,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:16:24,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:16:24,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:16:24,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:16:24,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:16:24,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:16:24,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:16:24,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:16:24,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:16:24,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:16:24,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:16:24,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:16:24,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:16:24,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:16:24,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:16:24,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:16:24,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:16:24,728 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:16:24,729 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:16:24,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:16:24,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:16:24,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:16:24,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:16:24,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:16:24,729 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_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/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_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f [2021-12-06 17:16:24,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:16:24,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:16:24,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:16:24,996 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:16:24,997 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:16:24,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-12-06 17:16:25,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/6e234f8fe/2025bc13d26d4446ac9f5859035f9e54/FLAGccdebbbb3 [2021-12-06 17:16:25,336 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:16:25,336 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-12-06 17:16:25,341 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/6e234f8fe/2025bc13d26d4446ac9f5859035f9e54/FLAGccdebbbb3 [2021-12-06 17:16:25,765 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/data/6e234f8fe/2025bc13d26d4446ac9f5859035f9e54 [2021-12-06 17:16:25,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:16:25,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:16:25,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:16:25,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:16:25,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:16:25,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8822c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25, skipping insertion in model container [2021-12-06 17:16:25,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:16:25,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:16:25,888 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_d698e13b-0074-467f-bab8-87fdba457578/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-12-06 17:16:25,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:16:25,914 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:16:25,926 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_d698e13b-0074-467f-bab8-87fdba457578/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-12-06 17:16:25,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:16:25,949 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:16:25,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25 WrapperNode [2021-12-06 17:16:25,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:16:25,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:16:25,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:16:25,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:16:25,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,988 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-06 17:16:25,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:16:25,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:16:25,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:16:25,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:16:25,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:25,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:26,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:26,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:26,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:26,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:16:26,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:16:26,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:16:26,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:16:26,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (1/1) ... [2021-12-06 17:16:26,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:16:26,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:16:26,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:16:26,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:16:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:16:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:16:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:16:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:16:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 17:16:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 17:16:26,117 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:16:26,118 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:16:26,959 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:16:26,963 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:16:26,964 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 17:16:26,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:26 BoogieIcfgContainer [2021-12-06 17:16:26,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:16:26,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:16:26,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:16:26,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:16:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:16:25" (1/3) ... [2021-12-06 17:16:26,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15730dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:16:26, skipping insertion in model container [2021-12-06 17:16:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:16:25" (2/3) ... [2021-12-06 17:16:26,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15730dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:16:26, skipping insertion in model container [2021-12-06 17:16:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:16:26" (3/3) ... [2021-12-06 17:16:26,971 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound1.c [2021-12-06 17:16:26,974 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:16:26,974 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:16:27,008 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:16:27,013 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:16:27,013 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:16:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-12-06 17:16:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:16:27,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:16:27,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:16:27,028 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:16:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:16:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-06 17:16:27,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:16:27,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485555273] [2021-12-06 17:16:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:27,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:16:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:16:27,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:16:27,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:16:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:16:27,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-06 17:16:27,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:16:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:16:27,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:16:27,449 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:16:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485555273] [2021-12-06 17:16:27,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485555273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:16:27,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:16:27,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:16:27,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035027086] [2021-12-06 17:16:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:16:27,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 17:16:27,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:16:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 17:16:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 17:16:27,486 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12-06 17:16:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:16:27,502 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-06 17:16:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:16:27,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2021-12-06 17:16:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:16:27,509 INFO L225 Difference]: With dead ends: 33 [2021-12-06 17:16:27,509 INFO L226 Difference]: Without dead ends: 14 [2021-12-06 17:16:27,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-12-06 17:16:27,514 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-12-06 17:16:27,515 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-12-06 17:16:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-06 17:16:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-06 17:16:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 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-12-06 17:16:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-06 17:16:27,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-06 17:16:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:16:27,540 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-06 17:16:27,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12-06 17:16:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-06 17:16:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:16:27,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:16:27,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:16:27,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:16:27,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:16:27,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:16:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:16:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-06 17:16:27,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:16:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184158538] [2021-12-06 17:16:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:27,744 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:16:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:16:27,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:16:27,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:16:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:16:28,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:16:28,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:17:36,971 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (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)))) (or (and .cse1 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse1) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))))) is different from true [2021-12-06 17:18:28,776 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (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)))) (or (and (not .cse0) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse0 (= c___VERIFIER_assert_~cond (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from false [2021-12-06 17:18:30,809 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (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)))) (or (and (not .cse0) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse0 (= c___VERIFIER_assert_~cond (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from true [2021-12-06 17:18:47,289 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (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))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from false [2021-12-06 17:18:49,325 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (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))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from true [2021-12-06 17:18:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:49,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:49,326 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:49,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184158538] [2021-12-06 17:18:49,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184158538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:49,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:49,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:18:49,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989050540] [2021-12-06 17:18:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:49,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:18:49,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:18:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=18, Unknown=5, NotChecked=30, Total=72 [2021-12-06 17:18:49,329 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 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-12-06 17:19:02,267 WARN L227 SmtUtils]: Spent 11.06s on a formula simplification. DAG size of input: 27 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:19:04,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:06,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:08,598 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (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)))) (or (and .cse1 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse1) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:19:10,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:12,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:14,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:14,803 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-12-06 17:19:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:19:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 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 9 [2021-12-06 17:19:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:14,860 INFO L225 Difference]: With dead ends: 22 [2021-12-06 17:19:14,860 INFO L226 Difference]: Without dead ends: 20 [2021-12-06 17:19:14,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=33, Invalid=33, Unknown=6, NotChecked=60, Total=132 [2021-12-06 17:19:14,862 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:14,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 9 Invalid, 4 Unknown, 39 Unchecked, 11.7s Time] [2021-12-06 17:19:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-06 17:19:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-06 17:19:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:19:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-12-06 17:19:14,868 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2021-12-06 17:19:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:14,869 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-06 17:19:14,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 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-12-06 17:19:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-12-06 17:19:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:19:14,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:14,870 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:14,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-06 17:19:15,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:15,072 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:19:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2021-12-06 17:19:15,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:15,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776141648] [2021-12-06 17:19:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:15,078 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:15,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:15,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:15,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:19:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:15,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:19:15,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:21,650 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-12-06 17:19:23,703 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-12-06 17:19:36,085 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-12-06 17:19:44,347 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-12-06 17:19:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:19:44,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:20:09,287 WARN L227 SmtUtils]: Spent 16.59s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 17:20:25,889 WARN L227 SmtUtils]: Spent 16.60s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 17:20:34,154 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-12-06 17:20:48,622 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-12-06 17:20:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:20:48,631 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:20:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776141648] [2021-12-06 17:20:48,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776141648] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:20:48,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:20:48,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-12-06 17:20:48,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483341479] [2021-12-06 17:20:48,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:20:48,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:20:48,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:20:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:20:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2021-12-06 17:20:48,633 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:20:50,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:20:52,759 WARN L534 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-12-06 17:20:54,889 WARN L860 $PredicateComparison]: unable to prove that (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (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-12-06 17:20:56,949 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_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) .cse0)) is different from true [2021-12-06 17:20:59,064 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))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-12-06 17:21:01,129 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32)))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (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 .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))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from false [2021-12-06 17:21:03,191 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32)))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (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 .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))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from true [2021-12-06 17:21:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:03,193 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-12-06 17:21:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:21:03,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-12-06 17:21:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:03,195 INFO L225 Difference]: With dead ends: 22 [2021-12-06 17:21:03,195 INFO L226 Difference]: Without dead ends: 17 [2021-12-06 17:21:03,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2021-12-06 17:21:03,197 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:03,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 44 Unchecked, 4.2s Time] [2021-12-06 17:21:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-06 17:21:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-06 17:21:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:21:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-12-06 17:21:03,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-12-06 17:21:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:03,203 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-12-06 17:21:03,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:21:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-12-06 17:21:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:21:03,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:03,204 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:03,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:21:03,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:21:03,406 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2021-12-06 17:21:03,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:21:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062223798] [2021-12-06 17:21:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:03,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:21:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:21:03,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:21:03,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:21:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:05,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:21:05,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:22:02,606 WARN L227 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:23:09,053 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse1)))) is different from false [2021-12-06 17:23:11,102 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse1)))) is different from true [2021-12-06 17:24:06,170 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse3)))) is different from false [2021-12-06 17:24:08,224 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse3)))) is different from true [2021-12-06 17:24:25,000 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse2)))) is different from false [2021-12-06 17:24:27,050 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse2)))) is different from true [2021-12-06 17:24:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:24:27,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:24:37,866 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-12-06 17:24:39,934 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-12-06 17:24:54,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from false [2021-12-06 17:24:56,677 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from true [2021-12-06 17:25:24,011 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-12-06 17:25:26,076 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-12-06 17:25:40,756 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-12-06 17:25:59,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse0))))) is different from false [2021-12-06 17:26:01,377 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse0))))) is different from true [2021-12-06 17:26:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:26:01,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:26:01,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062223798] [2021-12-06 17:26:01,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062223798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:26:01,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:26:01,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2021-12-06 17:26:01,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680826862] [2021-12-06 17:26:01,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:26:01,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 17:26:01,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:26:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 17:26:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=49, Unknown=18, NotChecked=168, Total=272 [2021-12-06 17:26:01,380 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:26:03,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:26:05,513 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-06 17:26:07,579 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse0 (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2)) (.cse4 (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse3))) (or (and .cse0 (or (not .cse4) (not .cse5))) (and .cse5 .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:26:09,645 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse0 (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2)) (.cse4 (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse3))) (or (and .cse0 (or (not .cse4) (not .cse5))) (and .cse5 .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:26:11,712 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.gt .cse2 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)))))) is different from false [2021-12-06 17:26:13,776 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.gt .cse2 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)))))) is different from true [2021-12-06 17:26:15,839 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ 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))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:26:17,919 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ 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))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-06 17:26:20,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (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)) (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:26:22,142 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (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)) (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:26:24,207 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.gt .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse1)))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2021-12-06 17:26:26,278 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c___VERIFIER_assert_~cond (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse3))))) is different from false [2021-12-06 17:26:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:26:26,292 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-12-06 17:26:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:26:26,293 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-12-06 17:26:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:26:26,294 INFO L225 Difference]: With dead ends: 26 [2021-12-06 17:26:26,294 INFO L226 Difference]: Without dead ends: 24 [2021-12-06 17:26:26,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 94.8s TimeCoverageRelationStatistics Valid=55, Invalid=65, Unknown=30, NotChecked=450, Total=600 [2021-12-06 17:26:26,296 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:26:26,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2021-12-06 17:26:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-06 17:26:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-06 17:26:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 17:26:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-06 17:26:26,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2021-12-06 17:26:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:26:26,302 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-06 17:26:26,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:26:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-06 17:26:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 17:26:26,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:26:26,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-06 17:26:26,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 17:26:26,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:26:26,505 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:26:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:26:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1159254460, now seen corresponding path program 2 times [2021-12-06 17:26:26,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:26:26,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950837180] [2021-12-06 17:26:26,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:26:26,508 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:26:26,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:26:26,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:26:26,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:26:27,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:26:27,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:26:27,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 17:26:27,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:26:42,626 WARN L227 SmtUtils]: Spent 7.65s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:27:06,836 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:27:44,739 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:29:19,429 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))))) (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse0)))) is different from false [2021-12-06 17:29:21,500 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))))) (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse0)))) is different from true [2021-12-06 17:30:23,628 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (or (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32)))))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse0)))) is different from false [2021-12-06 17:30:25,702 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (or (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32)))))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse0)))) is different from true [2021-12-06 17:30:46,955 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse0)))) (_ bv0 32))) (fp.gt .cse1 .cse0)))) is different from false [2021-12-06 17:30:49,027 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse0)))) (_ bv0 32))) (fp.gt .cse1 .cse0)))) is different from true [2021-12-06 17:30:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 11 not checked. [2021-12-06 17:30:49,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:30:56,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |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-12-06 17:30:58,296 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |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-12-06 17:31:09,425 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))))) (_ bv0 32)))) is different from true [2021-12-06 17:31:14,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:31:14,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950837180] [2021-12-06 17:31:14,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950837180] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:31:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [913082244] [2021-12-06 17:31:14,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:31:14,101 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:31:14,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:31:14,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:31:14,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d698e13b-0074-467f-bab8-87fdba457578/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-06 17:31:15,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:31:15,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:31:15,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:31:15,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:31:45,954 WARN L227 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)