./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1250_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_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 01b6390e563edc58f3f7d1f239b082df891f9006 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 01b6390e563edc58f3f7d1f239b082df891f9006 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:55:26,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:55:26,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:55:26,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:55:26,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:55:26,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:55:26,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:55:26,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:55:26,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:55:26,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:55:26,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:55:26,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:55:26,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:55:26,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:55:26,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:55:26,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:55:26,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:55:26,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:55:26,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:55:26,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:55:26,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:55:26,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:55:26,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:55:26,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:55:26,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:55:26,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:55:26,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:55:26,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:55:26,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:55:26,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:55:26,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:55:26,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:55:26,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:55:26,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:55:26,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:55:26,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:55:26,989 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 14:55:26,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:55:26,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:55:26,999 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:55:26,999 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:55:27,000 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:55:27,000 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:55:27,000 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:55:27,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:55:27,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:55:27,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:55:27,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:55:27,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:55:27,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:55:27,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:55:27,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:55:27,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:55:27,002 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_361ef870-8988-4614-884a-5151c3c561ba/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 -> 01b6390e563edc58f3f7d1f239b082df891f9006 [2018-11-23 14:55:27,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:55:27,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:55:27,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:55:27,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:55:27,045 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:55:27,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 14:55:27,087 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/aa34acc1c/295fd891142d478ab8e8165e3c38ebc9/FLAG73b9c4f25 [2018-11-23 14:55:27,483 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:55:27,483 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 14:55:27,487 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/aa34acc1c/295fd891142d478ab8e8165e3c38ebc9/FLAG73b9c4f25 [2018-11-23 14:55:27,500 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/aa34acc1c/295fd891142d478ab8e8165e3c38ebc9 [2018-11-23 14:55:27,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:55:27,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:55:27,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:55:27,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:55:27,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:55:27,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf86f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27, skipping insertion in model container [2018-11-23 14:55:27,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:55:27,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:55:27,639 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:55:27,641 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:55:27,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:55:27,672 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:55:27,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27 WrapperNode [2018-11-23 14:55:27,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:55:27,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:55:27,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:55:27,674 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:55:27,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:55:27,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:55:27,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:55:27,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:55:27,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... [2018-11-23 14:55:27,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:55:27,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:55:27,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:55:27,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:55:27,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 14:55:27,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 14:55:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:55:27,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:55:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 14:55:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 14:55:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:55:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:55:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 14:55:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 14:55:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 14:55:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:55:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:55:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:55:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:55:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:55:27,974 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:55:27,974 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:55:27,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:55:27 BoogieIcfgContainer [2018-11-23 14:55:27,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:55:27,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:55:27,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:55:27,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:55:27,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:55:27" (1/3) ... [2018-11-23 14:55:27,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0c2793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:55:27, skipping insertion in model container [2018-11-23 14:55:27,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:27" (2/3) ... [2018-11-23 14:55:27,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0c2793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:55:27, skipping insertion in model container [2018-11-23 14:55:27,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:55:27" (3/3) ... [2018-11-23 14:55:27,981 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250_true-unreach-call.c [2018-11-23 14:55:27,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:55:27,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:55:28,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:55:28,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:55:28,035 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:55:28,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:55:28,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:55:28,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:55:28,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:55:28,036 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:55:28,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:55:28,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:55:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 14:55:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:55:28,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:28,058 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 14:55:28,059 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:28,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1777529962, now seen corresponding path program 1 times [2018-11-23 14:55:28,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:55:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:55:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:28,149 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 14:55:28,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:28,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:55:28,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:55:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:55:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:55:28,164 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 14:55:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:28,179 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 14:55:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:55:28,179 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-23 14:55:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:28,185 INFO L225 Difference]: With dead ends: 71 [2018-11-23 14:55:28,185 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:55:28,188 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 14:55:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:55:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:55:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 14:55:28,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-23 14:55:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:28,216 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 14:55:28,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:55:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 14:55:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:55:28,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:28,217 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 14:55:28,218 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:28,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1782564235, now seen corresponding path program 1 times [2018-11-23 14:55:28,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:55:28,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:55:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:28,295 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 14:55:28,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:28,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:28,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:28,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:28,297 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 14:55:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:28,324 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 14:55:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:28,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 14:55:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:28,326 INFO L225 Difference]: With dead ends: 51 [2018-11-23 14:55:28,327 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 14:55:28,327 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 14:55:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 14:55:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 14:55:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 14:55:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 14:55:28,336 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 14:55:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:28,336 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 14:55:28,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 14:55:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:55:28,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:28,337 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 14:55:28,337 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 105963089, now seen corresponding path program 1 times [2018-11-23 14:55:28,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:55:28,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:55:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:28,384 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 14:55:28,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:28,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:28,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:28,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:28,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:28,385 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 14:55:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:28,411 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 14:55:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:28,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 14:55:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:28,412 INFO L225 Difference]: With dead ends: 55 [2018-11-23 14:55:28,412 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 14:55:28,413 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 14:55:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 14:55:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-23 14:55:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 14:55:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 14:55:28,418 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-23 14:55:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:28,418 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 14:55:28,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 14:55:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:55:28,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:28,420 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 14:55:28,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:28,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1613514898, now seen corresponding path program 1 times [2018-11-23 14:55:28,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:55:28,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:55:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:55:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:55:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:55:28,469 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4294967304, |#NULL.offset|=4294967298, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] RET #75#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 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.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=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] goto; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.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=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.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=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.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=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.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=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0, |__fpclassify_double_#res|=0] [?] RET #71#return; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#res|=4294967303.0] [?] assume true; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#res|=4294967303.0] [?] RET #79#return; VAL [main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=4294967303.0] [?] ~res~0 := #t~ret7;havoc #t~ret7; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.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|=4294967303.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967303.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967303.0, |isnan_double_#res|=0] [?] RET #81#return; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967304, #NULL.offset=4294967298, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, 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] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9] [L30] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L32] ~msw~0 := #t~mem0; [L32] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L33] ~lsw~0 := #t~mem2; [L33] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L30] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L50] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L50] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L50] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L50] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L26-L51] ensures true; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55-L56] assume 0 == #t~ret4; [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L53-L61] ensures true; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L16] ensures true; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71-L74] assume 0 == #t~ret8; [L71] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967304, #NULL.offset=4294967298, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, 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] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9] [L30] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L32] ~msw~0 := #t~mem0; [L32] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L33] ~lsw~0 := #t~mem2; [L33] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L30] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L50] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L50] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L50] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L50] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L26-L51] ensures true; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55-L56] assume 0 == #t~ret4; [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L53-L61] ensures true; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L16] ensures true; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71-L74] assume 0 == #t~ret8; [L71] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, 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] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, 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] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, 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] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, 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] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L67] double x = 0.0 / 0.0; [L68] double y = 0.0 / 0.0; [L69] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967303] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967303, __fpclassify_double(x)=0, x=4294967302, y=4294967303] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967302, \old(y)=4294967303, \result=4294967303, x=4294967302, y=4294967303] [L69] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967303, x=4294967302, y=4294967303] [L69] double res = fmax_double(x, y); [L71] CALL, EXPR isnan_double(res) VAL [\old(x)=4294967303] [L16] return x != x; VAL [\old(x)=4294967303, \result=0, x=4294967303] [L71] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=4294967303, x=4294967302, y=4294967303] [L71] COND TRUE !isnan_double(res) [L72] __VERIFIER_error() VAL [res=4294967303, x=4294967302, y=4294967303] ----- [2018-11-23 14:55:28,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:55:28 BoogieIcfgContainer [2018-11-23 14:55:28,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:55:28,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:55:28,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:55:28,509 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:55:28,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:55:27" (3/4) ... [2018-11-23 14:55:28,512 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:55:28,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:55:28,513 INFO L168 Benchmark]: Toolchain (without parser) took 1010.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:28,514 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:28,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.16 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 945.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:28,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.59 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:28,516 INFO L168 Benchmark]: Boogie Preprocessor took 59.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 945.1 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:28,516 INFO L168 Benchmark]: RCFGBuilder took 225.55 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:28,516 INFO L168 Benchmark]: TraceAbstraction took 533.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:28,517 INFO L168 Benchmark]: Witness Printer took 3.79 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 14:55:28,519 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.16 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 945.1 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 15.59 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 945.1 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.55 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 533.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 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: 72]: 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 67. Possible FailurePath: [L67] double x = 0.0 / 0.0; [L68] double y = 0.0 / 0.0; [L69] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967303] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967303, __fpclassify_double(x)=0, x=4294967302, y=4294967303] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967302, \old(y)=4294967303, \result=4294967303, x=4294967302, y=4294967303] [L69] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967303, x=4294967302, y=4294967303] [L69] double res = fmax_double(x, y); [L71] CALL, EXPR isnan_double(res) VAL [\old(x)=4294967303] [L16] return x != x; VAL [\old(x)=4294967303, \result=0, x=4294967303] [L71] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=4294967303, x=4294967302, y=4294967303] [L71] COND TRUE !isnan_double(res) [L72] __VERIFIER_error() VAL [res=4294967303, x=4294967302, y=4294967303] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 0 SDslu, 152 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.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 14:55:29,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:55:29,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:55:29,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:55:29,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:55:29,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:55:29,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:55:29,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:55:29,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:55:29,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:55:29,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:55:29,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:55:29,974 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:55:29,975 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:55:29,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:55:29,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:55:29,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:55:29,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:55:29,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:55:29,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:55:29,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:55:29,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:55:29,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:55:29,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:55:29,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:55:29,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:55:29,986 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:55:29,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:55:29,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:55:29,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:55:29,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:55:29,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:55:29,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:55:29,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:55:29,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:55:29,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:55:29,991 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 14:55:30,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:55:30,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:55:30,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:55:30,002 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:55:30,002 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:55:30,003 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:55:30,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:55:30,004 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:55:30,004 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:55:30,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:55:30,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:55:30,005 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:55:30,005 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:55:30,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:55:30,005 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:55:30,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:55:30,006 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:55:30,006 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_361ef870-8988-4614-884a-5151c3c561ba/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 -> 01b6390e563edc58f3f7d1f239b082df891f9006 [2018-11-23 14:55:30,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:55:30,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:55:30,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:55:30,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:55:30,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:55:30,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 14:55:30,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/b5c674972/60a8295ebb7d40c1a2162c64737afdb4/FLAGce5bddc47 [2018-11-23 14:55:30,468 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:55:30,468 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 14:55:30,473 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/b5c674972/60a8295ebb7d40c1a2162c64737afdb4/FLAGce5bddc47 [2018-11-23 14:55:30,480 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/data/b5c674972/60a8295ebb7d40c1a2162c64737afdb4 [2018-11-23 14:55:30,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:55:30,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:55:30,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:55:30,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:55:30,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:55:30,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30, skipping insertion in model container [2018-11-23 14:55:30,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:55:30,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:55:30,664 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:55:30,669 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:55:30,694 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:55:30,718 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:55:30,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30 WrapperNode [2018-11-23 14:55:30,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:55:30,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:55:30,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:55:30,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:55:30,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:55:30,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:55:30,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:55:30,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:55:30,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... [2018-11-23 14:55:30,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:55:30,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:55:30,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:55:30,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:55:30,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:30,856 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 14:55:30,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 14:55:30,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 14:55:30,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:55:30,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:55:30,856 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 14:55:30,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 14:55:30,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:55:30,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:55:30,857 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 14:55:30,857 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 14:55:30,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:55:30,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:55:30,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:55:30,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:55:30,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:55:30,962 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:55:31,030 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:55:31,030 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:55:31,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:55:31 BoogieIcfgContainer [2018-11-23 14:55:31,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:55:31,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:55:31,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:55:31,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:55:31,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:55:30" (1/3) ... [2018-11-23 14:55:31,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fb3287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:55:31, skipping insertion in model container [2018-11-23 14:55:31,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:55:30" (2/3) ... [2018-11-23 14:55:31,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fb3287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:55:31, skipping insertion in model container [2018-11-23 14:55:31,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:55:31" (3/3) ... [2018-11-23 14:55:31,035 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250_true-unreach-call.c [2018-11-23 14:55:31,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:55:31,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:55:31,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:55:31,074 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:55:31,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:55:31,075 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:55:31,075 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:55:31,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:55:31,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:55:31,075 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:55:31,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:55:31,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:55:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 14:55:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:55:31,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:31,089 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 14:55:31,090 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:31,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash 656433164, now seen corresponding path program 1 times [2018-11-23 14:55:31,096 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:31,096 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:31,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:31,176 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 14:55:31,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:31,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:55:31,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:55:31,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:55:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:55:31,199 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 14:55:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:31,213 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 14:55:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:55:31,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 14:55:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:31,221 INFO L225 Difference]: With dead ends: 65 [2018-11-23 14:55:31,221 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 14:55:31,223 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 14:55:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 14:55:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 14:55:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:55:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 14:55:31,251 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-23 14:55:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:31,251 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 14:55:31,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:55:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 14:55:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:55:31,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:31,253 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 14:55:31,253 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:31,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 123034921, now seen corresponding path program 1 times [2018-11-23 14:55:31,254 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:31,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:31,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:31,347 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 14:55:31,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:31,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:31,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:31,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:31,362 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-23 14:55:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:31,413 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 14:55:31,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:31,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 14:55:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:31,415 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:55:31,415 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:55:31,415 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 14:55:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:55:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:55:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:55:31,422 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-23 14:55:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:31,422 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:55:31,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:55:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:55:31,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:31,423 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 14:55:31,423 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:31,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1807372911, now seen corresponding path program 1 times [2018-11-23 14:55:31,424 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:31,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:31,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:31,488 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 14:55:31,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:31,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:31,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:31,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:31,501 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 14:55:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:31,537 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 14:55:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:31,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 14:55:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:31,539 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:55:31,539 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:55:31,539 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 14:55:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:55:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:55:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:55:31,544 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-23 14:55:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:31,545 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:55:31,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:55:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:55:31,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:31,546 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 14:55:31,546 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:31,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:31,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1308631021, now seen corresponding path program 1 times [2018-11-23 14:55:31,547 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:31,547 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:31,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:31,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:31,619 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 14:55:31,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:31,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:31,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:31,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:31,630 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 14:55:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:31,660 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 14:55:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:31,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 14:55:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:31,662 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:55:31,662 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:55:31,662 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 14:55:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:55:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:55:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:55:31,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-23 14:55:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:31,666 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:55:31,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:55:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:55:31,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:31,667 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 14:55:31,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:31,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1853889587, now seen corresponding path program 1 times [2018-11-23 14:55:31,668 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:31,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:31,723 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 14:55:31,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:31,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:31,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:31,731 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 14:55:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:31,762 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 14:55:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:31,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 14:55:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:31,763 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:55:31,763 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:55:31,764 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 14:55:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:55:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:55:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:55:31,768 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-23 14:55:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:31,768 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:55:31,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:55:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:55:31,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:31,769 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 14:55:31,770 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:31,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:31,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1560486580, now seen corresponding path program 1 times [2018-11-23 14:55:31,770 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:31,770 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:31,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:31,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:31,963 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 14:55:31,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:31,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:31,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:55:31,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:55:31,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:55:31,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:55:31,971 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-23 14:55:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:32,429 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 14:55:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:55:32,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 14:55:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:32,430 INFO L225 Difference]: With dead ends: 43 [2018-11-23 14:55:32,430 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:55:32,431 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 14:55:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:55:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 14:55:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:55:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 14:55:32,436 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-23 14:55:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:32,436 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 14:55:32,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:55:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 14:55:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 14:55:32,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:32,438 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 14:55:32,438 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:32,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash -132849900, now seen corresponding path program 1 times [2018-11-23 14:55:32,438 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:32,439 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:32,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:32,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:32,534 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 14:55:32,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:32,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:32,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:32,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:32,543 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 14:55:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:32,564 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 14:55:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:32,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 14:55:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:32,565 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:55:32,565 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:55:32,566 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 14:55:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:55:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:55:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 14:55:32,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-23 14:55:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:32,570 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 14:55:32,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 14:55:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 14:55:32,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:32,571 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 14:55:32,572 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:32,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1974935426, now seen corresponding path program 1 times [2018-11-23 14:55:32,572 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:32,572 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:32,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:32,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:32,650 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 14:55:32,650 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:32,662 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 14:55:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:32,684 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 14:55:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:32,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 14:55:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:32,685 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:55:32,685 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:55:32,685 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 14:55:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:55:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:55:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 14:55:32,690 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-23 14:55:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:32,690 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 14:55:32,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 14:55:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:55:32,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:32,691 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 14:55:32,692 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:32,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1277705297, now seen corresponding path program 1 times [2018-11-23 14:55:32,692 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:32,692 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:32,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:32,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:32,878 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 14:55:32,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:32,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:32,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 14:55:32,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 14:55:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 14:55:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:55:32,887 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 14:55:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:33,203 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 14:55:33,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:55:33,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 14:55:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:33,204 INFO L225 Difference]: With dead ends: 44 [2018-11-23 14:55:33,204 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:55:33,205 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 14:55:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:55:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:55:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:55:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 14:55:33,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-23 14:55:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:33,208 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 14:55:33,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 14:55:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 14:55:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:55:33,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:33,209 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 14:55:33,210 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:33,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash 576640719, now seen corresponding path program 1 times [2018-11-23 14:55:33,210 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:33,210 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:33,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:33,376 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 14:55:33,376 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:33,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:55:33,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:55:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:55:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:55:33,386 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2018-11-23 14:55:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:33,558 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 14:55:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:55:33,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 14:55:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:33,561 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:55:33,561 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 14:55:33,561 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 14:55:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 14:55:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 14:55:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:55:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 14:55:33,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 14:55:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:33,565 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 14:55:33,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:55:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 14:55:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:55:33,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:33,565 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 14:55:33,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:33,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash -123656616, now seen corresponding path program 1 times [2018-11-23 14:55:33,566 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:33,566 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:33,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:33,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:33,634 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 14:55:33,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:33,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:33,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:33,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:33,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:33,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:33,643 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 14:55:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:33,661 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 14:55:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:33,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 14:55:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:33,662 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:55:33,662 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 14:55:33,662 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 14:55:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 14:55:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 14:55:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:55:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 14:55:33,665 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 14:55:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:33,665 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 14:55:33,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 14:55:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:55:33,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:33,666 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 14:55:33,666 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:33,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 257799618, now seen corresponding path program 1 times [2018-11-23 14:55:33,666 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:33,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:33,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:33,748 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 14:55:33,748 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:33,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:33,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:55:33,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:55:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:55:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:55:33,757 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 14:55:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:33,774 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 14:55:33,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:55:33,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 14:55:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:33,776 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:55:33,776 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 14:55:33,776 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 14:55:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 14:55:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 14:55:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:55:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 14:55:33,779 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-23 14:55:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:33,780 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 14:55:33,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:55:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 14:55:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:55:33,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:55:33,781 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 14:55:33,781 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:55:33,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:55:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -35603389, now seen corresponding path program 1 times [2018-11-23 14:55:33,781 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:55:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/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 14:55:33,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:55:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:55:33,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:55:33,967 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 14:55:33,967 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:55:33,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:55:33,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:55:33,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:55:33,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:55:33,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:55:33,975 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-23 14:55:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:55:34,181 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 14:55:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:55:34,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 14:55:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:55:34,181 INFO L225 Difference]: With dead ends: 33 [2018-11-23 14:55:34,181 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 14:55:34,182 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 14:55:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 14:55:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 14:55:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 14:55:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 14:55:34,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-23 14:55:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:55:34,183 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:55:34,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:55:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:55:34,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:55:34,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 14:55:34,339 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-11-23 14:55:34,339 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-23 14:55:34,339 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-23 14:55:34,339 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-11-23 14:55:34,339 INFO L451 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: true [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 26 51) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L451 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 26 51) the Hoare annotation is: true [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 26 51) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-11-23 14:55:34,340 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-11-23 14:55:34,340 INFO L451 ceAbstractionStarter]: At program point fmax_doubleENTRY(lines 53 61) the Hoare annotation is: true [2018-11-23 14:55:34,340 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 55 56) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point fmax_doubleFINAL(lines 53 61) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point fmax_doubleEXIT(lines 53 61) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 14:55:34,341 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 63 76) the Hoare annotation is: true [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 63 76) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 63 76) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L444 ceAbstractionStarter]: At program point L71(line 71) 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 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 71 74) no Hoare annotation was computed. [2018-11-23 14:55:34,341 INFO L444 ceAbstractionStarter]: At program point L69(line 69) 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 14:55:34,341 INFO L448 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2018-11-23 14:55:34,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:55:34 BoogieIcfgContainer [2018-11-23 14:55:34,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:55:34,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:55:34,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:55:34,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:55:34,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:55:31" (3/4) ... [2018-11-23 14:55:34,349 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:55:34,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 14:55:34,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-11-23 14:55:34,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 14:55:34,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_double [2018-11-23 14:55:34,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 14:55:34,356 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-23 14:55:34,356 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 14:55:34,356 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 14:55:34,387 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_361ef870-8988-4614-884a-5151c3c561ba/bin-2019/uautomizer/witness.graphml [2018-11-23 14:55:34,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:55:34,388 INFO L168 Benchmark]: Toolchain (without parser) took 3904.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 950.5 MB in the beginning and 1.2 GB in the end (delta: -231.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:34,389 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:34,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.84 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:34,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:34,389 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:34,390 INFO L168 Benchmark]: RCFGBuilder took 261.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:34,390 INFO L168 Benchmark]: TraceAbstraction took 3314.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:55:34,390 INFO L168 Benchmark]: Witness Printer took 41.26 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:55:34,392 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.84 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 934.4 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 21.88 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.95 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 261.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3314.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.26 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: 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: 29]: 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.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 31 SDslu, 1315 SDs, 0 SdLazy, 221 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 28 PreInvPairs, 33 NumberOfFragments, 48 HoareAnnotationTreeSize, 28 FomulaSimplifications, 20 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 389 ConstructedInterpolants, 3 QuantifiedInterpolants, 21655 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...