./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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-0cd3be1 [2018-11-28 11:16:35,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:16:35,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:16:35,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:16:35,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:16:35,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:16:35,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:16:35,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:16:35,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:16:35,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:16:35,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:16:35,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:16:35,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:16:35,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:16:35,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:16:35,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:16:35,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:16:35,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:16:35,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:16:35,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:16:35,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:16:35,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:16:35,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:16:35,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:16:35,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:16:35,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:16:35,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:16:35,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:16:35,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:16:35,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:16:35,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:16:35,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:16:35,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:16:35,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:16:35,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:16:35,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:16:35,487 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:16:35,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:16:35,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:16:35,495 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:16:35,496 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:16:35,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:16:35,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:16:35,496 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:16:35,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:16:35,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:16:35,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:16:35,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:16:35,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:16:35,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:16:35,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:16:35,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:16:35,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:16:35,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:16:35,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:16:35,499 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_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:16:35,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:16:35,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:16:35,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:16:35,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:16:35,537 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:16:35,538 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-28 11:16:35,576 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/b4c3daeeb/1beb60b9dbdf4fcaba64b4d4361962d6/FLAG124450f76 [2018-11-28 11:16:35,976 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:16:35,977 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-28 11:16:35,980 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/b4c3daeeb/1beb60b9dbdf4fcaba64b4d4361962d6/FLAG124450f76 [2018-11-28 11:16:35,989 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/b4c3daeeb/1beb60b9dbdf4fcaba64b4d4361962d6 [2018-11-28 11:16:35,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:16:35,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:16:35,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:35,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:16:35,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:16:35,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:35" (1/1) ... [2018-11-28 11:16:35,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4dbf12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:35, skipping insertion in model container [2018-11-28 11:16:35,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:35" (1/1) ... [2018-11-28 11:16:36,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:16:36,018 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:16:36,116 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:36,118 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:16:36,132 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:36,145 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:16:36,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36 WrapperNode [2018-11-28 11:16:36,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:36,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:36,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:16:36,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:16:36,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:36,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:16:36,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:16:36,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:16:36,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... [2018-11-28 11:16:36,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:16:36,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:16:36,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:16:36,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:16:36,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:16:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:16:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:16:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-28 11:16:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:16:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-11-28 11:16:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-11-28 11:16:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:16:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:16:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-28 11:16:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:16:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:16:36,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:16:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:16:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 11:16:36,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 11:16:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:16:36,438 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:16:36,438 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:16:36,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:36 BoogieIcfgContainer [2018-11-28 11:16:36,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:16:36,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:16:36,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:16:36,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:16:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:16:35" (1/3) ... [2018-11-28 11:16:36,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374fcfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:16:36, skipping insertion in model container [2018-11-28 11:16:36,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:36" (2/3) ... [2018-11-28 11:16:36,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374fcfb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:16:36, skipping insertion in model container [2018-11-28 11:16:36,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:36" (3/3) ... [2018-11-28 11:16:36,446 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-11-28 11:16:36,458 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:16:36,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:16:36,483 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:16:36,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:16:36,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:16:36,514 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:16:36,514 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:16:36,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:16:36,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:16:36,514 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:16:36,514 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:16:36,515 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:16:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-28 11:16:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 11:16:36,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:16:36,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:36,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:16:36,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-11-28 11:16:36,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:36,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:36,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:36,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:16:36,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:16:36,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:16:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:16:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:16:36,726 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-11-28 11:16:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:36,758 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-28 11:16:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:16:36,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 11:16:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:16:36,764 INFO L225 Difference]: With dead ends: 42 [2018-11-28 11:16:36,765 INFO L226 Difference]: Without dead ends: 19 [2018-11-28 11:16:36,767 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-11-28 11:16:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-28 11:16:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 11:16:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 11:16:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-28 11:16:36,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-28 11:16:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:16:36,796 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-28 11:16:36,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:16:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-28 11:16:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:16:36,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:16:36,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:36,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:16:36,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:36,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-11-28 11:16:36,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:36,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:36,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:36,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:36,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:36,873 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:16:36,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:16:36 BoogieIcfgContainer [2018-11-28 11:16:36,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:16:36,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:16:36,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:16:36,893 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:16:36,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:36" (3/4) ... [2018-11-28 11:16:36,896 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:16:36,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:16:36,897 INFO L168 Benchmark]: Toolchain (without parser) took 905.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.6 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:36,898 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:16:36,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.6 MB in the beginning and 941.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:36,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:36,899 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:16:36,900 INFO L168 Benchmark]: RCFGBuilder took 211.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:36,900 INFO L168 Benchmark]: TraceAbstraction took 453.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:36,900 INFO L168 Benchmark]: Witness Printer took 3.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:16:36,903 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 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.6 MB in the beginning and 941.8 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 56.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 211.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 453.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.26 ms. Allocated memory is still 1.2 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.3s 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-0cd3be1 [2018-11-28 11:16:38,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:16:38,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:16:38,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:16:38,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:16:38,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:16:38,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:16:38,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:16:38,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:16:38,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:16:38,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:16:38,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:16:38,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:16:38,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:16:38,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:16:38,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:16:38,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:16:38,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:16:38,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:16:38,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:16:38,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:16:38,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:16:38,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:16:38,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:16:38,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:16:38,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:16:38,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:16:38,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:16:38,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:16:38,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:16:38,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:16:38,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:16:38,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:16:38,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:16:38,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:16:38,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:16:38,425 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 11:16:38,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:16:38,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:16:38,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:16:38,438 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:16:38,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:16:38,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:16:38,439 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:16:38,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:16:38,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:16:38,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:16:38,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:16:38,439 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:16:38,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:16:38,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:16:38,441 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 11:16:38,441 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 11:16:38,441 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:16:38,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:16:38,442 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:16:38,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:16:38,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:16:38,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:16:38,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:16:38,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:16:38,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:16:38,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:16:38,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:16:38,443 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:16:38,443 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 11:16:38,443 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:16:38,443 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 11:16:38,444 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 11:16:38,444 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_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:16:38,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:16:38,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:16:38,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:16:38,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:16:38,487 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:16:38,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-28 11:16:38,538 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/25411eb01/288693ce07ec4c7ea56cf566c8cbc364/FLAGca8f1ce31 [2018-11-28 11:16:38,881 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:16:38,881 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-28 11:16:38,885 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/25411eb01/288693ce07ec4c7ea56cf566c8cbc364/FLAGca8f1ce31 [2018-11-28 11:16:38,893 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/bin-2019/uautomizer/data/25411eb01/288693ce07ec4c7ea56cf566c8cbc364 [2018-11-28 11:16:38,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:16:38,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:16:38,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:38,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:16:38,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:16:38,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:38" (1/1) ... [2018-11-28 11:16:38,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3eb2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:38, skipping insertion in model container [2018-11-28 11:16:38,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:38" (1/1) ... [2018-11-28 11:16:38,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:16:38,918 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:16:39,027 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:39,031 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:16:39,048 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:39,069 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:16:39,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39 WrapperNode [2018-11-28 11:16:39,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:39,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:39,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:16:39,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:16:39,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:39,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:16:39,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:16:39,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:16:39,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... [2018-11-28 11:16:39,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:16:39,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:16:39,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:16:39,115 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:16:39,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:16:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-28 11:16:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-28 11:16:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:16:39,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:16:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-11-28 11:16:39,206 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-11-28 11:16:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-28 11:16:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:16:39,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:16:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:16:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:16:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:16:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-28 11:16:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 11:16:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 11:16:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:16:39,350 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:16:41,485 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:16:41,485 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:16:41,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:41 BoogieIcfgContainer [2018-11-28 11:16:41,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:16:41,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:16:41,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:16:41,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:16:41,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:16:38" (1/3) ... [2018-11-28 11:16:41,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c61b5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:16:41, skipping insertion in model container [2018-11-28 11:16:41,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:39" (2/3) ... [2018-11-28 11:16:41,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c61b5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:16:41, skipping insertion in model container [2018-11-28 11:16:41,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:41" (3/3) ... [2018-11-28 11:16:41,492 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-11-28 11:16:41,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:16:41,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:16:41,517 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:16:41,538 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:16:41,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:16:41,538 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:16:41,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:16:41,538 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:16:41,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:16:41,539 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:16:41,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:16:41,539 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:16:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-28 11:16:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 11:16:41,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:16:41,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:41,555 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:16:41,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-11-28 11:16:41,561 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 11:16:41,561 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:16:41,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:41,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:41,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:16:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:16:41,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:16:41,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:16:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:16:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:16:41,687 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-11-28 11:16:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:43,935 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-28 11:16:43,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:16:43,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 11:16:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:16:43,946 INFO L225 Difference]: With dead ends: 42 [2018-11-28 11:16:43,946 INFO L226 Difference]: Without dead ends: 19 [2018-11-28 11:16:43,949 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-11-28 11:16:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-28 11:16:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 11:16:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 11:16:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-28 11:16:43,975 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-28 11:16:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:16:43,976 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-28 11:16:43,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:16:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-28 11:16:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:16:43,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:16:43,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:16:43,977 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:16:43,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-11-28 11:16:43,978 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 11:16:43,978 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:16:43,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:44,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:45,033 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-11-28 11:16:45,057 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-11-28 11:16:45,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:16:45,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:16:45,172 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-11-28 11:16:45,186 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-11-28 11:16:45,226 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-11-28 11:16:45,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:45,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:45,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:45,276 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-11-28 11:16:45,276 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:252, output treesize:99 [2018-11-28 11:16:47,406 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-11-28 11:16:49,788 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 (= (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_#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-11-28 11:16:52,047 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-11-28 11:16:54,119 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-11-28 11:16:56,199 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-11-28 11:16:58,258 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-11-28 11:17:14,934 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-11-28 11:17:29,636 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-11-28 11:17:40,088 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-11-28 11:17:42,158 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-11-28 11:17:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-28 11:17:42,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:18:11,885 WARN L180 SmtUtils]: Spent 29.60 s on a formula simplification that was a NOOP. DAG size: 82 [2018-11-28 11:18:24,799 WARN L180 SmtUtils]: Spent 12.91 s on a formula simplification that was a NOOP. DAG size: 70 [2018-11-28 11:18:49,620 WARN L180 SmtUtils]: Spent 24.82 s on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 11:19:13,911 WARN L180 SmtUtils]: Spent 24.29 s on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 11:19:16,183 INFO L303 Elim1Store]: Index analysis took 2264 ms [2018-11-28 11:19:16,184 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-11-28 11:19:27,836 WARN L180 SmtUtils]: Spent 11.65 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-28 11:19:30,086 INFO L303 Elim1Store]: Index analysis took 2249 ms [2018-11-28 11:19:30,088 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-11-28 11:19:30,088 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:19:46,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:20:26,999 INFO L303 Elim1Store]: Index analysis took 2242 ms [2018-11-28 11:20:27,000 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-11-28 11:20:28,218 INFO L303 Elim1Store]: Index analysis took 1217 ms [2018-11-28 11:20:28,219 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-11-28 11:20:40,830 WARN L180 SmtUtils]: Spent 12.61 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 11:20:43,090 INFO L303 Elim1Store]: Index analysis took 2258 ms [2018-11-28 11:20:43,091 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-11-28 11:20:43,091 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:20:47,280 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:20:57,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:21:38,330 INFO L303 Elim1Store]: Index analysis took 2238 ms [2018-11-28 11:21:38,331 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-11-28 11:21:51,683 WARN L180 SmtUtils]: Spent 13.35 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-28 11:21:53,926 INFO L303 Elim1Store]: Index analysis took 2243 ms [2018-11-28 11:21:53,927 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-11-28 11:21:53,928 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:22:09,606 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:22:49,251 INFO L303 Elim1Store]: Index analysis took 1690 ms [2018-11-28 11:22:49,252 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-11-28 11:22:51,270 INFO L303 Elim1Store]: Index analysis took 2016 ms [2018-11-28 11:22:51,271 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-11-28 11:23:03,867 WARN L180 SmtUtils]: Spent 12.59 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 11:23:06,114 INFO L303 Elim1Store]: Index analysis took 2246 ms [2018-11-28 11:23:06,115 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-11-28 11:23:06,115 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:10,306 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,987 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:04,304 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-11-28 11:24:04,304 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 16 variables, input treesize:1447, output treesize:529 [2018-11-28 11:24:06,389 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-11-28 11:24:08,556 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-11-28 11:24:08,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:24:08,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76b505db-f684-44f0-b1a1-f43409aa4610/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-11-28 11:24:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:24:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:24:08,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:24:09,989 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2018-11-28 11:24:10,053 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,054 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,054 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,102 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-11-28 11:24:10,160 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-11-28 11:24:10,329 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-28 11:24:10,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:10,358 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,373 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-11-28 11:24:10,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:10,492 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-11-28 11:24:10,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:10,547 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-11-28 11:24:10,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:10,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:10,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,774 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-11-28 11:24:10,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:10,847 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:10,913 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-11-28 11:24:10,918 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:24:10,918 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:11,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,142 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 79 treesize of output 116 [2018-11-28 11:24:11,143 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:11,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,309 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:11,310 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-11-28 11:24:11,311 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:11,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:11,493 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-11-28 11:24:11,494 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:11,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:24:12,019 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:12,021 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-11-28 11:24:12,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,034 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-11-28 11:24:12,034 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:12,092 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:12,439 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-11-28 11:24:12,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,459 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 42 treesize of output 71 [2018-11-28 11:24:12,460 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:12,494 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:12,500 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-11-28 11:24:12,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,510 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-11-28 11:24:12,510 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:12,543 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:12,550 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-11-28 11:24:12,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:12,640 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-11-28 11:24:12,641 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-11-28 11:24:12,817 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:24:13,105 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-11-28 11:24:13,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,116 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-11-28 11:24:13,117 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:13,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,263 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-11-28 11:24:13,264 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 8 xjuncts. [2018-11-28 11:24:13,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:13,478 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-11-28 11:24:13,478 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:13,619 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:24:13,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:24:13,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:24:13,946 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-11-28 11:24:13,946 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 8 variables, input treesize:216, output treesize:135 [2018-11-28 11:24:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:24:14,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:24:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:24:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2018-11-28 11:24:14,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:24:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:24:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=61, Unknown=12, NotChecked=168, Total=272 [2018-11-28 11:24:14,081 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-28 11:24:18,534 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-11-28 11:24:20,830 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-11-28 11:24:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:24:21,027 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-28 11:24:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:24:21,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-28 11:24:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:24:21,029 INFO L225 Difference]: With dead ends: 23 [2018-11-28 11:24:21,029 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:24:21,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=39, Invalid=77, Unknown=14, NotChecked=250, Total=380 [2018-11-28 11:24:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:24:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:24:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:24:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:24:21,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-28 11:24:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:24:21,031 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:24:21,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:24:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:24:21,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:24:21,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:24:21,089 INFO L451 ceAbstractionStarter]: At program point invENTRY(lines 19 37) the Hoare annotation is: true [2018-11-28 11:24:21,090 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-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point L30-3(lines 30 35) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point invFINAL(lines 19 37) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point invEXIT(lines 19 37) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 11:24:21,090 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:24:21,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:24:21,090 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: false [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-11-28 11:24:21,091 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-11-28 11:24:21,091 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 39 50) the Hoare annotation is: true [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 39 50) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 39 50) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 11) the Hoare annotation is: true [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 11) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-11-28 11:24:21,091 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2018-11-28 11:24:21,094 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-11-28 11:24:21,096 INFO L168 Benchmark]: Toolchain (without parser) took 462200.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -76.8 MB). Peak memory consumption was 95.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:21,097 INFO L168 Benchmark]: CDTParser took 0.19 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-11-28 11:24:21,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:21,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.49 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-11-28 11:24:21,098 INFO L168 Benchmark]: Boogie Preprocessor took 23.68 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-11-28 11:24:21,098 INFO L168 Benchmark]: RCFGBuilder took 2370.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:21,098 INFO L168 Benchmark]: TraceAbstraction took 459609.65 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 1.0 GB in the end (delta: 113.5 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:21,101 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.19 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 172.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 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 20.49 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 23.68 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 2370.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 459609.65 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 1.0 GB in the end (delta: 113.5 MB). Peak memory consumption was 110.4 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...