./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1230_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_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b865bb4da04412be07ba7e2426d2224bb04a2953 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b865bb4da04412be07ba7e2426d2224bb04a2953 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:58:48,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:58:48,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:58:48,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:58:48,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:58:48,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:58:48,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:58:48,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:58:48,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:58:48,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:58:48,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:58:48,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:58:48,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:58:48,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:58:48,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:58:48,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:58:48,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:58:48,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:58:48,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:58:48,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:58:48,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:58:48,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:58:48,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:58:48,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:58:48,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:58:48,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:58:48,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:58:48,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:58:48,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:58:48,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:58:48,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:58:48,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:58:48,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:58:48,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:58:48,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:58:48,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:58:48,114 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 22:58:48,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:58:48,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:58:48,125 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:58:48,125 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:58:48,125 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:58:48,125 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:58:48,125 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:58:48,126 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:58:48,126 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:58:48,126 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:58:48,126 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:58:48,126 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:58:48,126 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:58:48,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:58:48,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:58:48,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:58:48,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:58:48,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:58:48,129 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2018-11-22 22:58:48,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:58:48,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:58:48,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:58:48,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:58:48,166 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:58:48,167 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-22 22:58:48,203 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/e0e13a83a/c790e2e174e1414f80152410e82e41d8/FLAGd417795b4 [2018-11-22 22:58:48,604 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:58:48,604 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-22 22:58:48,608 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/e0e13a83a/c790e2e174e1414f80152410e82e41d8/FLAGd417795b4 [2018-11-22 22:58:48,617 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/e0e13a83a/c790e2e174e1414f80152410e82e41d8 [2018-11-22 22:58:48,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:58:48,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:58:48,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:58:48,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:58:48,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:58:48,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548841d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48, skipping insertion in model container [2018-11-22 22:58:48,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:58:48,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:58:48,761 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:58:48,763 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:58:48,779 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:58:48,793 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:58:48,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48 WrapperNode [2018-11-22 22:58:48,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:58:48,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:58:48,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:58:48,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:58:48,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:58:48,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:58:48,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:58:48,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:58:48,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... [2018-11-22 22:58:48,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:58:48,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:58:48,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:58:48,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:58:48,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-22 22:58:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-22 22:58:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:58:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:58:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-22 22:58:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-22 22:58:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:58:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:58:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 22:58:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:58:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:58:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:58:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-22 22:58:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-22 22:58:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:58:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:58:49,065 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:58:49,065 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 22:58:49,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:49 BoogieIcfgContainer [2018-11-22 22:58:49,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:58:49,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:58:49,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:58:49,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:58:49,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:58:48" (1/3) ... [2018-11-22 22:58:49,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b194bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:58:49, skipping insertion in model container [2018-11-22 22:58:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:48" (2/3) ... [2018-11-22 22:58:49,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b194bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:58:49, skipping insertion in model container [2018-11-22 22:58:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:49" (3/3) ... [2018-11-22 22:58:49,072 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2018-11-22 22:58:49,079 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:58:49,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:58:49,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:58:49,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:58:49,115 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:58:49,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:58:49,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:58:49,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:58:49,115 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:58:49,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:58:49,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:58:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-22 22:58:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:58:49,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:49,131 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] [2018-11-22 22:58:49,132 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:49,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash -248042727, now seen corresponding path program 1 times [2018-11-22 22:58:49,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:58:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:58:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:49,232 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-22 22:58:49,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:49,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:58:49,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:58:49,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 22:58:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:58:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:58:49,246 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-22 22:58:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:49,260 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-22 22:58:49,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:58:49,261 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-22 22:58:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:49,267 INFO L225 Difference]: With dead ends: 71 [2018-11-22 22:58:49,267 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:58:49,269 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-22 22:58:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:58:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 22:58:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 22:58:49,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-22 22:58:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:49,294 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 22:58:49,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 22:58:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 22:58:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:58:49,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:49,296 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] [2018-11-22 22:58:49,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1557048336, now seen corresponding path program 1 times [2018-11-22 22:58:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:58:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:58:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:49,369 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-22 22:58:49,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:49,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:49,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:58:49,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:49,372 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-22 22:58:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:49,405 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-22 22:58:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:49,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-22 22:58:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:49,408 INFO L225 Difference]: With dead ends: 51 [2018-11-22 22:58:49,408 INFO L226 Difference]: Without dead ends: 40 [2018-11-22 22:58:49,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-22 22:58:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-22 22:58:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 22:58:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-22 22:58:49,416 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-22 22:58:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:49,417 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 22:58:49,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-22 22:58:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 22:58:49,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:49,418 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] [2018-11-22 22:58:49,418 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:49,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash 589129728, now seen corresponding path program 1 times [2018-11-22 22:58:49,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:58:49,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:49,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:58:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:49,462 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-22 22:58:49,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:49,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:49,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:58:49,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:49,463 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-22 22:58:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:49,490 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-22 22:58:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:49,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-22 22:58:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:49,491 INFO L225 Difference]: With dead ends: 55 [2018-11-22 22:58:49,491 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 22:58:49,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 22:58:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-22 22:58:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 22:58:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-22 22:58:49,497 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-22 22:58:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:49,497 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 22:58:49,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-22 22:58:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 22:58:49,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:49,498 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] [2018-11-22 22:58:49,498 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:49,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2096681537, now seen corresponding path program 1 times [2018-11-22 22:58:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:58:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:58:49,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:58:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:58:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:58:49,551 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4294967302, |#NULL.offset|=4294967298, |old(#NULL.base)|=4294967302, |old(#NULL.offset)|=4294967298] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967302, |old(#NULL.offset)|=4294967298] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967302, |old(#NULL.offset)|=4294967298] [?] RET #71#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967303.0, |fmin_double_#in~y|=4294967304.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_double_~x=4294967303.0, fmin_double_~y=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967303.0, |fmin_double_#in~y|=4294967304.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.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 := #t~mem0;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~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0] [?] goto; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967303.0, |__fpclassify_double_#res|=0] [?] RET #79#return; VAL [fmin_double_~x=4294967303.0, fmin_double_~y=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967303.0, |fmin_double_#in~y|=4294967304.0, |fmin_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmin_double_~x=4294967303.0, fmin_double_~y=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967303.0, |fmin_double_#in~y|=4294967304.0, |fmin_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmin_double_~x=4294967303.0, fmin_double_~y=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967303.0, |fmin_double_#in~y|=4294967304.0, |fmin_double_#res|=4294967304.0] [?] assume true; VAL [fmin_double_~x=4294967303.0, fmin_double_~y=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967303.0, |fmin_double_#in~y|=4294967304.0, |fmin_double_#res|=4294967304.0] [?] RET #75#return; VAL [main_~x~0=4294967303.0, main_~y~0=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=4294967304.0] [?] ~res~0 := #t~ret7;havoc #t~ret7; VAL [main_~res~0=4294967304.0, main_~x~0=4294967303.0, main_~y~0=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := isnan_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967304.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967304.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967304.0, |isnan_double_#res|=0] [?] RET #77#return; VAL [main_~res~0=4294967304.0, main_~x~0=4294967303.0, main_~y~0=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~res~0=4294967304.0, main_~x~0=4294967303.0, main_~y~0=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~res~0=4294967304.0, main_~x~0=4294967303.0, main_~y~0=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4294967304.0, main_~x~0=4294967303.0, main_~y~0=4294967304.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967302, #NULL.offset=4294967298, old(#NULL.base)=4294967302, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967302, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967302, old(#NULL.offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L61] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L62] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L63] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967303E9] [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 := #t~mem0; [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~mem2; [L24] havoc #t~union3; [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=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L27-L41] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L30-L41] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L33-L41] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L37-L41] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L41] #res := 0; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L17-L42] ensures true; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45-L46] assume 0 == #t~ret4; [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L44-L51] ensures true; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L63] RET call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L63] ~res~0 := #t~ret7; [L63] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967304E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967304E9] [L16] ensures true; VAL [#in~x=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967304E9] [L65] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65-L68] assume 0 == #t~ret8; [L65] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L66] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967302, #NULL.offset=4294967298, old(#NULL.base)=4294967302, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967302, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967302, old(#NULL.offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L61] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L62] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L63] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967303E9] [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 := #t~mem0; [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~mem2; [L24] havoc #t~union3; [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=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L27-L41] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L30-L41] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L33-L41] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L37-L41] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L41] #res := 0; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L17-L42] ensures true; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45-L46] assume 0 == #t~ret4; [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L44-L51] ensures true; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L63] RET call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L63] ~res~0 := #t~ret7; [L63] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967304E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967304E9] [L16] ensures true; VAL [#in~x=4.294967304E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967304E9] [L65] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65-L68] assume 0 == #t~ret8; [L65] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L66] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967302, #NULL!offset=4294967298, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L61] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L62] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9] [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 := #t~mem0; [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~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L63] RET call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L63] ~res~0 := #t~ret7; [L63] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967304E9] [L65] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] COND TRUE 0 == #t~ret8 [L65] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L66] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967302, #NULL!offset=4294967298, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L61] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L62] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9] [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 := #t~mem0; [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~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L63] RET call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L63] ~res~0 := #t~ret7; [L63] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967304E9] [L65] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] COND TRUE 0 == #t~ret8 [L65] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L66] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967302, #NULL!offset=4294967298, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L61] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L62] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9] [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 := #t~mem0; [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~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L63] RET call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L63] ~res~0 := #t~ret7; [L63] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967304E9] [L65] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] COND TRUE 0 == #t~ret8 [L65] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L66] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967302, #NULL!offset=4294967298, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967302, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L61] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L62] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L63] CALL call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967303E9] [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 := #t~mem0; [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~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967303E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967303E9, ~y=4.294967304E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967303E9, #in~y=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=4.294967304E9, ~x=4.294967303E9, ~y=4.294967304E9] [L63] RET call #t~ret7 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L63] ~res~0 := #t~ret7; [L63] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967304E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967304E9] [L65] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L65] COND TRUE 0 == #t~ret8 [L65] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L66] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967304E9, ~x~0=4.294967303E9, ~y~0=4.294967304E9] [L61] double x = 0.0 / 0.0; [L62] double y = 0.0 / 0.0; [L63] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967303, \old(y)=4294967304] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967303] [L18] __uint32_t msw, lsw; VAL [\old(x)=4294967303, x=4294967303] [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 [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967303, lsw=4294967297, msw=4293918721, x=4294967303] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967303, lsw=4294967297, msw=4293918721, x=4294967303] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967303, lsw=4294967297, msw=4293918721, x=4294967303] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; VAL [\old(x)=4294967303, \result=0, lsw=4294967297, msw=4293918721, x=4294967303] [L45] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967303, \old(y)=4294967304, __fpclassify_double(x)=0, x=4294967303, y=4294967304] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; VAL [\old(x)=4294967303, \old(y)=4294967304, \result=4294967304, x=4294967303, y=4294967304] [L63] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4294967304, x=4294967303, y=4294967304] [L63] double res = fmin_double(x, y); [L65] CALL, EXPR isnan_double(res) VAL [\old(x)=4294967304] [L16] return x != x; VAL [\old(x)=4294967304, \result=0, x=4294967304] [L65] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=4294967304, x=4294967303, y=4294967304] [L65] COND TRUE !isnan_double(res) [L66] __VERIFIER_error() VAL [res=4294967304, x=4294967303, y=4294967304] ----- [2018-11-22 22:58:49,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:58:49 BoogieIcfgContainer [2018-11-22 22:58:49,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:58:49,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:58:49,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:58:49,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:58:49,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:49" (3/4) ... [2018-11-22 22:58:49,591 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:58:49,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:58:49,592 INFO L168 Benchmark]: Toolchain (without parser) took 973.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -98.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:49,594 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:58:49,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.81 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:49,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.67 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:58:49,595 INFO L168 Benchmark]: Boogie Preprocessor took 57.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:49,595 INFO L168 Benchmark]: RCFGBuilder took 195.73 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:49,596 INFO L168 Benchmark]: TraceAbstraction took 521.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:49,596 INFO L168 Benchmark]: Witness Printer took 3.88 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-22 22:58:49,599 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.81 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 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.67 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 195.73 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 521.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 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: 66]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L61] double x = 0.0 / 0.0; [L62] double y = 0.0 / 0.0; [L63] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967303, \old(y)=4294967304] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967303] [L18] __uint32_t msw, lsw; VAL [\old(x)=4294967303, x=4294967303] [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 [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967303, lsw=4294967297, msw=4293918721, x=4294967303] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967303, lsw=4294967297, msw=4293918721, x=4294967303] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967303, lsw=4294967297, msw=4293918721, x=4294967303] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; VAL [\old(x)=4294967303, \result=0, lsw=4294967297, msw=4293918721, x=4294967303] [L45] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967303, \old(y)=4294967304, __fpclassify_double(x)=0, x=4294967303, y=4294967304] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; VAL [\old(x)=4294967303, \old(y)=4294967304, \result=4294967304, x=4294967303, y=4294967304] [L63] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4294967304, x=4294967303, y=4294967304] [L63] double res = fmin_double(x, y); [L65] CALL, EXPR isnan_double(res) VAL [\old(x)=4294967304] [L16] return x != x; VAL [\old(x)=4294967304, \result=0, x=4294967304] [L65] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=4294967304, x=4294967303, y=4294967304] [L65] COND TRUE !isnan_double(res) [L66] __VERIFIER_error() VAL [res=4294967304, x=4294967303, y=4294967304] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 0 SDslu, 152 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 2582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-22 22:58:51,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:58:51,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:58:51,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:58:51,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:58:51,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:58:51,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:58:51,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:58:51,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:58:51,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:58:51,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:58:51,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:58:51,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:58:51,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:58:51,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:58:51,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:58:51,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:58:51,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:58:51,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:58:51,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:58:51,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:58:51,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:58:51,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:58:51,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:58:51,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:58:51,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:58:51,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:58:51,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:58:51,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:58:51,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:58:51,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:58:51,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:58:51,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:58:51,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:58:51,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:58:51,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:58:51,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-22 22:58:51,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:58:51,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:58:51,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:58:51,086 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:58:51,086 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:58:51,086 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:58:51,086 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:58:51,087 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:58:51,087 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:58:51,087 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:58:51,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:58:51,088 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:58:51,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:58:51,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:58:51,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:58:51,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:58:51,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:58:51,089 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 22:58:51,090 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 22:58:51,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:58:51,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:58:51,090 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:58:51,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:58:51,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:58:51,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:58:51,091 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-22 22:58:51,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:58:51,092 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 22:58:51,092 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 22:58:51,092 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_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2018-11-22 22:58:51,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:58:51,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:58:51,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:58:51,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:58:51,136 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:58:51,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-22 22:58:51,173 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/d7ce83a17/5610faa8292d49799ab3d45f8831fd22/FLAG635c63065 [2018-11-22 22:58:51,497 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:58:51,498 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-22 22:58:51,502 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/d7ce83a17/5610faa8292d49799ab3d45f8831fd22/FLAG635c63065 [2018-11-22 22:58:51,933 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/data/d7ce83a17/5610faa8292d49799ab3d45f8831fd22 [2018-11-22 22:58:51,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:58:51,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:58:51,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:58:51,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:58:51,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:58:51,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:58:51" (1/1) ... [2018-11-22 22:58:51,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12511f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:51, skipping insertion in model container [2018-11-22 22:58:51,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:58:51" (1/1) ... [2018-11-22 22:58:51,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:58:51,964 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:58:52,093 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:58:52,097 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:58:52,117 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:58:52,135 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:58:52,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52 WrapperNode [2018-11-22 22:58:52,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:58:52,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:58:52,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:58:52,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:58:52,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:58:52,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:58:52,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:58:52,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:58:52,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... [2018-11-22 22:58:52,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:58:52,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:58:52,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:58:52,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:58:52,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-22 22:58:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-22 22:58:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-22 22:58:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:58:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:58:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-22 22:58:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-22 22:58:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:58:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:58:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:58:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 22:58:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:58:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:58:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-22 22:58:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-22 22:58:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:58:52,381 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 22:58:52,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:58:52,451 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 22:58:52,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:52 BoogieIcfgContainer [2018-11-22 22:58:52,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:58:52,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:58:52,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:58:52,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:58:52,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:58:51" (1/3) ... [2018-11-22 22:58:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc0467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:58:52, skipping insertion in model container [2018-11-22 22:58:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:52" (2/3) ... [2018-11-22 22:58:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc0467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:58:52, skipping insertion in model container [2018-11-22 22:58:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:52" (3/3) ... [2018-11-22 22:58:52,458 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2018-11-22 22:58:52,465 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:58:52,471 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:58:52,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:58:52,506 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:58:52,507 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:58:52,507 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:58:52,507 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:58:52,507 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:58:52,507 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:58:52,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:58:52,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:58:52,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:58:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-22 22:58:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 22:58:52,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:52,521 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-22 22:58:52,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:52,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash 294947040, now seen corresponding path program 1 times [2018-11-22 22:58:52,527 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:52,528 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:52,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:52,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:52,602 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-22 22:58:52,602 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:52,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:52,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:58:52,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 22:58:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:58:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:58:52,629 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-22 22:58:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:52,642 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-22 22:58:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:58:52,643 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-22 22:58:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:52,649 INFO L225 Difference]: With dead ends: 65 [2018-11-22 22:58:52,649 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 22:58:52,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-22 22:58:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 22:58:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 22:58:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 22:58:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-22 22:58:52,681 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-22 22:58:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:52,682 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-22 22:58:52,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 22:58:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-22 22:58:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 22:58:52,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:52,683 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] [2018-11-22 22:58:52,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:52,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash 321884391, now seen corresponding path program 1 times [2018-11-22 22:58:52,684 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:52,684 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:52,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:52,778 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-22 22:58:52,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:52,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:52,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:52,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:52,787 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-22 22:58:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:52,819 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-22 22:58:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:52,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-22 22:58:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:52,822 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:58:52,822 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:58:52,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:58:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 22:58:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 22:58:52,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-22 22:58:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:52,830 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 22:58:52,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 22:58:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:58:52,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:52,831 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] [2018-11-22 22:58:52,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:52,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2098210685, now seen corresponding path program 1 times [2018-11-22 22:58:52,832 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:52,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:52,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:52,909 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-22 22:58:52,909 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:52,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:52,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:52,922 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-22 22:58:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:52,950 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-22 22:58:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:52,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-22 22:58:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:52,951 INFO L225 Difference]: With dead ends: 49 [2018-11-22 22:58:52,951 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:58:52,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:58:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 22:58:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 22:58:52,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-22 22:58:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:52,956 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 22:58:52,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 22:58:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:58:52,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:52,957 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] [2018-11-22 22:58:52,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:52,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -985358741, now seen corresponding path program 1 times [2018-11-22 22:58:52,958 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:53,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:53,024 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-22 22:58:53,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:53,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:53,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:53,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:53,035 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-22 22:58:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:53,062 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-22 22:58:53,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:53,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-22 22:58:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:53,063 INFO L225 Difference]: With dead ends: 49 [2018-11-22 22:58:53,063 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:58:53,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:58:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 22:58:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 22:58:53,068 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-22 22:58:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:53,069 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 22:58:53,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 22:58:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 22:58:53,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:53,070 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] [2018-11-22 22:58:53,070 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:53,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2020298873, now seen corresponding path program 1 times [2018-11-22 22:58:53,071 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:53,071 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:53,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:53,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:53,127 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-22 22:58:53,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:53,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:53,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:53,136 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-22 22:58:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:53,165 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-22 22:58:53,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:53,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-22 22:58:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:53,167 INFO L225 Difference]: With dead ends: 49 [2018-11-22 22:58:53,167 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:58:53,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:58:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 22:58:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 22:58:53,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-22 22:58:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:53,172 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 22:58:53,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 22:58:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 22:58:53,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:53,173 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] [2018-11-22 22:58:53,173 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:53,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265416, now seen corresponding path program 1 times [2018-11-22 22:58:53,174 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:53,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:53,361 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-22 22:58:53,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:53,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:53,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 22:58:53,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:58:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:58:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:58:53,374 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-22 22:58:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:53,862 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-22 22:58:53,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:58:53,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-22 22:58:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:53,864 INFO L225 Difference]: With dead ends: 43 [2018-11-22 22:58:53,864 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:58:53,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:58:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:58:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-22 22:58:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 22:58:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-22 22:58:53,867 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-22 22:58:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:53,867 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-22 22:58:53,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:58:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-22 22:58:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 22:58:53,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:53,868 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-22 22:58:53,868 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:53,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash 225868180, now seen corresponding path program 1 times [2018-11-22 22:58:53,869 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:53,869 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/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-22 22:58:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:53,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:58:53,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:53,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:53,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:53,951 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-22 22:58:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:53,988 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-22 22:58:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:53,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-22 22:58:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:53,989 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:58:53,990 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:58:53,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:58:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 22:58:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 22:58:53,994 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-22 22:58:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:53,994 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 22:58:53,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 22:58:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 22:58:53,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:53,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-22 22:58:53,996 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:53,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash -924592112, now seen corresponding path program 1 times [2018-11-22 22:58:53,997 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-22 22:58:53,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:54,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:58:54,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:54,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:54,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:54,083 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-22 22:58:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:54,102 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-22 22:58:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:54,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-22 22:58:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:54,104 INFO L225 Difference]: With dead ends: 49 [2018-11-22 22:58:54,104 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:58:54,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:58:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 22:58:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 22:58:54,108 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-22 22:58:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:54,109 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 22:58:54,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 22:58:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 22:58:54,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:54,110 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-22 22:58:54,110 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:54,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1139309745, now seen corresponding path program 1 times [2018-11-22 22:58:54,111 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:54,111 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-22 22:58:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:54,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:58:54,280 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:54,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:54,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:58:54,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:58:54,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:58:54,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:58:54,289 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2018-11-22 22:58:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:54,525 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-22 22:58:54,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:58:54,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-22 22:58:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:54,526 INFO L225 Difference]: With dead ends: 47 [2018-11-22 22:58:54,526 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:58:54,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:58:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:58:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 22:58:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:58:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-22 22:58:54,530 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-22 22:58:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:54,530 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-22 22:58:54,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:58:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-22 22:58:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 22:58:54,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:54,531 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-22 22:58:54,531 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:54,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash -438245167, now seen corresponding path program 1 times [2018-11-22 22:58:54,532 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:54,532 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-22 22:58:54,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:54,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:58:54,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:54,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:54,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-22 22:58:54,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:58:54,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:58:54,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:58:54,726 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-11-22 22:58:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:55,064 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-22 22:58:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:58:55,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-22 22:58:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:55,065 INFO L225 Difference]: With dead ends: 43 [2018-11-22 22:58:55,065 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 22:58:55,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:58:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 22:58:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 22:58:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 22:58:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 22:58:55,069 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-22 22:58:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:55,069 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 22:58:55,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:58:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-22 22:58:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 22:58:55,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:55,070 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-22 22:58:55,070 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:55,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash 892232472, now seen corresponding path program 1 times [2018-11-22 22:58:55,070 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:55,070 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-22 22:58:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:55,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:58:55,150 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:55,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:55,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:55,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:55,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:55,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:55,158 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-22 22:58:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:55,166 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-22 22:58:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:55,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-22 22:58:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:55,167 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:58:55,167 INFO L226 Difference]: Without dead ends: 35 [2018-11-22 22:58:55,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-22 22:58:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-22 22:58:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 22:58:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 22:58:55,170 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-22 22:58:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:55,170 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 22:58:55,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-22 22:58:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 22:58:55,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:55,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-22 22:58:55,171 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:55,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash 205607700, now seen corresponding path program 1 times [2018-11-22 22:58:55,172 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:55,172 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-22 22:58:55,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:55,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:58:55,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:55,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:55,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:58:55,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:58:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:58:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:55,248 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-22 22:58:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:55,267 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-22 22:58:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:58:55,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-22 22:58:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:55,268 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:58:55,268 INFO L226 Difference]: Without dead ends: 35 [2018-11-22 22:58:55,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:58:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-22 22:58:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-22 22:58:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 22:58:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 22:58:55,272 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-22 22:58:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:55,272 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 22:58:55,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:58:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-22 22:58:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 22:58:55,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:58:55,273 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-22 22:58:55,274 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:58:55,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:58:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -87795307, now seen corresponding path program 1 times [2018-11-22 22:58:55,274 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 22:58:55,274 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-22 22:58:55,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:58:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:58:55,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:58:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:58:55,456 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:58:55,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:58:55,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 22:58:55,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:58:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:58:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:58:55,464 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-22 22:58:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:58:55,691 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-22 22:58:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:58:55,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-22 22:58:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:58:55,691 INFO L225 Difference]: With dead ends: 33 [2018-11-22 22:58:55,691 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 22:58:55,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:58:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 22:58:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 22:58:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 22:58:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:58:55,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-22 22:58:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:58:55,692 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:58:55,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:58:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:58:55,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 22:58:55,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 22:58:55,837 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-11-22 22:58:55,837 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-22 22:58:55,837 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-22 22:58:55,837 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2018-11-22 22:58:55,837 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 17 42) no Hoare annotation was computed. [2018-11-22 22:58:55,837 INFO L451 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 17 42) the Hoare annotation is: true [2018-11-22 22:58:55,837 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-11-22 22:58:55,837 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 17 42) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: true [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 22:58:55,838 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L444 ceAbstractionStarter]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~y~0 .cse0) (= main_~res~0 .cse0))) [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 68) no Hoare annotation was computed. [2018-11-22 22:58:55,838 INFO L444 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~x~0 .cse0) (= main_~y~0 .cse0))) [2018-11-22 22:58:55,838 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 66) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 53 71) the Hoare annotation is: true [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 53 71) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 53 71) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point fmin_doubleFINAL(lines 44 51) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L451 ceAbstractionStarter]: At program point fmin_doubleENTRY(lines 44 51) the Hoare annotation is: true [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point fmin_doubleEXIT(lines 44 51) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L444 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (and (= fmin_double_~y |fmin_double_#in~y|) (= fmin_double_~x |fmin_double_#in~x|)) [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 47 48) no Hoare annotation was computed. [2018-11-22 22:58:55,839 INFO L444 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (= fmin_double_~y |fmin_double_#in~y|) (= fmin_double_~x |fmin_double_#in~x|)) [2018-11-22 22:58:55,839 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 45 46) no Hoare annotation was computed. [2018-11-22 22:58:55,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:58:55 BoogieIcfgContainer [2018-11-22 22:58:55,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:58:55,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:58:55,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:58:55,843 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:58:55,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:52" (3/4) ... [2018-11-22 22:58:55,846 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 22:58:55,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-22 22:58:55,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-11-22 22:58:55,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 22:58:55,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 22:58:55,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_double [2018-11-22 22:58:55,853 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-22 22:58:55,853 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-22 22:58:55,853 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:58:55,886 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7a5f5385-de59-4583-bee0-dae316a8463c/bin-2019/utaipan/witness.graphml [2018-11-22 22:58:55,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:58:55,887 INFO L168 Benchmark]: Toolchain (without parser) took 3951.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 947.9 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:58:55,888 INFO L168 Benchmark]: CDTParser took 0.16 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-22 22:58:55,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.59 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 931.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:55,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.47 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:58:55,889 INFO L168 Benchmark]: Boogie Preprocessor took 21.06 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:58:55,889 INFO L168 Benchmark]: RCFGBuilder took 277.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:55,889 INFO L168 Benchmark]: TraceAbstraction took 3390.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.8 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:55,890 INFO L168 Benchmark]: Witness Printer took 43.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:58:55,891 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.16 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 199.59 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 931.7 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 16.47 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.06 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 277.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3390.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.8 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. * Witness Printer took 43.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 66]: 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: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 497 SDtfs, 31 SDslu, 1314 SDs, 0 SdLazy, 218 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 13 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 28 PreInvPairs, 33 NumberOfFragments, 48 HoareAnnotationTreeSize, 28 FomulaSimplifications, 20 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 389 ConstructedInterpolants, 3 QuantifiedInterpolants, 21339 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...