./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94c7e44bedb585ab09170efda1a99dc421396ccb ................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94c7e44bedb585ab09170efda1a99dc421396ccb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:54:32,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:54:32,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:54:32,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:54:32,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:54:32,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:54:32,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:54:32,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:54:32,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:54:32,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:54:32,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:54:32,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:54:32,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:54:32,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:54:32,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:54:32,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:54:32,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:54:32,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:54:32,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:54:32,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:54:32,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:54:32,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:54:32,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:54:32,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:54:32,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:54:32,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:54:32,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:54:32,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:54:32,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:54:32,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:54:32,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:54:32,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:54:32,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:54:32,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:54:32,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:54:32,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:54:32,459 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:54:32,467 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:54:32,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:54:32,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:54:32,468 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:54:32,468 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:54:32,468 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:54:32,469 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:54:32,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:54:32,469 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:54:32,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:54:32,469 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:54:32,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:54:32,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:54:32,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:54:32,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:54:32,470 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:54:32,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:54:32,470 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:54:32,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:54:32,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:54:32,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:54:32,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:54:32,471 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:54:32,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:54:32,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:54:32,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:54:32,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:54:32,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:54:32,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:54:32,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:54:32,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer 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(__VERIFIER_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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-12-08 09:54:32,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:54:32,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:54:32,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:54:32,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:54:32,499 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:54:32,500 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-08 09:54:32,535 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/cfe5fbe40/b7198bd0aa6d46dd91bc1d972aef2bfe/FLAGac0b256c6 [2018-12-08 09:54:32,880 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:54:32,880 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-08 09:54:32,884 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/cfe5fbe40/b7198bd0aa6d46dd91bc1d972aef2bfe/FLAGac0b256c6 [2018-12-08 09:54:33,264 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/cfe5fbe40/b7198bd0aa6d46dd91bc1d972aef2bfe [2018-12-08 09:54:33,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:54:33,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:54:33,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:54:33,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:54:33,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:54:33,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e9f86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33, skipping insertion in model container [2018-12-08 09:54:33,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:54:33,303 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:54:33,396 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:54:33,398 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:54:33,410 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:54:33,422 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:54:33,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33 WrapperNode [2018-12-08 09:54:33,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:54:33,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:54:33,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:54:33,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:54:33,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:54:33,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:54:33,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:54:33,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:54:33,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... [2018-12-08 09:54:33,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:54:33,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:54:33,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:54:33,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:54:33,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:54:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 09:54:33,515 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 09:54:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-08 09:54:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:54:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-12-08 09:54:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-12-08 09:54:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 09:54:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 09:54:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-08 09:54:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:54:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:54:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:54:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:54:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 09:54:33,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 09:54:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:54:33,629 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:54:33,630 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 09:54:33,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:54:33 BoogieIcfgContainer [2018-12-08 09:54:33,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:54:33,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:54:33,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:54:33,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:54:33,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:54:33" (1/3) ... [2018-12-08 09:54:33,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c461956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:54:33, skipping insertion in model container [2018-12-08 09:54:33,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:33" (2/3) ... [2018-12-08 09:54:33,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c461956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:54:33, skipping insertion in model container [2018-12-08 09:54:33,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:54:33" (3/3) ... [2018-12-08 09:54:33,635 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-12-08 09:54:33,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:54:33,646 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 09:54:33,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 09:54:33,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:54:33,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:54:33,674 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:54:33,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:54:33,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:54:33,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:54:33,675 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:54:33,675 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:54:33,675 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:54:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-08 09:54:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 09:54:33,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:54:33,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:54:33,690 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:54:33,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:54:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-12-08 09:54:33,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:54:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:54:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:54:33,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:54:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:54:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:54:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:54:33,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:54:33,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:54:33,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:54:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:54:33,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:54:33,818 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-12-08 09:54:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:54:33,836 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-08 09:54:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:54:33,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-08 09:54:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:54:33,844 INFO L225 Difference]: With dead ends: 42 [2018-12-08 09:54:33,844 INFO L226 Difference]: Without dead ends: 19 [2018-12-08 09:54:33,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:54:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-08 09:54:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-08 09:54:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-08 09:54:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-08 09:54:33,867 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-08 09:54:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:54:33,867 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-08 09:54:33,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:54:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-08 09:54:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 09:54:33,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:54:33,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:54:33,869 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:54:33,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:54:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-12-08 09:54:33,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:54:33,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:54:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:54:33,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:54:33,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:54:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:54:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:54:33,934 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 09:54:33,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:54:33 BoogieIcfgContainer [2018-12-08 09:54:33,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 09:54:33,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:54:33,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:54:33,951 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:54:33,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:54:33" (3/4) ... [2018-12-08 09:54:33,954 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:54:33,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:54:33,955 INFO L168 Benchmark]: Toolchain (without parser) took 686.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -96.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:54:33,956 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:54:33,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.70 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:54:33,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.57 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:54:33,958 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-08 09:54:33,958 INFO L168 Benchmark]: RCFGBuilder took 146.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:54:33,959 INFO L168 Benchmark]: TraceAbstraction took 320.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:54:33,959 INFO L168 Benchmark]: Witness Printer took 2.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:54:33,962 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.70 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.57 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 146.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 320.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of to_real at line 26. Possible FailurePath: [L41] double a,r; [L43] a = __VERIFIER_nondet_double() [L46] CALL, EXPR inv(a) VAL [\old(A)=20] [L21] double xi, xsi, temp; [L22] signed int cond, exp; [L23] union double_int A_u, xi_u; [L24] A_u.d = A [L25] EXPR A_u.i [L25] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L26] xi_u.d = 1 [L27] xi_u.i = (((long long)(1023-exp)) << 52) [L28] EXPR xi_u.d [L28] xi = xi_u.d [L29] cond = 1 VAL [\old(A)=20, A=20, A_u={12:0}, cond=1, exp=-1024, xi=15, xi_u={21:0}] [L30] COND TRUE \read(cond) [L31] xsi = 2*xi-A*xi*xi [L32] temp = xsi-xi [L33] cond = ((temp > 1e-10) || (temp < -1e-10)) [L34] xi = xsi VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L30] COND FALSE !(\read(cond)) VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L36] return xi; [L36] return xi; [L36] return xi; VAL [\old(A)=20, \result=10, A=20, cond=0, exp=-1024, xi=10, xsi=10] [L46] RET, EXPR inv(a) VAL [a=20, inv(a)=10] [L46] r = inv(a) [L48] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) VAL [\old(cond)=0] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L11] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 22 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:54:35,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:54:35,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:54:35,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:54:35,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:54:35,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:54:35,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:54:35,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:54:35,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:54:35,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:54:35,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:54:35,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:54:35,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:54:35,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:54:35,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:54:35,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:54:35,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:54:35,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:54:35,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:54:35,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:54:35,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:54:35,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:54:35,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:54:35,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:54:35,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:54:35,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:54:35,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:54:35,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:54:35,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:54:35,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:54:35,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:54:35,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:54:35,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:54:35,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:54:35,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:54:35,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:54:35,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-08 09:54:35,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:54:35,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:54:35,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:54:35,321 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:54:35,321 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:54:35,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:54:35,321 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:54:35,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:54:35,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:54:35,322 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:54:35,322 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:54:35,322 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:54:35,322 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:54:35,322 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:54:35,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:54:35,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:54:35,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 09:54:35,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:54:35,325 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 09:54:35,325 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 09:54:35,325 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer 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(__VERIFIER_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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-12-08 09:54:35,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:54:35,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:54:35,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:54:35,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:54:35,357 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:54:35,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-08 09:54:35,395 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/eec9af251/f9350622142e45ac9157e53c38f7a111/FLAG3f296bec8 [2018-12-08 09:54:35,810 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:54:35,811 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-12-08 09:54:35,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/eec9af251/f9350622142e45ac9157e53c38f7a111/FLAG3f296bec8 [2018-12-08 09:54:35,822 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/data/eec9af251/f9350622142e45ac9157e53c38f7a111 [2018-12-08 09:54:35,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:54:35,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:54:35,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:54:35,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:54:35,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:54:35,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e2f300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35, skipping insertion in model container [2018-12-08 09:54:35,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:54:35,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:54:35,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:54:35,937 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:54:35,952 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:54:35,968 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:54:35,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35 WrapperNode [2018-12-08 09:54:35,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:54:35,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:54:35,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:54:35,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:54:35,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:54:35,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:54:35,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:54:35,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:54:35,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:35,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:36,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:36,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:36,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... [2018-12-08 09:54:36,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:54:36,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:54:36,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:54:36,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:54:36,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:54:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 09:54:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-12-08 09:54:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 09:54:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:54:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:54:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:54:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-12-08 09:54:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 09:54:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 09:54:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:54:36,195 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:54:38,290 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:54:38,290 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 09:54:38,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:54:38 BoogieIcfgContainer [2018-12-08 09:54:38,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:54:38,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:54:38,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:54:38,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:54:38,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:54:35" (1/3) ... [2018-12-08 09:54:38,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17456552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:54:38, skipping insertion in model container [2018-12-08 09:54:38,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:54:35" (2/3) ... [2018-12-08 09:54:38,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17456552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:54:38, skipping insertion in model container [2018-12-08 09:54:38,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:54:38" (3/3) ... [2018-12-08 09:54:38,296 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-12-08 09:54:38,303 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:54:38,307 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 09:54:38,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 09:54:38,332 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:54:38,332 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:54:38,332 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:54:38,332 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:54:38,333 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:54:38,333 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:54:38,333 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:54:38,333 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:54:38,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:54:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-08 09:54:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 09:54:38,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:54:38,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:54:38,347 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:54:38,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:54:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-12-08 09:54:38,354 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 09:54:38,354 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-08 09:54:38,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:54:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:54:38,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:54:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:54:38,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 09:54:38,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:54:38,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:54:38,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:54:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:54:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:54:38,473 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-12-08 09:54:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:54:40,689 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-08 09:54:40,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:54:40,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-08 09:54:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:54:40,696 INFO L225 Difference]: With dead ends: 42 [2018-12-08 09:54:40,696 INFO L226 Difference]: Without dead ends: 19 [2018-12-08 09:54:40,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:54:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-08 09:54:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-08 09:54:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-08 09:54:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-08 09:54:40,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-08 09:54:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:54:40,719 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-08 09:54:40,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:54:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-08 09:54:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 09:54:40,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:54:40,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:54:40,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:54:40,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:54:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-12-08 09:54:40,721 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 09:54:40,721 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-08 09:54:40,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:54:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:54:41,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:54:41,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 216 [2018-12-08 09:54:41,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2018-12-08 09:54:41,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:54:41,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:54:41,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 162 [2018-12-08 09:54:41,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 157 [2018-12-08 09:54:41,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-12-08 09:54:41,680 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:54:41,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:54:41,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:54:41,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 09:54:41,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:252, output treesize:99 [2018-12-08 09:54:43,874 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse0) .cse0))) c_inv_~xi~0) (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |c_inv_#in~A|))) is different from false [2018-12-08 09:54:53,495 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:54:55,559 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= |c_main_#t~ret5| (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))))))) is different from false [2018-12-08 09:54:57,602 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= |c_main_#t~ret5| (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))))))) is different from true [2018-12-08 09:54:59,680 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse0 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0) .cse0))) c_main_~r~0) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) is different from false [2018-12-08 09:55:01,731 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse0 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse0) .cse0))) c_main_~r~0) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) is different from true [2018-12-08 09:55:18,409 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_11) v_prenex_13)) .cse4)) (_ bv4294966273 32))) (_ bv1023 32))) .cse4))) ((_ extract 31 0) v_prenex_10)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse2))))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))))) (and .cse5 (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse6 (let ((.cse8 (concat ((_ extract 63 32) (let ((.cse9 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse9)) (_ bv4294966273 32))) (_ bv1023 32))) .cse9))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse6) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) (and (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) (let ((.cse13 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse13)) (_ bv4294966273 32))) (_ bv1023 32))) .cse13))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse11) .cse11))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) .cse5))) is different from false [2018-12-08 09:55:33,052 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_10 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) (let ((.cse4 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_11) v_prenex_13)) .cse4)) (_ bv4294966273 32))) (_ bv1023 32))) .cse4))) ((_ extract 31 0) v_prenex_10)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse2))))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))))) (and .cse5 (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) (let ((.cse9 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse9)) (_ bv4294966273 32))) (_ bv1023 32))) .cse9))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse7) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse7))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) (and .cse5 (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse10 (let ((.cse12 (concat ((_ extract 63 32) (let ((.cse13 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse13)) (_ bv4294966273 32))) (_ bv1023 32))) .cse13))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse10) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse10) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))))) is different from false [2018-12-08 09:55:43,503 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from false [2018-12-08 09:55:45,601 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.leq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_7) v_prenex_9)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_6)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0)))) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from true [2018-12-08 09:55:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-08 09:55:45,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 09:56:18,475 WARN L180 SmtUtils]: Spent 23.92 s on a formula simplification that was a NOOP. DAG size: 82 [2018-12-08 09:56:30,166 WARN L180 SmtUtils]: Spent 11.69 s on a formula simplification that was a NOOP. DAG size: 70 [2018-12-08 09:56:57,194 WARN L180 SmtUtils]: Spent 27.02 s on a formula simplification that was a NOOP. DAG size: 74 [2018-12-08 09:57:26,786 WARN L180 SmtUtils]: Spent 29.59 s on a formula simplification that was a NOOP. DAG size: 74 [2018-12-08 09:57:29,049 INFO L303 Elim1Store]: Index analysis took 2254 ms [2018-12-08 09:57:29,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 723 treesize of output 687 [2018-12-08 09:57:39,340 WARN L180 SmtUtils]: Spent 10.29 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-08 09:57:41,583 INFO L303 Elim1Store]: Index analysis took 2242 ms [2018-12-08 09:57:41,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 556 treesize of output 520 [2018-12-08 09:57:41,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:57:53,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:58:33,713 INFO L303 Elim1Store]: Index analysis took 2244 ms [2018-12-08 09:58:33,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 543 treesize of output 525 [2018-12-08 09:58:35,954 INFO L303 Elim1Store]: Index analysis took 2239 ms [2018-12-08 09:58:35,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 474 [2018-12-08 09:58:48,567 WARN L180 SmtUtils]: Spent 12.61 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-08 09:58:50,828 INFO L303 Elim1Store]: Index analysis took 2260 ms [2018-12-08 09:58:50,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 241 [2018-12-08 09:58:50,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:58:55,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:59:11,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:59:51,839 INFO L303 Elim1Store]: Index analysis took 2244 ms [2018-12-08 09:59:51,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 723 treesize of output 687 [2018-12-08 10:00:04,570 WARN L180 SmtUtils]: Spent 12.73 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-08 10:00:06,818 INFO L303 Elim1Store]: Index analysis took 2247 ms [2018-12-08 10:00:06,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 556 treesize of output 520 [2018-12-08 10:00:06,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:00:21,869 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:01:02,221 INFO L303 Elim1Store]: Index analysis took 2252 ms [2018-12-08 10:01:02,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 543 treesize of output 525 [2018-12-08 10:01:04,472 INFO L303 Elim1Store]: Index analysis took 2247 ms [2018-12-08 10:01:04,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 474 [2018-12-08 10:01:17,105 WARN L180 SmtUtils]: Spent 12.63 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-08 10:01:19,366 INFO L303 Elim1Store]: Index analysis took 2260 ms [2018-12-08 10:01:19,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 241 [2018-12-08 10:01:19,368 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:01:23,570 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:01:35,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:02:14,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 10:02:14,149 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 16 variables, input treesize:1447, output treesize:529 [2018-12-08 10:02:16,225 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_21 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21)))) (or (not (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (not (= c_main_~a~0 .cse0)) (fp.geq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_21) v_arrayElimCell_5)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_19)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) (forall ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16)))) (or (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.leq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_16) v_arrayElimCell_8)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_5|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (not (= .cse5 c_main_~a~0)))))) is different from false [2018-12-08 10:02:18,397 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_21 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21)))) (or (not (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (not (= c_main_~a~0 .cse0)) (fp.geq (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) (let ((.cse3 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_21) v_arrayElimCell_5)) .cse3)) (_ bv4294966273 32))) (_ bv1023 32))) .cse3))) ((_ extract 31 0) v_prenex_19)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) (forall ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16)))) (or (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.leq (let ((.cse4 (let ((.cse6 (concat ((_ extract 63 32) (let ((.cse7 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_16) v_arrayElimCell_8)) .cse7)) (_ bv4294966273 32))) (_ bv1023 32))) .cse7))) ((_ extract 31 0) |v_q#valueAsBitvector_5|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse4))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (not (= .cse5 c_main_~a~0)))))) is different from true [2018-12-08 10:02:18,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:02:18,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e418b28-55b6-454a-a3fe-a8dd6c612a8b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:02:18,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:18,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:02:19,941 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2018-12-08 10:02:20,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,017 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,018 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,019 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,063 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-12-08 10:02:20,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 166 treesize of output 171 [2018-12-08 10:02:20,303 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-08 10:02:20,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,338 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,351 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 130 [2018-12-08 10:02:20,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:20,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 108 [2018-12-08 10:02:20,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 97 [2018-12-08 10:02:20,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:20,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:02:20,672 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 156 [2018-12-08 10:02:20,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:20,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 159 [2018-12-08 10:02:20,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:20,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 195 [2018-12-08 10:02:20,940 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:21,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:21,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:21,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:21,448 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:21,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 160 [2018-12-08 10:02:21,449 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:21,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:21,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:21,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 119 [2018-12-08 10:02:21,632 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:21,793 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:02:22,215 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:02:22,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 112 [2018-12-08 10:02:22,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 74 [2018-12-08 10:02:22,233 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:22,301 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:02:22,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2018-12-08 10:02:22,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 95 [2018-12-08 10:02:22,695 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:22,734 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:02:22,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-12-08 10:02:22,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-12-08 10:02:22,751 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:22,784 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:02:22,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-12-08 10:02:22,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:22,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 124 [2018-12-08 10:02:22,870 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 8 xjuncts. [2018-12-08 10:02:23,039 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:02:23,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 80 [2018-12-08 10:02:23,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2018-12-08 10:02:23,382 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:23,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 148 [2018-12-08 10:02:23,551 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-12-08 10:02:23,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:02:23,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-08 10:02:23,780 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 10:02:23,895 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 10:02:24,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:02:24,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:02:24,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 10:02:24,274 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 8 variables, input treesize:216, output treesize:135 [2018-12-08 10:02:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 10:02:28,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 10:02:28,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:02:28,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2018-12-08 10:02:28,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:02:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:02:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=70, Unknown=17, NotChecked=154, Total=272 [2018-12-08 10:02:28,520 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-12-08 10:02:39,701 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_26 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_26)) (.cse1 ((_ extract 31 0) v_prenex_26))) (and (= ((_ extract 63 32) v_prenex_25) .cse0) (= ((_ extract 31 0) v_prenex_25) .cse1) (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat .cse0 .cse1)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2)))) (= |c_inv_#in~A| (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (let ((.cse5 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse5)) (_ bv4294966273 32))) (_ bv1023 32))) .cse5))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse3) .cse3))) c_inv_~xi~0) (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |c_inv_#in~A|)))) is different from false [2018-12-08 10:02:41,999 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_26 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_26)) (.cse1 ((_ extract 31 0) v_prenex_26))) (and (= ((_ extract 63 32) v_prenex_25) .cse0) (= ((_ extract 31 0) v_prenex_25) .cse1) (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat .cse0 .cse1)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2)))) (= |c_inv_#in~A| (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (let ((.cse5 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat ((_ extract 63 32) v_prenex_5) v_arrayElimCell_2)) .cse5)) (_ bv4294966273 32))) (_ bv1023 32))) .cse5))) ((_ extract 31 0) |v_q#valueAsBitvector_2|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse3) .cse3))) |c_inv_#res|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |c_inv_#in~A|)))) is different from false [2018-12-08 10:02:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:02:44,260 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-08 10:02:44,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:02:44,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-08 10:02:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:02:44,262 INFO L225 Difference]: With dead ends: 23 [2018-12-08 10:02:44,262 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 10:02:44,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=39, Invalid=87, Unknown=20, NotChecked=234, Total=380 [2018-12-08 10:02:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 10:02:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 10:02:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 10:02:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 10:02:44,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-08 10:02:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:02:44,264 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:02:44,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:02:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:02:44,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 10:02:44,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 10:02:44,323 INFO L451 ceAbstractionStarter]: At program point invENTRY(lines 19 37) the Hoare annotation is: true [2018-12-08 10:02:44,323 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 30 35) the Hoare annotation is: (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_26 (_ BitVec 64)) (v_prenex_25 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_26)) (.cse1 ((_ extract 31 0) v_prenex_26))) (and (= ((_ extract 63 32) v_prenex_25) .cse0) (= ((_ extract 31 0) v_prenex_25) .cse1) (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) ((_ extract 63 32) (let ((.cse2 ((_ sign_extend 32) (_ bv52 32)))) (bvshl ((_ sign_extend 32) (bvadd (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (_ bv9218868437227405312 64) (concat .cse0 .cse1)) .cse2)) (_ bv4294966273 32))) (_ bv1023 32))) .cse2)))) (= |inv_#in~A| (fp ((_ extract 63 63) v_prenex_26) ((_ extract 62 52) v_prenex_26) ((_ extract 51 0) v_prenex_26))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) [2018-12-08 10:02:44,323 INFO L448 ceAbstractionStarter]: For program point L30-3(lines 30 35) no Hoare annotation was computed. [2018-12-08 10:02:44,323 INFO L448 ceAbstractionStarter]: For program point invFINAL(lines 19 37) no Hoare annotation was computed. [2018-12-08 10:02:44,323 INFO L448 ceAbstractionStarter]: For program point invEXIT(lines 19 37) no Hoare annotation was computed. [2018-12-08 10:02:44,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 10:02:44,324 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: false [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L444 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (fp.leq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))) [2018-12-08 10:02:44,324 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 39 50) the Hoare annotation is: true [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 39 50) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 39 50) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 11) the Hoare annotation is: true [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 11) no Hoare annotation was computed. [2018-12-08 10:02:44,324 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-12-08 10:02:44,327 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 10:02:44,328 INFO L168 Benchmark]: Toolchain (without parser) took 488504.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 990.0 MB in the end (delta: -45.3 MB). Peak memory consumption was 91.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:44,329 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:02:44,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.54 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:44,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.97 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:44,329 INFO L168 Benchmark]: Boogie Preprocessor took 20.05 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:02:44,330 INFO L168 Benchmark]: RCFGBuilder took 2284.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:44,330 INFO L168 Benchmark]: TraceAbstraction took 486036.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 990.0 MB in the end (delta: 105.5 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:44,332 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.54 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.97 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.05 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2284.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 486036.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 990.0 MB in the end (delta: 105.5 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...