./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ......................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:09:08,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:09:08,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:09:08,057 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:09:08,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:09:08,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:09:08,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:09:08,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:09:08,064 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:09:08,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:09:08,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:09:08,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:09:08,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:09:08,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:09:08,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:09:08,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:09:08,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:09:08,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:09:08,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:09:08,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:09:08,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:09:08,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:09:08,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:09:08,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:09:08,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:09:08,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:09:08,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:09:08,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:09:08,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:09:08,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:09:08,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:09:08,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:09:08,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:09:08,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:09:08,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:09:08,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:09:08,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:09:08,110 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:09:08,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:09:08,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:09:08,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:09:08,112 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:09:08,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:09:08,112 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:09:08,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:09:08,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:09:08,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:09:08,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:09:08,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:09:08,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:09:08,115 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:09:08,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:09:08,115 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:09:08,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:09:08,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:09:08,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:09:08,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:09:08,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:09:08,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:09:08,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:09:08,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:09:08,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:09:08,117 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:09:08,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:09:08,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:09:08,118 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2019-01-12 09:09:08,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:09:08,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:09:08,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:09:08,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:09:08,219 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:09:08,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2019-01-12 09:09:08,295 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa0bbf69/d28fe318e8574f558297595c8e82c678/FLAG5c371883b [2019-01-12 09:09:08,727 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:09:08,727 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2019-01-12 09:09:08,735 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa0bbf69/d28fe318e8574f558297595c8e82c678/FLAG5c371883b [2019-01-12 09:09:09,106 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa0bbf69/d28fe318e8574f558297595c8e82c678 [2019-01-12 09:09:09,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:09:09,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:09:09,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:09,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:09:09,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:09:09,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30acd415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09, skipping insertion in model container [2019-01-12 09:09:09,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:09:09,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:09:09,347 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:09,350 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:09:09,375 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:09,400 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:09:09,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09 WrapperNode [2019-01-12 09:09:09,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:09,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:09,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:09:09,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:09:09,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:09,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:09:09,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:09:09,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:09:09,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... [2019-01-12 09:09:09,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:09:09,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:09:09,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:09:09,539 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:09:09,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 09:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:09:09,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:09:10,124 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:09:10,125 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:09:10,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:10 BoogieIcfgContainer [2019-01-12 09:09:10,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:09:10,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:09:10,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:09:10,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:09:10,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:09:09" (1/3) ... [2019-01-12 09:09:10,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e406515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:10, skipping insertion in model container [2019-01-12 09:09:10,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:09" (2/3) ... [2019-01-12 09:09:10,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e406515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:10, skipping insertion in model container [2019-01-12 09:09:10,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:10" (3/3) ... [2019-01-12 09:09:10,145 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2019-01-12 09:09:10,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:09:10,168 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:09:10,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:09:10,222 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:09:10,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:09:10,223 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:09:10,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:09:10,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:09:10,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:09:10,224 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:09:10,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:09:10,224 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:09:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-12 09:09:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:09:10,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:10,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:10,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-01-12 09:09:10,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:10,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:10,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:10,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:10,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:09:10,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:09:10,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:09:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:09:10,397 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-01-12 09:09:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:10,420 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-01-12 09:09:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:09:10,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:09:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:10,435 INFO L225 Difference]: With dead ends: 56 [2019-01-12 09:09:10,436 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:09:10,441 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 [2019-01-12 09:09:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:09:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:09:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:09:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-01-12 09:09:10,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-01-12 09:09:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:10,492 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-12 09:09:10,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:09:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-01-12 09:09:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:09:10,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:10,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:10,495 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-01-12 09:09:10,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:10,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:10,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:10,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:10,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:10,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:10,631 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-01-12 09:09:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:10,834 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-12 09:09:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:10,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:09:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:10,836 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:09:10,836 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:09:10,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:09:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:09:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:10,848 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-01-12 09:09:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:10,848 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:10,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:09:10,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:10,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:10,852 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-01-12 09:09:10,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:10,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:10,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:10,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:10,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:10,964 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:11,221 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:09:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:11,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 09:09:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:11,224 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:11,224 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:11,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:11,231 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-01-12 09:09:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:11,231 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:11,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:09:11,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:11,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:11,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:11,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-01-12 09:09:11,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:09:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:09:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:09:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:09:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:09:11,304 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:09:11,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:09:11 BoogieIcfgContainer [2019-01-12 09:09:11,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:09:11,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:09:11,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:09:11,333 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:09:11,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:10" (3/4) ... [2019-01-12 09:09:11,337 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:09:11,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:09:11,338 INFO L168 Benchmark]: Toolchain (without parser) took 2227.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -109.6 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:11,340 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:09:11,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:11,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.46 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:11,342 INFO L168 Benchmark]: Boogie Preprocessor took 95.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:11,343 INFO L168 Benchmark]: RCFGBuilder took 587.10 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:11,344 INFO L168 Benchmark]: TraceAbstraction took 1205.34 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:11,345 INFO L168 Benchmark]: Witness Printer took 4.40 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. [2019-01-12 09:09:11,350 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.46 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 587.10 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1205.34 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.40 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: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; [L16] return x != x; [L72] COND TRUE !isnan_double(x) [L27] __uint32_t msw, lsw; [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x [L78] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 20 SDslu, 118 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:09:13,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:09:13,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:09:13,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:09:13,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:09:13,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:09:13,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:09:13,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:09:13,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:09:13,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:09:13,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:09:13,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:09:13,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:09:13,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:09:13,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:09:13,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:09:13,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:09:13,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:09:13,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:09:13,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:09:13,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:09:13,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:09:13,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:09:13,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:09:13,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:09:13,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:09:13,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:09:13,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:09:13,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:09:13,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:09:13,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:09:13,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:09:13,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:09:13,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:09:13,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:09:13,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:09:13,710 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:09:13,726 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:09:13,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:09:13,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:09:13,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:09:13,728 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:09:13,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:09:13,728 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:09:13,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:09:13,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:09:13,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:09:13,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:09:13,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:09:13,730 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:09:13,730 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:09:13,730 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:09:13,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:09:13,731 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:09:13,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:09:13,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:09:13,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:09:13,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:09:13,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:09:13,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:09:13,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:09:13,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:09:13,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:09:13,734 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:09:13,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:09:13,734 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:09:13,734 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:09:13,734 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2019-01-12 09:09:13,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:09:13,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:09:13,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:09:13,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:09:13,794 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:09:13,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2019-01-12 09:09:13,851 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a82469c0/dad604a4f8f7412087c56be89d79c6f7/FLAGd3b84ba99 [2019-01-12 09:09:14,289 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:09:14,290 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2019-01-12 09:09:14,298 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a82469c0/dad604a4f8f7412087c56be89d79c6f7/FLAGd3b84ba99 [2019-01-12 09:09:14,651 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a82469c0/dad604a4f8f7412087c56be89d79c6f7 [2019-01-12 09:09:14,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:09:14,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:09:14,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:14,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:09:14,662 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:09:14,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:14" (1/1) ... [2019-01-12 09:09:14,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745daf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:14, skipping insertion in model container [2019-01-12 09:09:14,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:09:14" (1/1) ... [2019-01-12 09:09:14,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:09:14,700 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:09:14,930 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:14,938 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:09:14,971 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:09:15,013 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:09:15,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15 WrapperNode [2019-01-12 09:09:15,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:09:15,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:15,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:09:15,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:09:15,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:09:15,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:09:15,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:09:15,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:09:15,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... [2019-01-12 09:09:15,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:09:15,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:09:15,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:09:15,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:09:15,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 09:09:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:09:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:09:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:09:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:09:15,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:09:15,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:09:15,670 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:09:15,969 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:09:16,005 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:09:16,005 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:09:16,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:16 BoogieIcfgContainer [2019-01-12 09:09:16,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:09:16,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:09:16,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:09:16,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:09:16,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:09:14" (1/3) ... [2019-01-12 09:09:16,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a8fdbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:16, skipping insertion in model container [2019-01-12 09:09:16,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:09:15" (2/3) ... [2019-01-12 09:09:16,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a8fdbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:09:16, skipping insertion in model container [2019-01-12 09:09:16,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:16" (3/3) ... [2019-01-12 09:09:16,018 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2019-01-12 09:09:16,027 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:09:16,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:09:16,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:09:16,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:09:16,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:09:16,089 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:09:16,090 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:09:16,090 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:09:16,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:09:16,090 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:09:16,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:09:16,091 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:09:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-12 09:09:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:09:16,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:16,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:16,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-01-12 09:09:16,129 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 09:09:16,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:16,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:16,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:16,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:09:16,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:09:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:09:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:09:16,263 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-01-12 09:09:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:16,280 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-01-12 09:09:16,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:09:16,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:09:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:16,294 INFO L225 Difference]: With dead ends: 56 [2019-01-12 09:09:16,294 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:09:16,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:09:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:09:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:09:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:09:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-01-12 09:09:16,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-01-12 09:09:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:16,331 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-12 09:09:16,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:09:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-01-12 09:09:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:09:16,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:16,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:16,333 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-01-12 09:09:16,334 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:16,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 09:09:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:16,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:16,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:16,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:16,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:16,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:16,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:16,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:16,520 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-01-12 09:09:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:16,820 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-12 09:09:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:16,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:09:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:16,823 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:09:16,823 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:09:16,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:09:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:09:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:16,840 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-01-12 09:09:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:16,840 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:16,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:09:16,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:16,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:16,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2019-01-12 09:09:16,847 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:16,849 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:09:16,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:16,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:16,977 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:16,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:16,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:16,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:16,990 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:17,164 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:09:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:17,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-12 09:09:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:17,167 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:17,167 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:17,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:17,175 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2019-01-12 09:09:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:17,175 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:17,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:09:17,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:17,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:17,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2019-01-12 09:09:17,179 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:17,179 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:17,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:17,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:17,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:17,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:17,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:17,308 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:17,522 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:09:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:17,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:09:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:17,525 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:17,525 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:17,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:17,532 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2019-01-12 09:09:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:17,532 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:17,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:09:17,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:17,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:17,535 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-01-12 09:09:17,536 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:17,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:17,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:17,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:17,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:17,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:17,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:17,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:17,638 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:17,740 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:09:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:17,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 09:09:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:17,742 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:17,743 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:17,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:17,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-01-12 09:09:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:17,749 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:17,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:09:17,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:17,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:17,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-01-12 09:09:17,754 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:17,754 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:17,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:18,125 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:18,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:18,154 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:18,168 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:18,179 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 73 treesize of output 98 [2019-01-12 09:09:18,529 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-01-12 09:09:18,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:18,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 62 treesize of output 59 [2019-01-12 09:09:18,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:18,619 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 23 treesize of output 19 [2019-01-12 09:09:18,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 16 [2019-01-12 09:09:18,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:18,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:18,743 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 39 treesize of output 29 [2019-01-12 09:09:18,779 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 29 treesize of output 14 [2019-01-12 09:09:18,780 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:18,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:18,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:18,842 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. [2019-01-12 09:09:18,843 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:88, output treesize:34 [2019-01-12 09:09:20,872 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_q#valueAsBitvector_3|)) (.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_3|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (fp.eq .cse0 .cse0)) (= c_ULTIMATE.start___fpclassify_double_~lsw~0 .cse1) (= ((_ extract 31 0) v_prenex_9) .cse1) (= ((_ extract 63 32) v_prenex_9) .cse2) (= c_ULTIMATE.start___fpclassify_double_~msw~0 .cse2)))) is different from true [2019-01-12 09:09:35,334 WARN L181 SmtUtils]: Spent 14.33 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-12 09:09:39,583 WARN L181 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-01-12 09:09:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:39,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:39,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:39,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:09:39,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:09:39,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:09:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2019-01-12 09:09:39,622 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 8 states. [2019-01-12 09:09:46,162 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-12 09:09:52,457 WARN L181 SmtUtils]: Spent 6.24 s on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 09:09:52,783 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-12 09:09:59,112 WARN L181 SmtUtils]: Spent 6.14 s on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 09:10:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:01,349 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-01-12 09:10:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:10:01,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 09:10:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:01,351 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:10:01,351 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:10:01,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=56, Invalid=128, Unknown=2, NotChecked=24, Total=210 [2019-01-12 09:10:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:10:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-01-12 09:10:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:10:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-12 09:10:01,366 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-01-12 09:10:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:01,367 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-12 09:10:01,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:10:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-01-12 09:10:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:10:01,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:01,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:10:01,369 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:01,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2019-01-12 09:10:01,370 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:01,370 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:01,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:01,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:01,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:01,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:01,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:10:01,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:10:01,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:10:01,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:10:01,494 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2019-01-12 09:10:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:01,642 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-01-12 09:10:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:10:01,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-12 09:10:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:01,644 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:10:01,644 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:10:01,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:10:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:10:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:10:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:10:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-12 09:10:01,655 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-01-12 09:10:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:01,655 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-12 09:10:01,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:10:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-01-12 09:10:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:10:01,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:01,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:10:01,659 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash -666515868, now seen corresponding path program 1 times [2019-01-12 09:10:01,660 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:01,661 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:01,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:01,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:01,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:01,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:10:01,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:10:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:10:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:10:01,793 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2019-01-12 09:10:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:01,892 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-01-12 09:10:01,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:10:01,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:10:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:01,894 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:10:01,894 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:10:01,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:10:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:10:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:10:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:10:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-12 09:10:01,905 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2019-01-12 09:10:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:01,905 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-12 09:10:01,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:10:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-01-12 09:10:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:10:01,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:01,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:10:01,906 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:01,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2019-01-12 09:10:01,909 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:01,909 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:01,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:01,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:02,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:02,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:10:02,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:10:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:10:02,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:10:02,022 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2019-01-12 09:10:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:02,062 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-01-12 09:10:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:10:02,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-12 09:10:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:02,064 INFO L225 Difference]: With dead ends: 33 [2019-01-12 09:10:02,065 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 09:10:02,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:10:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 09:10:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-12 09:10:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:10:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 09:10:02,076 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-01-12 09:10:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:02,076 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 09:10:02,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:10:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 09:10:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:10:02,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:02,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:10:02,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2019-01-12 09:10:02,080 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:02,080 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:02,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:02,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:02,260 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:10:02,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:10:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:10:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:10:02,274 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-01-12 09:10:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:02,610 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-01-12 09:10:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:10:02,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-12 09:10:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:02,617 INFO L225 Difference]: With dead ends: 38 [2019-01-12 09:10:02,617 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 09:10:02,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:10:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 09:10:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 09:10:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:10:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-12 09:10:02,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2019-01-12 09:10:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:02,641 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-12 09:10:02,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:10:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-12 09:10:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:10:02,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:02,643 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] [2019-01-12 09:10:02,644 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash 782688991, now seen corresponding path program 1 times [2019-01-12 09:10:02,644 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:02,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:02,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:02,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:02,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:10:02,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:10:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:10:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:10:02,754 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2019-01-12 09:10:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:03,002 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-12 09:10:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:10:03,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-12 09:10:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:03,004 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:10:03,004 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:10:03,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:10:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:10:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:10:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:10:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-12 09:10:03,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-01-12 09:10:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:03,016 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-12 09:10:03,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:10:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-12 09:10:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:10:03,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:03,018 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] [2019-01-12 09:10:03,018 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2019-01-12 09:10:03,019 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:03,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:10:03,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:03,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:03,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:03,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:03,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:10:03,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:10:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:10:03,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:10:03,685 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-01-12 09:10:04,281 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-01-12 09:10:04,874 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-12 09:10:05,359 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-01-12 09:10:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:05,486 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-12 09:10:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:10:05,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-12 09:10:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:05,489 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:10:05,489 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:10:05,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:10:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:10:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-01-12 09:10:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 09:10:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-12 09:10:05,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-01-12 09:10:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:05,507 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-12 09:10:05,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:10:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-12 09:10:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:10:05,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:05,508 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] [2019-01-12 09:10:05,508 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1085928516, now seen corresponding path program 1 times [2019-01-12 09:10:05,511 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:05,511 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:05,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:05,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:05,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:05,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:05,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:10:05,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:10:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:10:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:10:05,830 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2019-01-12 09:10:06,235 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-12 09:10:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:06,386 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-12 09:10:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:10:06,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:10:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:06,387 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:10:06,388 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:10:06,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:10:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:10:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-01-12 09:10:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:10:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-12 09:10:06,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2019-01-12 09:10:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:06,398 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-12 09:10:06,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:10:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-12 09:10:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:10:06,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:06,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:10:06,399 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2019-01-12 09:10:06,399 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:06,399 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:06,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:06,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:10:06,572 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:10:06,574 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:10:06,575 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:10:06,577 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 47 treesize of output 76 [2019-01-12 09:10:06,629 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 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 70 treesize of output 60 [2019-01-12 09:10:06,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:10:06,688 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 [2019-01-12 09:10:06,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:10:06,712 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 25 treesize of output 19 [2019-01-12 09:10:06,722 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 19 treesize of output 5 [2019-01-12 09:10:06,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:10:06,727 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:10:06,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:10:06,773 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. [2019-01-12 09:10:06,773 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:31 [2019-01-12 09:10:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:06,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:06,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:06,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:10:06,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:10:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:10:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:10:06,839 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2019-01-12 09:10:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:07,313 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-12 09:10:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:10:07,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 09:10:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:07,317 INFO L225 Difference]: With dead ends: 34 [2019-01-12 09:10:07,317 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:10:07,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:10:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:10:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:10:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:10:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-12 09:10:07,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2019-01-12 09:10:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:07,333 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-12 09:10:07,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:10:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-12 09:10:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:10:07,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:10:07,334 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] [2019-01-12 09:10:07,334 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:10:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:10:07,337 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2019-01-12 09:10:07,337 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:10:07,337 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-01-12 09:10:07,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:10:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:10:07,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:10:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:10:07,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:10:07,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:10:07,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:10:07,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:10:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:10:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:10:07,547 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2019-01-12 09:10:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:10:07,606 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-12 09:10:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:10:07,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-12 09:10:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:10:07,607 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:10:07,607 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:10:07,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:10:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:10:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:10:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:10:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:10:07,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-12 09:10:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:10:07,610 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:10:07,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:10:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:10:07,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:10:07,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:10:08,014 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 09:10:08,376 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-12 09:10:08,740 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-12 09:10:08,844 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-01-12 09:10:18,538 WARN L181 SmtUtils]: Spent 9.69 s on a formula simplification. DAG size of input: 146 DAG size of output: 44 [2019-01-12 09:10:19,210 WARN L181 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 31 [2019-01-12 09:10:19,213 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 09:10:19,213 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2019-01-12 09:10:19,214 INFO L444 ceAbstractionStarter]: At program point L60-3(lines 53 61) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fmax_double_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:19,214 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 80) no Hoare annotation was computed. [2019-01-12 09:10:19,214 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:10:19,214 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:10:19,214 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:10:19,214 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2019-01-12 09:10:19,214 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) .cse0))) (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) [2019-01-12 09:10:19,214 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 09:10:19,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:10:19,215 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:10:19,215 INFO L444 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~y .cse0) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:19,215 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2019-01-12 09:10:19,215 INFO L448 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2019-01-12 09:10:19,215 INFO L444 ceAbstractionStarter]: At program point L29-6(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:19,215 INFO L448 ceAbstractionStarter]: For program point L29-7(lines 26 51) no Hoare annotation was computed. [2019-01-12 09:10:19,215 INFO L451 ceAbstractionStarter]: At program point L83(lines 63 84) the Hoare annotation is: true [2019-01-12 09:10:19,216 INFO L444 ceAbstractionStarter]: At program point L50(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (or (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (exists ((v_prenex_14 (_ BitVec 64))) (and (= ULTIMATE.start_fmax_double_~x (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= ((_ extract 63 32) v_prenex_14) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~y .cse0) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:19,216 INFO L444 ceAbstractionStarter]: At program point L50-1(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32)) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (.cse1 ((_ extract 31 0) v_prenex_16))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_5|)) (= ((_ extract 63 32) v_prenex_16) .cse2) (= .cse2 ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:19,216 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2019-01-12 09:10:19,216 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 46 50) no Hoare annotation was computed. [2019-01-12 09:10:19,216 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-01-12 09:10:19,216 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2019-01-12 09:10:19,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2019-01-12 09:10:19,216 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 56) no Hoare annotation was computed. [2019-01-12 09:10:19,217 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 81) no Hoare annotation was computed. [2019-01-12 09:10:19,223 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2019-01-12 09:10:19,223 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 50) no Hoare annotation was computed. [2019-01-12 09:10:19,223 INFO L448 ceAbstractionStarter]: For program point L72-2(lines 72 81) no Hoare annotation was computed. [2019-01-12 09:10:19,234 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,241 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,243 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,246 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,251 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,251 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,259 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,260 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,267 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,267 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,268 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,279 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,288 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,288 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,293 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,293 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,295 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,299 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,302 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,302 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,303 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,303 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,304 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,304 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:10:19 BoogieIcfgContainer [2019-01-12 09:10:19,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:10:19,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:10:19,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:10:19,308 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:10:19,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:09:16" (3/4) ... [2019-01-12 09:10:19,312 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:10:19,329 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-12 09:10:19,331 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 09:10:19,331 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:10:19,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:19,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0bv32 && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:19,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0bv32 && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && (\exists v_prenex_14 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) && v_prenex_14[63:32] == msw)) && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:19,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && \result == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:19,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:19,367 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:19,425 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:10:19,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:10:19,433 INFO L168 Benchmark]: Toolchain (without parser) took 64777.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 951.3 MB in the beginning and 864.3 MB in the end (delta: 87.1 MB). Peak memory consumption was 286.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,434 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:10:19,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.94 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,435 INFO L168 Benchmark]: Boogie Preprocessor took 166.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,438 INFO L168 Benchmark]: RCFGBuilder took 749.95 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,438 INFO L168 Benchmark]: TraceAbstraction took 63298.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 871.7 MB in the end (delta: 226.0 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,441 INFO L168 Benchmark]: Witness Printer took 123.86 ms. Allocated memory is still 1.2 GB. Free memory was 871.7 MB in the beginning and 864.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:19,444 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.94 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 166.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 749.95 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63298.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 871.7 MB in the end (delta: 226.0 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. * Witness Printer took 123.86 ms. Allocated memory is still 1.2 GB. Free memory was 871.7 MB in the beginning and 864.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: 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: 16]: Loop Invariant [2019-01-12 09:10:19,457 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,458 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 29]: Loop Invariant [2019-01-12 09:10:19,458 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\result == 0bv32 && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2019-01-12 09:10:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,460 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,468 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,468 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,469 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,469 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:19,470 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 29]: Loop Invariant [2019-01-12 09:10:19,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2019-01-12 09:10:19,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:19,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((\result == 0bv32 && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && (\exists v_prenex_14 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) && v_prenex_14[63:32] == msw)) && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant [2019-01-12 09:10:19,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,477 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:19,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:19,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && \result == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 63.1s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 26.3s AutomataDifference, 0.0s DeadEndRemovalTime, 11.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 486 SDtfs, 406 SDslu, 710 SDs, 0 SdLazy, 366 SolverSat, 18 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 40.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=12, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 255 HoareAnnotationTreeSize, 7 FomulaSimplifications, 4930 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8993 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 26 QuantifiedInterpolants, 28710 SizeOfPredicates, 53 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...