./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/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 2fc40f01120ca51e77cbf79a7824b0aac7011828 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/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 2fc40f01120ca51e77cbf79a7824b0aac7011828 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:25:17,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:25:17,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:25:17,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:25:17,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:25:17,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:25:17,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:25:17,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:25:17,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:25:17,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:25:17,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:25:17,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:25:17,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:25:17,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:25:17,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:25:17,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:25:17,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:25:17,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:25:17,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:25:17,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:25:17,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:25:17,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:25:17,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:25:17,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:25:17,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:25:17,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:25:17,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:25:17,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:25:17,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:25:17,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:25:17,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:25:17,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:25:17,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:25:17,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:25:17,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:25:17,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:25:17,496 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:25:17,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:25:17,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:25:17,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:25:17,507 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:25:17,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:25:17,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:25:17,507 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:25:17,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:25:17,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:25:17,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:25:17,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:25:17,509 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:25:17,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:25:17,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:25:17,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:25:17,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:25:17,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:25:17,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:25:17,511 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_fbe82a90-3651-4e2a-90c1-23d85f667196/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 -> 2fc40f01120ca51e77cbf79a7824b0aac7011828 [2018-11-23 13:25:17,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:25:17,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:25:17,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:25:17,546 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:25:17,547 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:25:17,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c [2018-11-23 13:25:17,591 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/6f70cb8d1/0f884b0416244934aa29588d7dc829ff/FLAG180160b38 [2018-11-23 13:25:17,899 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:25:17,900 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c [2018-11-23 13:25:17,905 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/6f70cb8d1/0f884b0416244934aa29588d7dc829ff/FLAG180160b38 [2018-11-23 13:25:17,913 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/6f70cb8d1/0f884b0416244934aa29588d7dc829ff [2018-11-23 13:25:17,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:25:17,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:25:17,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:25:17,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:25:17,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:25:17,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:25:17" (1/1) ... [2018-11-23 13:25:17,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:17, skipping insertion in model container [2018-11-23 13:25:17,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:25:17" (1/1) ... [2018-11-23 13:25:17,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:25:17,940 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:25:18,058 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:25:18,059 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:25:18,078 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:25:18,090 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:25:18,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18 WrapperNode [2018-11-23 13:25:18,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:25:18,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:25:18,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:25:18,091 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:25:18,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:25:18,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:25:18,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:25:18,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:25:18,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... [2018-11-23 13:25:18,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:25:18,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:25:18,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:25:18,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:25:18,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/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-23 13:25:18,215 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:25:18,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:25:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:25:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:25:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-11-23 13:25:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-11-23 13:25:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:25:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:25:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:25:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:25:18,420 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:25:18,420 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:25:18,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:18 BoogieIcfgContainer [2018-11-23 13:25:18,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:25:18,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:25:18,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:25:18,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:25:18,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:25:17" (1/3) ... [2018-11-23 13:25:18,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccf708f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:25:18, skipping insertion in model container [2018-11-23 13:25:18,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:18" (2/3) ... [2018-11-23 13:25:18,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccf708f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:25:18, skipping insertion in model container [2018-11-23 13:25:18,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:18" (3/3) ... [2018-11-23 13:25:18,428 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032b_true-unreach-call.c [2018-11-23 13:25:18,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:25:18,443 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:25:18,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:25:18,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:25:18,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:25:18,479 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:25:18,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:25:18,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:25:18,479 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:25:18,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:25:18,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:25:18,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:25:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-23 13:25:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:25:18,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:18,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:18,498 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:18,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1666868037, now seen corresponding path program 1 times [2018-11-23 13:25:18,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:25:18,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:25:18,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:25:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:25:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:18,599 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-23 13:25:18,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:18,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:25:18,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:25:18,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:25:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:25:18,612 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-23 13:25:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:18,628 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2018-11-23 13:25:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:25:18,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 13:25:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:18,637 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:25:18,637 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:25:18,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:25:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:25:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:25:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:25:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 13:25:18,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 19 [2018-11-23 13:25:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:18,662 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 13:25:18,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:25:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 13:25:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:25:18,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:18,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:18,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:18,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash -165901892, now seen corresponding path program 1 times [2018-11-23 13:25:18,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:25:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:25:18,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:25:18,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:18,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:25:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:25:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:25:18,734 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450950, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945] [?] RET #108#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := round_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~exponent_less_1023~0;havoc ~lsw~0; VAL [round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] goto; VAL [round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] assume ~exponent_less_1023~0 < 20; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] assume !(~exponent_less_1023~0 < 0);~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296;#res := ~x; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0, |round_double_#res|=6442450946.0] [?] assume true; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0, |round_double_#res|=6442450946.0] [?] RET #112#return; VAL [main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=6442450946.0] [?] ~res~0 := #t~ret8;havoc #t~ret8;#t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short10|=false] [?] assume !#t~short10; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short10|=false] [?] assume !#t~short10;havoc #t~ret9;havoc #t~short10; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450950, #NULL.offset=6442450945, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L86] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L87] CALL call #t~ret8 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450946E9] [L21] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L24] ~lsw~0 := #t~mem2; [L24] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27-L56] assume ~exponent_less_1023~0 < 20; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28-L40] assume !(~exponent_less_1023~0 < 0); [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35-L36] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296; [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L17-L64] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L87] RET call #t~ret8 := round_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=6.442450946E9, ~x~0=6.442450946E9] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] assume !#t~short10; VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90-L93] assume !#t~short10; [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L91] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450950, #NULL.offset=6442450945, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L86] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L87] CALL call #t~ret8 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450946E9] [L21] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L24] ~lsw~0 := #t~mem2; [L24] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27-L56] assume ~exponent_less_1023~0 < 20; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28-L40] assume !(~exponent_less_1023~0 < 0); [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35-L36] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296; [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L17-L64] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L87] RET call #t~ret8 := round_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=6.442450946E9, ~x~0=6.442450946E9] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] assume !#t~short10; VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90-L93] assume !#t~short10; [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L91] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret8 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L87] RET call #t~ret8 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450946E9, ~x~0=6.442450946E9] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND TRUE !#t~short10 [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret8 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L87] RET call #t~ret8 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450946E9, ~x~0=6.442450946E9] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND TRUE !#t~short10 [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret8 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L87] RET call #t~ret8 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450946E9, ~x~0=6.442450946E9] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND TRUE !#t~short10 [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret8 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L87] RET call #t~ret8 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=6.442450946E9, ~x~0=6.442450946E9] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L90] COND TRUE !#t~short10 [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L86] double x = -0.0; [L87] CALL, EXPR round_double(x) VAL [\old(x)=6442450946] [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; VAL [\old(x)=6442450946, x=6442450946] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L27] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L28] COND FALSE !(exponent_less_1023 < 0) [L34] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L35] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L36] return x; VAL [\old(x)=6442450946, \result=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L87] RET, EXPR round_double(x) VAL [round_double(x)=6442450946, x=6442450946] [L87] double res = round_double(x); [L90] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=6442450946, res == -0.0 && __signbit_double(res) == 1=0, x=6442450946] [L90] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L91] __VERIFIER_error() VAL [res=6442450946, x=6442450946] ----- [2018-11-23 13:25:18,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:25:18 BoogieIcfgContainer [2018-11-23 13:25:18,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:25:18,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:25:18,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:25:18,769 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:25:18,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:18" (3/4) ... [2018-11-23 13:25:18,772 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:25:18,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:25:18,773 INFO L168 Benchmark]: Toolchain (without parser) took 857.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:18,774 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:25:18,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.92 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:18,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:25:18,775 INFO L168 Benchmark]: Boogie Preprocessor took 60.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:18,776 INFO L168 Benchmark]: RCFGBuilder took 247.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:18,776 INFO L168 Benchmark]: TraceAbstraction took 346.53 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:18,777 INFO L168 Benchmark]: Witness Printer took 3.75 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-23 13:25:18,779 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.92 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 346.53 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 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: 91]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 34, overapproximation of someUnaryDOUBLEoperation at line 86, overapproximation of bitwiseAnd at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L86] double x = -0.0; [L87] CALL, EXPR round_double(x) VAL [\old(x)=6442450946] [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; VAL [\old(x)=6442450946, x=6442450946] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L27] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L28] COND FALSE !(exponent_less_1023 < 0) [L34] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L35] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L36] return x; VAL [\old(x)=6442450946, \result=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L87] RET, EXPR round_double(x) VAL [round_double(x)=6442450946, x=6442450946] [L87] double res = round_double(x); [L90] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=6442450946, res == -0.0 && __signbit_double(res) == 1=0, x=6442450946] [L90] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L91] __VERIFIER_error() VAL [res=6442450946, x=6442450946] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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-aa41828 [2018-11-23 13:25:20,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:25:20,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:25:20,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:25:20,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:25:20,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:25:20,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:25:20,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:25:20,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:25:20,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:25:20,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:25:20,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:25:20,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:25:20,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:25:20,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:25:20,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:25:20,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:25:20,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:25:20,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:25:20,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:25:20,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:25:20,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:25:20,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:25:20,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:25:20,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:25:20,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:25:20,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:25:20,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:25:20,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:25:20,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:25:20,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:25:20,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:25:20,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:25:20,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:25:20,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:25:20,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:25:20,156 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:25:20,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:25:20,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:25:20,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:25:20,167 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:25:20,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:25:20,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:25:20,167 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:25:20,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:25:20,168 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:25:20,169 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:25:20,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:25:20,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:25:20,169 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:25:20,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:25:20,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:25:20,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:25:20,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:25:20,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:25:20,171 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:25:20,171 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:25:20,171 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_fbe82a90-3651-4e2a-90c1-23d85f667196/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 -> 2fc40f01120ca51e77cbf79a7824b0aac7011828 [2018-11-23 13:25:20,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:25:20,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:25:20,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:25:20,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:25:20,211 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:25:20,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c [2018-11-23 13:25:20,246 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/650f95b5c/f79eb5a0658642b7a5f4cad198540d34/FLAG8b13aab9f [2018-11-23 13:25:20,639 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:25:20,640 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/sv-benchmarks/c/float-newlib/double_req_bl_1032b_true-unreach-call.c [2018-11-23 13:25:20,644 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/650f95b5c/f79eb5a0658642b7a5f4cad198540d34/FLAG8b13aab9f [2018-11-23 13:25:20,652 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/data/650f95b5c/f79eb5a0658642b7a5f4cad198540d34 [2018-11-23 13:25:20,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:25:20,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:25:20,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:25:20,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:25:20,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:25:20,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f089c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20, skipping insertion in model container [2018-11-23 13:25:20,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:25:20,689 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:25:20,830 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:25:20,834 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:25:20,856 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:25:20,875 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:25:20,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20 WrapperNode [2018-11-23 13:25:20,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:25:20,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:25:20,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:25:20,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:25:20,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:25:20,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:25:20,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:25:20,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:25:20,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... [2018-11-23 13:25:20,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:25:20,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:25:20,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:25:20,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:25:20,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/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-23 13:25:20,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 13:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:25:20,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:25:20,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:25:20,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:25:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:25:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:25:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-11-23 13:25:20,995 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-11-23 13:25:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:25:20,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:25:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:25:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:25:21,121 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:25:21,236 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:25:21,254 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:25:21,254 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:25:21,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:21 BoogieIcfgContainer [2018-11-23 13:25:21,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:25:21,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:25:21,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:25:21,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:25:21,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:25:20" (1/3) ... [2018-11-23 13:25:21,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8f9ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:25:21, skipping insertion in model container [2018-11-23 13:25:21,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:20" (2/3) ... [2018-11-23 13:25:21,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8f9ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:25:21, skipping insertion in model container [2018-11-23 13:25:21,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:21" (3/3) ... [2018-11-23 13:25:21,260 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032b_true-unreach-call.c [2018-11-23 13:25:21,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:25:21,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:25:21,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:25:21,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:25:21,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:25:21,304 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:25:21,304 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:25:21,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:25:21,304 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:25:21,304 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:25:21,304 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:25:21,304 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:25:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-23 13:25:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:25:21,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:21,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:21,319 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:21,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1666868037, now seen corresponding path program 1 times [2018-11-23 13:25:21,324 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:21,324 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/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-23 13:25:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:21,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:21,383 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-23 13:25:21,383 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:21,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:21,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:25:21,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:25:21,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:25:21,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:25:21,403 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-23 13:25:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:21,416 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2018-11-23 13:25:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:25:21,417 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 13:25:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:21,422 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:25:21,423 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:25:21,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:25:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:25:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:25:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:25:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 13:25:21,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 19 [2018-11-23 13:25:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:21,453 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 13:25:21,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:25:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 13:25:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:25:21,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:21,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:21,454 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:21,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash -165901892, now seen corresponding path program 1 times [2018-11-23 13:25:21,455 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:21,455 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/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-23 13:25:21,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:21,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:21,598 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-23 13:25:21,598 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:21,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:21,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:25:21,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:25:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:25:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:25:21,611 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 7 states. [2018-11-23 13:25:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:22,025 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 13:25:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:25:22,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 13:25:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:22,028 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:25:22,028 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:25:22,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:25:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:25:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 13:25:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:25:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 13:25:22,035 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2018-11-23 13:25:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:22,035 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 13:25:22,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:25:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 13:25:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:25:22,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:22,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:22,037 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:22,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash 385538063, now seen corresponding path program 1 times [2018-11-23 13:25:22,037 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 13:25:22,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:22,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:22,839 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-23 13:25:22,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:22,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:22,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:25:22,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:25:22,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:25:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:25:22,847 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 7 states. [2018-11-23 13:25:23,745 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 13:25:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:24,735 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 13:25:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:25:24,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 13:25:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:24,737 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:25:24,737 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 13:25:24,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:25:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 13:25:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 13:25:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:25:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 13:25:24,743 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2018-11-23 13:25:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:24,743 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 13:25:24,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:25:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 13:25:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:25:24,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:24,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:24,744 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:24,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash 928852040, now seen corresponding path program 1 times [2018-11-23 13:25:24,745 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 13:25:24,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:24,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:24,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:24,855 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:24,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 13:25:24,913 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 27 treesize of output 24 [2018-11-23 13:25:24,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:24,926 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 24 treesize of output 18 [2018-11-23 13:25:24,934 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 18 treesize of output 4 [2018-11-23 13:25:24,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:24,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:24,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:24,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:25:24,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 13:25:25,031 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-23 13:25:25,032 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:25,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:25,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:25:25,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:25:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:25:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:25:25,041 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 7 states. [2018-11-23 13:25:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:26,077 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 13:25:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:25:26,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 13:25:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:26,078 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:25:26,078 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:25:26,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:25:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:25:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:25:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:25:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 13:25:26,081 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2018-11-23 13:25:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:26,082 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 13:25:26,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:25:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 13:25:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:25:26,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:26,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:26,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:26,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1090994049, now seen corresponding path program 1 times [2018-11-23 13:25:26,083 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:26,083 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 13:25:26,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:26,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:26,159 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:26,159 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:26,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 13:25:26,205 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 27 treesize of output 24 [2018-11-23 13:25:26,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,216 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 24 treesize of output 18 [2018-11-23 13:25:26,220 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 18 treesize of output 4 [2018-11-23 13:25:26,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:25:26,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 13:25:26,301 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-23 13:25:26,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:26,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:26,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:25:26,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:25:26,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:25:26,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:25:26,312 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 7 states. [2018-11-23 13:25:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:26,643 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 13:25:26,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:25:26,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 13:25:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:26,645 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:25:26,645 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:25:26,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:25:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:25:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:25:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:25:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:25:26,649 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2018-11-23 13:25:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:26,649 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:25:26,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:25:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:25:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:25:26,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:26,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:26,650 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:26,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:26,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1792058627, now seen corresponding path program 1 times [2018-11-23 13:25:26,651 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:26,651 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 13:25:26,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:26,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:26,721 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 51 treesize of output 45 [2018-11-23 13:25:26,723 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 45 treesize of output 38 [2018-11-23 13:25:26,732 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 29 treesize of output 21 [2018-11-23 13:25:26,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:26,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:25:26,738 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-23 13:25:26,785 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-23 13:25:26,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:26,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:26,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:25:26,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:25:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:25:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:25:26,793 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 8 states. [2018-11-23 13:25:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:26,910 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2018-11-23 13:25:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:25:26,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 13:25:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:26,911 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:25:26,911 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:25:26,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:25:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:25:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:25:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:25:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-11-23 13:25:26,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 24 [2018-11-23 13:25:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:26,915 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-11-23 13:25:26,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:25:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-11-23 13:25:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:25:26,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:25:26,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:25:26,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:25:26,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:25:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1819196168, now seen corresponding path program 1 times [2018-11-23 13:25:26,916 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:25:26,916 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 13:25:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:25:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:25:27,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:25:27,040 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:27,041 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:27,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 13:25:27,073 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:27,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 13:25:27,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,089 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 24 treesize of output 18 [2018-11-23 13:25:27,093 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 18 treesize of output 4 [2018-11-23 13:25:27,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:25:27,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 13:25:27,146 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 54 treesize of output 48 [2018-11-23 13:25:27,148 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 48 treesize of output 39 [2018-11-23 13:25:27,159 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 30 treesize of output 24 [2018-11-23 13:25:27,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:25:27,176 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:34 [2018-11-23 13:25:27,378 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:27,379 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:25:27,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 13:25:27,407 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 27 treesize of output 24 [2018-11-23 13:25:27,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,417 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 24 treesize of output 18 [2018-11-23 13:25:27,421 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 18 treesize of output 4 [2018-11-23 13:25:27,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:25:27,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:25:27,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 13:25:27,613 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-23 13:25:27,613 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:25:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:25:27,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 13:25:27,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:25:27,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:25:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:25:27,621 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 15 states. [2018-11-23 13:25:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:25:28,682 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2018-11-23 13:25:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:25:28,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:25:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:25:28,683 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:25:28,683 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:25:28,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:25:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:25:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:25:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:25:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:25:28,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-23 13:25:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:25:28,684 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:25:28,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:25:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:25:28,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:25:28,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:25:28,749 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 56) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point round_doubleFINAL(lines 17 64) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L451 ceAbstractionStarter]: At program point round_doubleENTRY(lines 17 64) the Hoare annotation is: true [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 40) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 17 64) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2018-11-23 13:25:28,750 INFO L448 ceAbstractionStarter]: For program point round_doubleEXIT(lines 17 64) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (= |round_double_#in~x| round_double_~x) [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 50) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 56) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 45) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L30-2(lines 30 31) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 36) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 66 76) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 66 76) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 66 76) the Hoare annotation is: true [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2018-11-23 13:25:28,751 INFO L444 ceAbstractionStarter]: At program point L69-2(lines 69 73) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-23 13:25:28,751 INFO L448 ceAbstractionStarter]: For program point L69-3(lines 69 73) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:25:28,752 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:25:28,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 78 96) the Hoare annotation is: true [2018-11-23 13:25:28,752 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L444 ceAbstractionStarter]: At program point L90-1(line 90) the Hoare annotation is: (and (exists ((v_prenex_9 (_ BitVec 64)) (round_double_~lsw~0 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)) (fp.neg (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_9)) round_double_~lsw~0))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) |main_#t~short10| (= main_~x~0 (fp.neg (_ +zero 11 53)))) [2018-11-23 13:25:28,752 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 78 96) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L448 ceAbstractionStarter]: For program point L90-2(line 90) no Hoare annotation was computed. [2018-11-23 13:25:28,752 INFO L444 ceAbstractionStarter]: At program point L87(line 87) the Hoare annotation is: (= main_~x~0 (fp.neg (_ +zero 11 53))) [2018-11-23 13:25:28,753 INFO L448 ceAbstractionStarter]: For program point L87-1(line 87) no Hoare annotation was computed. [2018-11-23 13:25:28,753 INFO L448 ceAbstractionStarter]: For program point L90-4(lines 90 93) no Hoare annotation was computed. [2018-11-23 13:25:28,753 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 78 96) no Hoare annotation was computed. [2018-11-23 13:25:28,753 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-23 13:25:28,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:25:28 BoogieIcfgContainer [2018-11-23 13:25:28,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:25:28,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:25:28,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:25:28,763 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:25:28,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:21" (3/4) ... [2018-11-23 13:25:28,765 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:25:28,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:25:28,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure round_double [2018-11-23 13:25:28,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 13:25:28,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:25:28,773 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 13:25:28,773 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 13:25:28,773 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:25:28,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:25:28,790 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:25:28,807 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fbe82a90-3651-4e2a-90c1-23d85f667196/bin-2019/uautomizer/witness.graphml [2018-11-23 13:25:28,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:25:28,807 INFO L168 Benchmark]: Toolchain (without parser) took 8151.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:25:28,808 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:25:28,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.72 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:28,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:25:28,808 INFO L168 Benchmark]: Boogie Preprocessor took 67.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:28,809 INFO L168 Benchmark]: RCFGBuilder took 292.83 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:28,809 INFO L168 Benchmark]: TraceAbstraction took 7507.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:25:28,809 INFO L168 Benchmark]: Witness Printer took 44.30 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-23 13:25:28,811 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.72 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.83 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7507.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Witness Printer took 44.30 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: - PositiveResult [Line: 91]: 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 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 238 SDtfs, 177 SDslu, 909 SDs, 0 SdLazy, 368 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 16 PreInvPairs, 19 NumberOfFragments, 58 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 155 ConstructedInterpolants, 47 QuantifiedInterpolants, 31336 SizeOfPredicates, 27 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...