./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_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_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/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 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/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 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f ......................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:16:36,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:36,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:36,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:36,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:36,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:36,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:36,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:36,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:36,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:36,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:36,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:36,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:36,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:36,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:36,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:36,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:36,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:36,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:36,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:36,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:36,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:36,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:36,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:36,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:36,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:36,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:36,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:36,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:36,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:36,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:36,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:36,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:36,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:36,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:36,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:36,140 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:16:36,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:36,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:36,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:36,151 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:36,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:36,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:36,152 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:36,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:36,153 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:36,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:36,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:36,154 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:36,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:36,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:36,154 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:36,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:36,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:36,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:36,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:36,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:36,155 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:36,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:36,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:36,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:36,156 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_c13e229a-cda4-4a83-bf11-5cb898f6eb89/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 -> 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f [2018-11-23 13:16:36,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:36,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:36,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:36,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:36,193 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:36,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 13:16:36,237 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/7fea96665/ef67bdd5c6cf470496b881bcd3ffe4b4/FLAG18132a520 [2018-11-23 13:16:36,639 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:36,639 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 13:16:36,643 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/7fea96665/ef67bdd5c6cf470496b881bcd3ffe4b4/FLAG18132a520 [2018-11-23 13:16:36,654 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/7fea96665/ef67bdd5c6cf470496b881bcd3ffe4b4 [2018-11-23 13:16:36,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:36,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:36,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:36,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:36,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:36,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e267757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36, skipping insertion in model container [2018-11-23 13:16:36,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:36,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:36,791 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:36,793 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:36,808 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:36,820 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:36,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36 WrapperNode [2018-11-23 13:16:36,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:36,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:36,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:36,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:36,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:36,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:36,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:36,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... [2018-11-23 13:16:36,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:36,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:36,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:36,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:36,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:16:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:16:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-11-23 13:16:36,927 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-11-23 13:16:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:36,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:16:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:16:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:16:36,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:16:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:36,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:16:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:36,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:16:37,065 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:37,065 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:16:37,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:37 BoogieIcfgContainer [2018-11-23 13:16:37,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:37,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:37,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:37,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:37,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:36" (1/3) ... [2018-11-23 13:16:37,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f095ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:37, skipping insertion in model container [2018-11-23 13:16:37,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:36" (2/3) ... [2018-11-23 13:16:37,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f095ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:37, skipping insertion in model container [2018-11-23 13:16:37,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:37" (3/3) ... [2018-11-23 13:16:37,071 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011a_true-unreach-call.c [2018-11-23 13:16:37,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:37,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:37,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:37,111 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:37,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:37,111 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:37,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:37,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:37,112 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:37,112 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:37,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:37,112 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 13:16:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:16:37,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:37,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:37,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:37,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2010282984, now seen corresponding path program 1 times [2018-11-23 13:16:37,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:37,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:37,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:37,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:37,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:37,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:37,231 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 13:16:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:37,243 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 13:16:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:37,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:16:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:37,249 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:16:37,249 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:16:37,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:16:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:16:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:16:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:16:37,275 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 17 [2018-11-23 13:16:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:37,276 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:16:37,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:16:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:16:37,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:37,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:37,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:37,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1410255941, now seen corresponding path program 1 times [2018-11-23 13:16:37,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:37,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:37,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:37,340 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] RET #65#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := 0.0; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := fabs_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0] [?] ~x := #in~x;havoc ~high~0; VAL [fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0] [?] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8);call #t~mem2 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4);~high~0 := #t~mem2;call write~real(#t~union3, ~#gh_u~1.base, ~#gh_u~1.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset);havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [fabs_double_~high~0=22, fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0] [?] goto; VAL [fabs_double_~high~0=22, fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0] [?] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8);call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4);call #t~mem4 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8);~x := #t~mem4;call write~int(#t~union5.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4);call write~int(#t~union5.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4);havoc #t~union5.lsw, #t~union5.msw;havoc #t~mem4;call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset);havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [fabs_double_~high~0=22, fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0] [?] goto; VAL [fabs_double_~high~0=22, fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0] [?] #res := ~x; VAL [fabs_double_~high~0=22, fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0, |fabs_double_#res|=0.0] [?] assume true; VAL [fabs_double_~high~0=22, fabs_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=0.0, |fabs_double_#res|=0.0] [?] RET #69#return; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0.0] [?] ~res~0 := #t~ret6;havoc #t~ret6;#t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false] [?] assume !#t~short8; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~ret7;havoc #t~short8; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=0.0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L28] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] call #t~mem2 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4); [L30] ~high~0 := #t~mem2; [L30] call write~real(#t~union3, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset); [L28] havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~high~0=22, ~x=0.0] [L33] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8); [L36] ~x := #t~mem4; [L36] call write~int(#t~union5.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4); [L36] call write~int(#t~union5.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] havoc #t~union5.lsw, #t~union5.msw; [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset); [L33] havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~high~0=22, ~x=0.0] [L38] #res := ~x; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L25-L39] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0.0, ~x~0=0.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51-L54] assume !#t~short8; [L51] havoc #t~ret7; [L51] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=0.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=0.0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L28] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] call #t~mem2 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4); [L30] ~high~0 := #t~mem2; [L30] call write~real(#t~union3, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset); [L28] havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~high~0=22, ~x=0.0] [L33] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8); [L36] ~x := #t~mem4; [L36] call write~int(#t~union5.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4); [L36] call write~int(#t~union5.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] havoc #t~union5.lsw, #t~union5.msw; [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset); [L33] havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~high~0=22, ~x=0.0] [L38] #res := ~x; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L25-L39] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0.0, ~x~0=0.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51-L54] assume !#t~short8; [L51] havoc #t~ret7; [L51] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=0.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L38] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~x~0=0.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~ret7; [L51] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L38] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~x~0=0.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~ret7; [L51] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L38] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~x~0=0.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~ret7; [L51] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~high~0=22, ~x=0.0] [L38] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~high~0=22, ~x=0.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~x~0=0.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=0.0, ~x~0=0.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~ret7; [L51] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=0.0] [L47] double x = 0.0; VAL [x=0] [L48] CALL, EXPR fabs_double(x) VAL [\old(x)=0] [L26] __uint32_t high; VAL [\old(x)=0, x=0] [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; VAL [\old(x)=0, \result=0, high=22, x=0] [L48] RET, EXPR fabs_double(x) VAL [fabs_double(x)=0, x=0] [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() VAL [res=0, x=0] ----- [2018-11-23 13:16:37,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:16:37 BoogieIcfgContainer [2018-11-23 13:16:37,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:16:37,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:16:37,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:16:37,367 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:16:37,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:37" (3/4) ... [2018-11-23 13:16:37,370 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:16:37,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:16:37,370 INFO L168 Benchmark]: Toolchain (without parser) took 714.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:37,372 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:37,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.64 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:37,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.53 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:37,372 INFO L168 Benchmark]: Boogie Preprocessor took 55.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -218.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:37,373 INFO L168 Benchmark]: RCFGBuilder took 173.36 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.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:37,373 INFO L168 Benchmark]: TraceAbstraction took 300.57 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:37,374 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:37,377 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.64 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 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.53 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -218.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.36 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.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 300.57 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 52]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of bitwiseAnd at line 35. Possible FailurePath: [L47] double x = 0.0; VAL [x=0] [L48] CALL, EXPR fabs_double(x) VAL [\old(x)=0] [L26] __uint32_t high; VAL [\old(x)=0, x=0] [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; VAL [\old(x)=0, \result=0, high=22, x=0] [L48] RET, EXPR fabs_double(x) VAL [fabs_double(x)=0, x=0] [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() VAL [res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 13:16:38,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:38,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:38,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:38,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:38,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:38,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:38,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:38,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:38,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:38,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:38,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:38,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:38,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:38,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:38,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:38,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:38,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:38,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:38,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:38,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:38,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:38,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:38,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:38,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:38,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:38,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:38,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:38,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:38,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:38,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:38,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:38,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:38,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:38,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:38,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:38,816 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:16:38,826 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:38,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:38,827 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:38,827 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:38,828 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:38,828 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:38,828 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:38,828 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:38,828 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:38,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:38,828 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:38,828 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:38,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:38,830 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:38,830 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:38,830 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:38,830 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:38,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:38,830 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:38,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:38,831 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:38,831 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:16:38,831 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:38,831 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:16:38,831 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:16:38,831 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_c13e229a-cda4-4a83-bf11-5cb898f6eb89/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 -> 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f [2018-11-23 13:16:38,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:38,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:38,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:38,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:38,874 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:38,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 13:16:38,916 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/409a5ac93/7f7d94c00d1049c2aecbb247b73080bf/FLAG9a52fe3ca [2018-11-23 13:16:39,242 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:39,243 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 13:16:39,247 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/409a5ac93/7f7d94c00d1049c2aecbb247b73080bf/FLAG9a52fe3ca [2018-11-23 13:16:39,675 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/data/409a5ac93/7f7d94c00d1049c2aecbb247b73080bf [2018-11-23 13:16:39,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:39,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:39,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:39,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:39,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:39,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7137a6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39, skipping insertion in model container [2018-11-23 13:16:39,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:39,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:39,821 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:39,825 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:39,841 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:39,859 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:39,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39 WrapperNode [2018-11-23 13:16:39,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:39,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:39,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:39,860 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:39,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:39,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:39,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:39,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:39,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... [2018-11-23 13:16:39,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:39,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:39,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:39,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:39,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-11-23 13:16:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-11-23 13:16:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 13:16:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:39,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:16:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:16:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:16:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:16:39,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:16:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:16:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:16:40,094 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:16:40,115 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:16:40,130 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:16:40,167 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:40,167 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:16:40,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:40 BoogieIcfgContainer [2018-11-23 13:16:40,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:40,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:40,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:40,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:40,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:39" (1/3) ... [2018-11-23 13:16:40,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49821063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:40, skipping insertion in model container [2018-11-23 13:16:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:39" (2/3) ... [2018-11-23 13:16:40,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49821063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:40, skipping insertion in model container [2018-11-23 13:16:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:40" (3/3) ... [2018-11-23 13:16:40,173 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011a_true-unreach-call.c [2018-11-23 13:16:40,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:40,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:40,193 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:40,211 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:40,212 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:40,212 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:40,212 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:40,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:40,212 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:40,212 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:40,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:40,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 13:16:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:16:40,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:40,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:40,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:40,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2010282984, now seen corresponding path program 1 times [2018-11-23 13:16:40,234 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:16:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 13:16:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:40,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:40,291 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:16:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:40,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:40,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:40,313 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 13:16:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:40,326 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 13:16:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:40,328 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:16:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:40,334 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:16:40,335 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:16:40,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:16:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:16:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:16:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:16:40,360 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 17 [2018-11-23 13:16:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:40,361 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:16:40,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:16:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:16:40,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:40,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:40,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:40,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1410255941, now seen corresponding path program 1 times [2018-11-23 13:16:40,363 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:16:40,363 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 13:16:40,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:40,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:40,546 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:40,547 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:40,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2018-11-23 13:16:40,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-11-23 13:16:40,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:16:40,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-23 13:16:40,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2018-11-23 13:16:40,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:16:40,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:16:40,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:16:40,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:16:40,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:52 [2018-11-23 13:16:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:40,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:16:40,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:40,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:16:40,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:16:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:16:40,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:16:40,824 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2018-11-23 13:16:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:41,304 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2018-11-23 13:16:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:16:41,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 13:16:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:41,305 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:16:41,305 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:16:41,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:16:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:16:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:16:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:16:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-11-23 13:16:41,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 19 [2018-11-23 13:16:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:41,309 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-11-23 13:16:41,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:16:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-11-23 13:16:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:16:41,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:41,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:41,310 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:41,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1929382976, now seen corresponding path program 1 times [2018-11-23 13:16:41,311 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:16:41,311 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 13:16:41,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:41,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:41,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 13:16:41,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 13:16:41,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:16:41,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:16:41,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:16:41,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-23 13:16:41,686 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:41,687 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:41,688 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:41,689 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:41,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 13:16:41,783 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:41,784 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:16:41,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 13:16:41,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:16:41,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 13:16:41,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:16:41,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 13:16:41,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 13:16:41,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:16:41,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:16:41,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:16:41,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:16:41,867 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:19 [2018-11-23 13:16:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:42,093 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:16:42,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:42,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 13:16:42,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:16:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:16:42,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:16:42,106 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 14 states. [2018-11-23 13:16:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:43,086 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-11-23 13:16:43,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:16:43,087 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-11-23 13:16:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:43,087 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:16:43,088 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:16:43,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:16:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:16:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:16:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:16:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:16:43,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-23 13:16:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:43,089 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:16:43,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:16:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:16:43,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:43,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:16:43,150 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 37) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 25 39) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 37) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 31) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L444 ceAbstractionStarter]: At program point L27-2(lines 27 31) the Hoare annotation is: (= |fabs_double_#in~x| fabs_double_~x) [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point fabs_doubleEXIT(lines 25 39) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L451 ceAbstractionStarter]: At program point fabs_doubleENTRY(lines 25 39) the Hoare annotation is: true [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point fabs_doubleFINAL(lines 25 39) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:16:43,151 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 14 24) no Hoare annotation was computed. [2018-11-23 13:16:43,152 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 14 24) no Hoare annotation was computed. [2018-11-23 13:16:43,152 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-23 13:16:43,152 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 21) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-23 13:16:43,152 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-23 13:16:43,152 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 14 24) the Hoare annotation is: true [2018-11-23 13:16:43,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:16:43,152 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:16:43,152 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:16:43,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 41 56) the Hoare annotation is: true [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 41 56) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L444 ceAbstractionStarter]: At program point L51-1(line 51) the Hoare annotation is: (and |main_#t~short8| (exists ((v_prenex_6 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) (_ +zero 11 53)) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_6)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) (= (_ +zero 11 53) main_~x~0)) [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (= (_ +zero 11 53) main_~x~0) [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point L51-4(lines 51 54) no Hoare annotation was computed. [2018-11-23 13:16:43,153 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 41 56) no Hoare annotation was computed. [2018-11-23 13:16:43,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:16:43 BoogieIcfgContainer [2018-11-23 13:16:43,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:16:43,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:16:43,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:16:43,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:16:43,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:40" (3/4) ... [2018-11-23 13:16:43,165 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:16:43,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2018-11-23 13:16:43,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:16:43,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 13:16:43,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:16:43,174 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 13:16:43,174 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:16:43,174 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:16:43,191 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:16:43,192 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:16:43,205 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c13e229a-cda4-4a83-bf11-5cb898f6eb89/bin-2019/uautomizer/witness.graphml [2018-11-23 13:16:43,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:16:43,206 INFO L168 Benchmark]: Toolchain (without parser) took 3528.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 949.2 MB in the beginning and 944.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:43,207 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:43,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.70 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:43,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.84 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:43,207 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:43,208 INFO L168 Benchmark]: RCFGBuilder took 263.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:43,208 INFO L168 Benchmark]: TraceAbstraction took 2993.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 189.4 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:43,208 INFO L168 Benchmark]: Witness Printer took 43.10 ms. Allocated memory is still 1.2 GB. Free memory was 951.1 MB in the beginning and 944.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:43,210 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.70 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.84 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.06 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 263.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2993.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 189.4 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. * Witness Printer took 43.10 ms. Allocated memory is still 1.2 GB. Free memory was 951.1 MB in the beginning and 944.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: 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: 17]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 23 SDslu, 288 SDs, 0 SdLazy, 151 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 55 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 60 ConstructedInterpolants, 20 QuantifiedInterpolants, 17628 SizeOfPredicates, 13 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...