./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_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-23 13:19:03,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:19:03,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:19:03,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:19:03,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:19:03,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:19:03,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:19:03,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:19:03,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:19:03,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:19:03,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:19:03,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:19:03,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:19:03,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:19:03,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:19:03,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:19:03,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:19:03,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:19:03,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:19:03,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:19:03,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:19:03,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:19:03,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:19:03,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:19:03,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:19:03,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:19:03,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:19:03,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:19:03,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:19:03,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:19:03,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:19:03,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:19:03,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:19:03,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:19:03,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:19:03,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:19:03,933 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:19:03,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:19:03,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:19:03,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:19:03,943 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:19:03,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:19:03,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:19:03,944 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:19:03,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:19:03,944 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:19:03,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:19:03,945 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:19:03,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:19:03,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:19:03,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:19:03,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:19:03,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:19:03,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:19:03,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:19:03,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:19:03,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:19:03,947 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:19:03,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:19:03,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:19:03,947 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_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2018-11-23 13:19:03,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:19:03,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:19:03,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:19:03,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:19:03,984 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:19:03,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-23 13:19:04,022 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/1ce80c7ba/ddf1ccd57c4244549a5315bc79ee4007/FLAG07c184aa5 [2018-11-23 13:19:04,429 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:19:04,429 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-23 13:19:04,433 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/1ce80c7ba/ddf1ccd57c4244549a5315bc79ee4007/FLAG07c184aa5 [2018-11-23 13:19:04,443 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/1ce80c7ba/ddf1ccd57c4244549a5315bc79ee4007 [2018-11-23 13:19:04,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:19:04,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:19:04,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:19:04,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:19:04,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:19:04,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04, skipping insertion in model container [2018-11-23 13:19:04,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:19:04,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:19:04,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:19:04,618 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:19:04,633 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:19:04,650 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:19:04,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04 WrapperNode [2018-11-23 13:19:04,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:19:04,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:19:04,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:19:04,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:19:04,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:19:04,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:19:04,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:19:04,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:19:04,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... [2018-11-23 13:19:04,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:19:04,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:19:04,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:19:04,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:19:04,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:19:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 13:19:04,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 13:19:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:19:04,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:19:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 13:19:04,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 13:19:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:19:04,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:19:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:19:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:19:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:19:04,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:19:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 13:19:04,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 13:19:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:19:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:19:04,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:19:04,923 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:19:04,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:04 BoogieIcfgContainer [2018-11-23 13:19:04,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:19:04,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:19:04,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:19:04,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:19:04,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:19:04" (1/3) ... [2018-11-23 13:19:04,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354fdc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:19:04, skipping insertion in model container [2018-11-23 13:19:04,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:04" (2/3) ... [2018-11-23 13:19:04,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354fdc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:19:04, skipping insertion in model container [2018-11-23 13:19:04,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:04" (3/3) ... [2018-11-23 13:19:04,929 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2018-11-23 13:19:04,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:19:04,942 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:19:04,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:19:04,971 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:19:04,971 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:19:04,971 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:19:04,972 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:19:04,972 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:19:04,972 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:19:04,972 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:19:04,972 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:19:04,972 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:19:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 13:19:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:19:04,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:04,988 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-23 13:19:04,990 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:04,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -248042727, now seen corresponding path program 1 times [2018-11-23 13:19:04,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:04,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:05,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:05,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:19:05,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:19:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:19:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:19:05,102 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 13:19:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:05,117 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 13:19:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:19:05,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-23 13:19:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:05,124 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:19:05,124 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:19:05,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:19:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:19:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:19:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 13:19:05,155 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-23 13:19:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:05,155 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 13:19:05,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:19:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:19:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:19:05,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:05,157 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-23 13:19:05,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:05,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1557048336, now seen corresponding path program 1 times [2018-11-23 13:19:05,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:05,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:05,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:05,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:05,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:05,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:05,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:05,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:05,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:05,226 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 13:19:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:05,263 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:19:05,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:05,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 13:19:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:05,265 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:19:05,265 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:19:05,266 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-23 13:19:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:19:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:19:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:19:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 13:19:05,271 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 13:19:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:05,271 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 13:19:05,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:19:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:19:05,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:05,273 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-23 13:19:05,273 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:05,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 589129728, now seen corresponding path program 1 times [2018-11-23 13:19:05,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:05,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:05,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:05,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:05,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:05,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:05,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:05,328 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 13:19:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:05,355 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 13:19:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:05,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 13:19:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:05,357 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:19:05,357 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:19:05,358 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-23 13:19:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:19:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-23 13:19:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:19:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 13:19:05,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-23 13:19:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:05,362 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 13:19:05,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:19:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:19:05,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:05,363 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-23 13:19:05,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:05,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2096681537, now seen corresponding path program 1 times [2018-11-23 13:19:05,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:05,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:05,414 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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__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~union3; [L24] havoc #t~mem2; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=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~union3; [L24] havoc #t~mem2; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=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~union3; [L24] havoc #t~mem2; [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~union3; [L24] havoc #t~mem2; [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~union3; [L24] havoc #t~mem2; [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~union3; [L24] havoc #t~mem2; [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-23 13:19:05,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:19:05 BoogieIcfgContainer [2018-11-23 13:19:05,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:19:05,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:19:05,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:19:05,456 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:19:05,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:04" (3/4) ... [2018-11-23 13:19:05,459 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:19:05,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:19:05,460 INFO L168 Benchmark]: Toolchain (without parser) took 1014.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:05,461 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:05,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 939.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:05,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.90 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:05,462 INFO L168 Benchmark]: Boogie Preprocessor took 57.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:05,463 INFO L168 Benchmark]: RCFGBuilder took 199.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:05,463 INFO L168 Benchmark]: TraceAbstraction took 531.55 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:05,463 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:05,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 939.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.90 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 531.55 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 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.1s 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.1s 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-23 13:19:06,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:19:06,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:19:06,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:19:06,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:19:06,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:19:06,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:19:06,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:19:06,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:19:06,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:19:06,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:19:06,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:19:06,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:19:06,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:19:06,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:19:06,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:19:06,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:19:06,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:19:06,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:19:06,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:19:06,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:19:06,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:19:06,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:19:06,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:19:06,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:19:06,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:19:06,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:19:06,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:19:06,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:19:06,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:19:06,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:19:06,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:19:06,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:19:06,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:19:06,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:19:06,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:19:06,954 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:19:06,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:19:06,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:19:06,965 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:19:06,966 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:19:06,966 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:19:06,966 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:19:06,966 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:19:06,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:19:06,967 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:19:06,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:19:06,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:19:06,968 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:19:06,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:19:06,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:19:06,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:19:06,968 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:19:06,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:19:06,969 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:19:06,970 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:19:06,970 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_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2018-11-23 13:19:06,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:19:07,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:19:07,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:19:07,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:19:07,014 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:19:07,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-23 13:19:07,059 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/4ce28d52c/5a891cfcbd9b4f8b9097525d01fcc599/FLAG573030a7a [2018-11-23 13:19:07,386 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:19:07,387 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/sv-benchmarks/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-11-23 13:19:07,391 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/4ce28d52c/5a891cfcbd9b4f8b9097525d01fcc599/FLAG573030a7a [2018-11-23 13:19:07,819 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/data/4ce28d52c/5a891cfcbd9b4f8b9097525d01fcc599 [2018-11-23 13:19:07,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:19:07,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:19:07,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:19:07,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:19:07,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:19:07,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:19:07" (1/1) ... [2018-11-23 13:19:07,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284314a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:07, skipping insertion in model container [2018-11-23 13:19:07,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:19:07" (1/1) ... [2018-11-23 13:19:07,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:19:07,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:19:07,976 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:19:07,979 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:19:07,998 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:19:08,017 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:19:08,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08 WrapperNode [2018-11-23 13:19:08,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:19:08,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:19:08,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:19:08,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:19:08,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:19:08,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:19:08,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:19:08,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:19:08,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... [2018-11-23 13:19:08,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:19:08,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:19:08,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:19:08,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:19:08,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:19:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 13:19:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:19:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 13:19:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:19:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:19:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:19:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:19:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 13:19:08,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 13:19:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:19:08,257 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:19:08,324 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:19:08,324 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:19:08,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:08 BoogieIcfgContainer [2018-11-23 13:19:08,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:19:08,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:19:08,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:19:08,327 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:19:08,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:19:07" (1/3) ... [2018-11-23 13:19:08,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11289f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:19:08, skipping insertion in model container [2018-11-23 13:19:08,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:08" (2/3) ... [2018-11-23 13:19:08,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11289f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:19:08, skipping insertion in model container [2018-11-23 13:19:08,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:08" (3/3) ... [2018-11-23 13:19:08,331 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2018-11-23 13:19:08,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:19:08,344 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:19:08,357 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:19:08,380 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:19:08,381 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:19:08,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:19:08,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:19:08,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:19:08,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:19:08,381 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:19:08,381 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:19:08,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:19:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 13:19:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:19:08,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:08,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:08,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:08,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 294947040, now seen corresponding path program 1 times [2018-11-23 13:19:08,405 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:08,406 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:08,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:08,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:08,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:08,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:08,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:19:08,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:19:08,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:19:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:19:08,502 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 13:19:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:08,517 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 13:19:08,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:19:08,518 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 13:19:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:08,526 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:19:08,527 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:19:08,530 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-23 13:19:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:19:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:19:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:19:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 13:19:08,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-23 13:19:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:08,559 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 13:19:08,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:19:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:19:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:19:08,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:08,562 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-23 13:19:08,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:08,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 321884391, now seen corresponding path program 1 times [2018-11-23 13:19:08,563 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:08,563 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:08,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:08,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:08,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:08,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:08,660 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-23 13:19:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:08,691 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 13:19:08,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:08,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 13:19:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:08,695 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:19:08,695 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:19:08,695 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-23 13:19:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:19:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:19:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 13:19:08,702 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-23 13:19:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:08,702 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 13:19:08,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:19:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:19:08,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:08,703 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-23 13:19:08,703 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:08,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2098210685, now seen corresponding path program 1 times [2018-11-23 13:19:08,704 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:08,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:08,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:08,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:08,769 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:08,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:08,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:08,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:08,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:08,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:08,778 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 13:19:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:08,812 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 13:19:08,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:08,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 13:19:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:08,814 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:19:08,814 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:19:08,814 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-23 13:19:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:19:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 13:19:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 13:19:08,820 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-23 13:19:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:08,820 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 13:19:08,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:19:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:19:08,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:08,821 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-23 13:19:08,821 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:08,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash -985358741, now seen corresponding path program 1 times [2018-11-23 13:19:08,822 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:08,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:08,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:08,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:08,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:08,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:08,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:08,896 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 13:19:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:08,923 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 13:19:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:08,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 13:19:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:08,925 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:19:08,925 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:19:08,925 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-23 13:19:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:19:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 13:19:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 13:19:08,930 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-23 13:19:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:08,930 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 13:19:08,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:19:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:19:08,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:08,931 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-23 13:19:08,932 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:08,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:08,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2020298873, now seen corresponding path program 1 times [2018-11-23 13:19:08,932 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:08,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:08,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:08,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:08,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:08,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:08,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:08,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:08,993 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 13:19:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:09,022 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 13:19:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:09,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 13:19:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:09,023 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:19:09,023 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:19:09,023 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-23 13:19:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:19:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 13:19:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 13:19:09,027 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-23 13:19:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:09,027 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 13:19:09,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:19:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:19:09,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:09,028 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-23 13:19:09,028 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:09,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265416, now seen corresponding path program 1 times [2018-11-23 13:19:09,029 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:09,029 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:09,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:09,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:09,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:09,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:19:09,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:19:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:19:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:19:09,220 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-23 13:19:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:09,688 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 13:19:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:19:09,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 13:19:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:09,689 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:19:09,689 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:19:09,689 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-23 13:19:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:19:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 13:19:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:19:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 13:19:09,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-23 13:19:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:09,693 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 13:19:09,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:19:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 13:19:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:19:09,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:09,694 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-23 13:19:09,694 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:09,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash 225868180, now seen corresponding path program 1 times [2018-11-23 13:19:09,695 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:09,695 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 13:19:09,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:09,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:09,780 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-23 13:19:09,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:09,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:09,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:09,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:09,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:09,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:09,793 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 13:19:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:09,823 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 13:19:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:09,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 13:19:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:09,824 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:19:09,824 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:19:09,825 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-23 13:19:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:19:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:19:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 13:19:09,828 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-23 13:19:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:09,828 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 13:19:09,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:19:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:19:09,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:09,829 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-23 13:19:09,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:09,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:09,830 INFO L82 PathProgramCache]: Analyzing trace with hash -924592112, now seen corresponding path program 1 times [2018-11-23 13:19:09,831 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:09,831 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/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-23 13:19:09,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:09,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:09,912 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-23 13:19:09,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:09,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:09,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:09,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:09,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:09,925 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 13:19:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:09,947 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 13:19:09,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:09,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 13:19:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:09,948 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:19:09,948 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:19:09,949 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-23 13:19:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:19:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 13:19:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 13:19:09,952 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-23 13:19:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:09,952 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 13:19:09,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:19:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:19:09,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:09,953 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-23 13:19:09,953 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:09,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1139309745, now seen corresponding path program 1 times [2018-11-23 13:19:09,954 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/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-23 13:19:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:10,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:10,118 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-23 13:19:10,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:10,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:10,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:19:10,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:19:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:19:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:19:10,127 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2018-11-23 13:19:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:10,352 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 13:19:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:19:10,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 13:19:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:10,354 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:19:10,354 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:19:10,354 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-23 13:19:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:19:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:19:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:19:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 13:19:10,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-23 13:19:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:10,357 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 13:19:10,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:19:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 13:19:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:19:10,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:10,358 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-23 13:19:10,358 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:10,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash -438245167, now seen corresponding path program 1 times [2018-11-23 13:19:10,359 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/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-23 13:19:10,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:10,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:10,562 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-23 13:19:10,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:10,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:10,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 13:19:10,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:19:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:19:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:19:10,571 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-11-23 13:19:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:10,916 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 13:19:10,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:19:10,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 13:19:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:10,917 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:19:10,917 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:19:10,917 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-23 13:19:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:19:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:19:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:19:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:19:10,921 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 13:19:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:10,921 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:19:10,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:19:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:19:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:19:10,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:10,922 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-23 13:19:10,922 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:10,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash 892232472, now seen corresponding path program 1 times [2018-11-23 13:19:10,922 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/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-23 13:19:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:10,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:10,989 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-23 13:19:10,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:10,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:10,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:10,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:10,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:10,997 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 13:19:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:11,004 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 13:19:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:11,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 13:19:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:11,005 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:19:11,005 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:19:11,005 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-23 13:19:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:19:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:19:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:19:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:19:11,008 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 13:19:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:19:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:19:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:19:11,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:11,009 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-23 13:19:11,009 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:11,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 205607700, now seen corresponding path program 1 times [2018-11-23 13:19:11,010 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/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-23 13:19:11,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:11,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:11,082 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-23 13:19:11,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:11,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:11,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:19:11,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:19:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:19:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:19:11,090 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 13:19:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:11,107 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 13:19:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:19:11,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 13:19:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:11,108 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:19:11,108 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:19:11,108 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-23 13:19:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:19:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:19:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:19:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:19:11,111 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-23 13:19:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:11,111 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:19:11,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:19:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:19:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:19:11,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:19:11,112 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-23 13:19:11,113 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:19:11,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:11,113 INFO L82 PathProgramCache]: Analyzing trace with hash -87795307, now seen corresponding path program 1 times [2018-11-23 13:19:11,113 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:19:11,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/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-23 13:19:11,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:11,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:11,269 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-23 13:19:11,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:19:11,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:11,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:19:11,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:19:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:19:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:19:11,277 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-23 13:19:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:11,507 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:19:11,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:19:11,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 13:19:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:19:11,507 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:19:11,508 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:19:11,508 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-23 13:19:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:19:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:19:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:19:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:19:11,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-23 13:19:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:19:11,509 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:19:11,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:19:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:19:11,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:19:11,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:19:11,644 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 17 42) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L451 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 17 42) the Hoare annotation is: true [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 17 42) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: true [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2018-11-23 13:19:11,644 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:19:11,645 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:19:11,645 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:19:11,645 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:19:11,645 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-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 68) no Hoare annotation was computed. [2018-11-23 13:19:11,645 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-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-11-23 13:19:11,645 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 53 71) the Hoare annotation is: true [2018-11-23 13:19:11,645 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 53 71) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 66) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 53 71) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point fmin_doubleFINAL(lines 44 51) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L451 ceAbstractionStarter]: At program point fmin_doubleENTRY(lines 44 51) the Hoare annotation is: true [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point fmin_doubleEXIT(lines 44 51) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-11-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-11-23 13:19:11,646 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-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 47 48) no Hoare annotation was computed. [2018-11-23 13:19:11,646 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-23 13:19:11,646 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 45 46) no Hoare annotation was computed. [2018-11-23 13:19:11,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:19:11 BoogieIcfgContainer [2018-11-23 13:19:11,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:19:11,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:19:11,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:19:11,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:19:11,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:08" (3/4) ... [2018-11-23 13:19:11,654 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:19:11,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 13:19:11,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-11-23 13:19:11,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:19:11,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:19:11,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_double [2018-11-23 13:19:11,661 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-23 13:19:11,661 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:19:11,662 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:19:11,692 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a88b13ad-06ec-4180-a655-492d79e79ea9/bin-2019/uautomizer/witness.graphml [2018-11-23 13:19:11,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:19:11,693 INFO L168 Benchmark]: Toolchain (without parser) took 3869.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -224.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:11,694 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:11,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.00 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:11,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.23 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:11,694 INFO L168 Benchmark]: Boogie Preprocessor took 21.25 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:11,694 INFO L168 Benchmark]: RCFGBuilder took 266.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:11,695 INFO L168 Benchmark]: TraceAbstraction took 3325.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.1 MB). Peak memory consumption was 311.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:11,695 INFO L168 Benchmark]: Witness Printer took 40.73 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.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:11,699 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.00 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.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 18.23 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.25 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3325.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.1 MB). Peak memory consumption was 311.3 MB. Max. memory is 11.5 GB. * Witness Printer took 40.73 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.6 MB). Peak memory consumption was 7.6 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.2s 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.8s 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.0s 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...