./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_1230_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 b865bb4da04412be07ba7e2426d2224bb04a2953 ........................................................................................................................................................................................................................................................................................................................................................ 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_1230_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 b865bb4da04412be07ba7e2426d2224bb04a2953 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:36,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:36,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:36,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:36,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:36,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:36,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:36,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:36,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:36,483 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:36,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:36,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:36,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:36,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:36,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:36,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:36,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:36,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:36,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:36,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:36,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:36,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:36,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:36,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:36,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:36,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:36,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:36,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:36,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:36,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:36,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:36,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:36,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:36,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:36,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:36,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:36,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:58:36,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:36,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:36,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:36,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:36,567 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:36,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:36,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:36,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:58:36,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:36,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:36,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:36,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:36,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:36,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:36,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:36,571 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:36,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:36,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:36,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:36,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:36,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:36,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:36,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:36,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:36,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:36,576 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:58:36,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:36,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:58:36,577 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 -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2018-12-31 03:58:36,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:36,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:36,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:36,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:36,654 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:36,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-12-31 03:58:36,722 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd219548/f32a8ada722644c1a7737006ffb3365f/FLAG289bcdd7d [2018-12-31 03:58:37,224 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:37,224 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-12-31 03:58:37,232 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd219548/f32a8ada722644c1a7737006ffb3365f/FLAG289bcdd7d [2018-12-31 03:58:37,592 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd219548/f32a8ada722644c1a7737006ffb3365f [2018-12-31 03:58:37,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:37,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:37,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:37,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:37,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:37,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb36889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37, skipping insertion in model container [2018-12-31 03:58:37,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:37,640 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:37,845 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:37,852 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:37,886 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:37,911 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:37,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37 WrapperNode [2018-12-31 03:58:37,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:37,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:37,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:37,913 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:37,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:37,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:37,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:37,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:37,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:38,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:38,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:38,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:38,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:38,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:38,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:38,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (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 [2018-12-31 03:58:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:58:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:38,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:58:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:38,740 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:38,740 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:38,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:38 BoogieIcfgContainer [2018-12-31 03:58:38,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:38,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:38,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:38,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:38,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:37" (1/3) ... [2018-12-31 03:58:38,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7acda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:38, skipping insertion in model container [2018-12-31 03:58:38,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37" (2/3) ... [2018-12-31 03:58:38,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7acda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:38, skipping insertion in model container [2018-12-31 03:58:38,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:38" (3/3) ... [2018-12-31 03:58:38,753 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2018-12-31 03:58:38,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:38,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:38,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:38,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:38,835 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:38,835 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:38,835 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:38,836 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:38,836 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:38,836 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:38,837 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:38,837 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 03:58:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:58:38,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:38,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:38,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:38,875 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 03:58:38,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:38,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:39,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:39,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:39,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:39,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:39,025 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 03:58:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:39,044 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 03:58:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:39,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:58:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:39,057 INFO L225 Difference]: With dead ends: 54 [2018-12-31 03:58:39,057 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:58:39,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:58:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 03:58:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:58:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 03:58:39,096 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 03:58:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:39,096 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 03:58:39,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 03:58:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:39,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:39,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:39,098 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 03:58:39,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:39,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:39,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:39,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:39,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:39,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:39,220 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 03:58:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:39,385 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 03:58:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:39,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:58:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:39,388 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:58:39,388 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:39,389 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 [2018-12-31 03:58:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 03:58:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:39,396 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 03:58:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:39,397 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:39,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:39,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:39,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:39,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 03:58:39,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:39,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:39,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:39,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:39,523 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:58:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:39,744 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:58:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:39,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:58:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:39,748 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:39,748 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:39,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:58:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:39,767 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 03:58:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:39,768 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:39,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:39,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:39,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:39,772 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 03:58:39,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:39,892 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:58:39,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:39 BoogieIcfgContainer [2018-12-31 03:58:39,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:39,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:39,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:39,924 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:39,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:38" (3/4) ... [2018-12-31 03:58:39,929 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:58:39,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:39,930 INFO L168 Benchmark]: Toolchain (without parser) took 2333.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -104.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:39,933 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:39,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.58 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:39,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.17 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:39,935 INFO L168 Benchmark]: Boogie Preprocessor took 115.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:39,937 INFO L168 Benchmark]: RCFGBuilder took 663.87 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:39,938 INFO L168 Benchmark]: TraceAbstraction took 1181.07 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:39,938 INFO L168 Benchmark]: Witness Printer took 5.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:39,944 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.50 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.58 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 48.17 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.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 115.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 663.87 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1181.07 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 66]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L61] double x = 0.0 / 0.0; [L62] double y = 0.0 / 0.0; [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L63] double res = fmin_double(x, y); [L16] return x != x; [L65] COND TRUE !isnan_double(res) [L66] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 22 SDslu, 110 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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=28occurred 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, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 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-2e94e6a [2018-12-31 03:58:42,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:42,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:42,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:42,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:42,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:42,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:42,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:42,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:42,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:42,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:42,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:42,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:42,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:42,548 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:42,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:42,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:42,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:42,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:42,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:42,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:42,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:42,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:42,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:42,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:42,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:42,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:42,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:42,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:42,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:42,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:42,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:42,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:42,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:42,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:42,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:42,588 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:58:42,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:42,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:42,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:42,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:42,614 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:42,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:42,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:42,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:42,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:42,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:42,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:42,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:42,616 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:58:42,616 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:58:42,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:42,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:42,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:42,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:42,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:42,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:42,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:42,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:42,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:42,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:42,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:42,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:42,621 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:58:42,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:42,621 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:58:42,621 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:58:42,621 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 -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2018-12-31 03:58:42,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:42,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:42,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:42,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:42,689 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:42,690 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-12-31 03:58:42,765 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68104bc72/42876c38535b4415873923fd70994ab6/FLAGc55f70c5b [2018-12-31 03:58:43,247 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:43,248 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2018-12-31 03:58:43,257 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68104bc72/42876c38535b4415873923fd70994ab6/FLAGc55f70c5b [2018-12-31 03:58:43,720 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68104bc72/42876c38535b4415873923fd70994ab6 [2018-12-31 03:58:43,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:43,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:43,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:43,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:43,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:43,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:43" (1/1) ... [2018-12-31 03:58:43,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453557c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:43, skipping insertion in model container [2018-12-31 03:58:43,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:43" (1/1) ... [2018-12-31 03:58:43,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:43,768 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:44,017 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:44,024 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:44,055 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:44,092 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:44,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44 WrapperNode [2018-12-31 03:58:44,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:44,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:44,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:44,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:44,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:44,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:44,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:44,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:44,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:44,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:44,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:44,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:44,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (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 [2018-12-31 03:58:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:58:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:58:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:44,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:44,593 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:44,942 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:45,000 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:45,000 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:45,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:45 BoogieIcfgContainer [2018-12-31 03:58:45,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:45,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:45,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:45,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:45,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:43" (1/3) ... [2018-12-31 03:58:45,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d17249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:45, skipping insertion in model container [2018-12-31 03:58:45,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (2/3) ... [2018-12-31 03:58:45,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d17249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:45, skipping insertion in model container [2018-12-31 03:58:45,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:45" (3/3) ... [2018-12-31 03:58:45,011 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2018-12-31 03:58:45,022 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:45,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:45,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:45,086 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:45,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:45,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:45,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:45,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:45,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:45,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:45,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:45,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 03:58:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:58:45,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:45,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:45,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 03:58:45,123 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:45,123 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 [2018-12-31 03:58:45,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:45,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:45,217 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:45,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:45,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:45,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:45,250 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 03:58:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:45,267 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 03:58:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:45,270 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:58:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:45,281 INFO L225 Difference]: With dead ends: 54 [2018-12-31 03:58:45,281 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:58:45,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:58:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 03:58:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:58:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 03:58:45,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 03:58:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:45,323 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 03:58:45,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 03:58:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:45,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:45,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:45,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 03:58:45,327 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:45,327 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 [2018-12-31 03:58:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:45,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:45,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:45,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:45,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:45,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:45,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:45,469 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 03:58:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:45,847 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 03:58:45,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:45,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:58:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:45,849 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:58:45,849 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:45,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 03:58:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:45,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 03:58:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:45,860 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:45,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:58:45,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:45,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:45,862 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:45,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2018-12-31 03:58:45,863 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:45,863 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:45,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:45,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:45,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:45,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:45,993 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:58:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:46,169 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:58:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:46,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:58:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:46,171 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:46,172 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:46,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:58:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:46,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2018-12-31 03:58:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:46,180 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:46,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:58:46,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:46,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:46,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:46,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2018-12-31 03:58:46,183 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:46,184 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 [2018-12-31 03:58:46,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:46,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:46,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:46,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:46,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:46,391 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:58:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:46,624 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:58:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:46,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 03:58:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:46,627 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:46,628 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:46,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:58:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:46,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2018-12-31 03:58:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:46,636 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:46,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:46,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:46,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:46,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:46,639 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 03:58:46,639 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:46,639 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 [2018-12-31 03:58:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:46,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:46,736 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:46,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:46,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:46,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:46,749 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:58:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:46,954 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:58:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:46,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:58:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:46,956 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:46,956 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:46,957 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 [2018-12-31 03:58:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:58:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:46,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 03:58:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:46,963 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:46,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:46,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:46,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:46,965 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 03:58:46,966 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:46,966 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 [2018-12-31 03:58:46,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:47,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:47,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:47,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:47,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:58:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:58:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:58:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:58:47,162 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2018-12-31 03:58:47,579 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 03:58:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:47,660 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-31 03:58:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:58:47,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 03:58:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:47,664 INFO L225 Difference]: With dead ends: 36 [2018-12-31 03:58:47,664 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 03:58:47,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:58:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 03:58:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-31 03:58:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:58:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-31 03:58:47,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2018-12-31 03:58:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:47,672 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-31 03:58:47,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:58:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-12-31 03:58:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:58:47,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:47,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:47,674 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2018-12-31 03:58:47,675 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:47,675 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 [2018-12-31 03:58:47,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:47,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:47,788 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:47,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:47,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:47,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:47,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:47,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:47,802 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-12-31 03:58:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:47,907 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-31 03:58:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:47,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 03:58:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:47,909 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:58:47,910 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 03:58:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 03:58:47,916 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2018-12-31 03:58:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:47,916 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 03:58:47,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 03:58:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:58:47,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:47,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:47,917 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash 874917212, now seen corresponding path program 1 times [2018-12-31 03:58:47,918 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:47,918 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 [2018-12-31 03:58:47,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:48,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:48,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:48,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:48,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:48,048 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-31 03:58:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:48,157 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-31 03:58:48,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:48,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 03:58:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:48,162 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:48,162 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:48,163 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 [2018-12-31 03:58:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:58:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 03:58:48,170 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2018-12-31 03:58:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:48,171 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 03:58:48,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 03:58:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:58:48,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:48,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:48,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2018-12-31 03:58:48,173 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:48,173 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 [2018-12-31 03:58:48,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:48,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:48,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:48,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:48,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:58:48,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:58:48,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:58:48,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:58:48,497 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2018-12-31 03:58:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:48,682 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-31 03:58:48,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:58:48,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-31 03:58:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:48,684 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:58:48,684 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 03:58:48,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:58:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 03:58:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 03:58:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:58:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-31 03:58:48,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2018-12-31 03:58:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:48,689 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-31 03:58:48,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:58:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-12-31 03:58:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:58:48,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:48,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:48,692 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1049576048, now seen corresponding path program 1 times [2018-12-31 03:58:48,694 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:48,694 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 [2018-12-31 03:58:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:48,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:48,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:48,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:48,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:48,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:48,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:48,819 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2018-12-31 03:58:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:48,893 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 03:58:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:48,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 03:58:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:48,897 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:58:48,897 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:58:48,898 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 [2018-12-31 03:58:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:58:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 03:58:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:58:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-31 03:58:48,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2018-12-31 03:58:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:48,904 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-31 03:58:48,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-31 03:58:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:58:48,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:48,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:48,907 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1983383519, now seen corresponding path program 1 times [2018-12-31 03:58:48,908 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:48,908 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 [2018-12-31 03:58:48,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:49,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:49,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:49,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:49,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:49,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:49,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:49,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:49,037 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2018-12-31 03:58:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,153 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-31 03:58:49,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:49,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 03:58:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,155 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:58:49,155 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:58:49,157 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 [2018-12-31 03:58:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:58:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 03:58:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:58:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-31 03:58:49,161 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2018-12-31 03:58:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:49,163 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-31 03:58:49,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-31 03:58:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:58:49,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:49,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:49,164 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2018-12-31 03:58:49,167 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:49,168 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) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:49,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:49,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:49,329 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:49,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:49,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:58:49,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:58:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:58:49,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:58:49,345 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-12-31 03:58:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,473 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-31 03:58:49,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:58:49,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 03:58:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,473 INFO L225 Difference]: With dead ends: 23 [2018-12-31 03:58:49,473 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:58:49,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:58:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:58:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:58:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:58:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:58:49,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-12-31 03:58:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:49,475 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:58:49,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:58:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:58:49,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:58:49,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:58:49,742 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 03:58:49,880 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-12-31 03:58:49,880 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:58:49,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:58:49,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:58:49,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 66) no Hoare annotation was computed. [2018-12-31 03:58:49,881 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-12-31 03:58:49,881 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x .cse0))) [2018-12-31 03:58:49,881 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2018-12-31 03:58:49,882 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= |ULTIMATE.start_fmin_double_#res| .cse0))) [2018-12-31 03:58:49,883 INFO L448 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2018-12-31 03:58:49,884 INFO L444 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x .cse0))) [2018-12-31 03:58:49,884 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2018-12-31 03:58:49,884 INFO L448 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2018-12-31 03:58:49,884 INFO L444 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x .cse0))) [2018-12-31 03:58:49,885 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (let ((.cse0 (= ULTIMATE.start_fmin_double_~y .cse1))) (or (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 (= ULTIMATE.start_fmin_double_~x .cse1))))) [2018-12-31 03:58:49,885 INFO L451 ceAbstractionStarter]: At program point L70(lines 53 71) the Hoare annotation is: true [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2018-12-31 03:58:49,885 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-12-31 03:58:49,886 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-12-31 03:58:49,886 INFO L444 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0))) [2018-12-31 03:58:49,886 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-12-31 03:58:49,886 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2018-12-31 03:58:49,886 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2018-12-31 03:58:49,898 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,899 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,905 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,905 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,906 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,906 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,907 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,907 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,909 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,910 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,911 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,912 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,912 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,912 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,912 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,916 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,916 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,916 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,916 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,920 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,920 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:49,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:49 BoogieIcfgContainer [2018-12-31 03:58:49,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:49,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:49,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:49,928 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:49,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:45" (3/4) ... [2018-12-31 03:58:49,935 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:58:49,951 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 03:58:49,951 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 03:58:49,952 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 03:58:49,987 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:58:49,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:58:49,989 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967292bv32) == 0bv32) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2018-12-31 03:58:50,058 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:58:50,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:50,063 INFO L168 Benchmark]: Toolchain (without parser) took 6335.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 950.0 MB in the beginning and 808.6 MB in the end (delta: 141.4 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:50,064 INFO L168 Benchmark]: CDTParser took 0.21 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. [2018-12-31 03:58:50,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.11 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:50,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.25 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:50,066 INFO L168 Benchmark]: Boogie Preprocessor took 112.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:50,066 INFO L168 Benchmark]: RCFGBuilder took 748.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:50,074 INFO L168 Benchmark]: TraceAbstraction took 4925.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 808.6 MB in the end (delta: 265.1 MB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:50,075 INFO L168 Benchmark]: Witness Printer took 131.32 ms. Allocated memory is still 1.1 GB. Free memory is still 808.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:50,078 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.11 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 45.25 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 748.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4925.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 808.6 MB in the end (delta: 265.1 MB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. * Witness Printer took 131.32 ms. Allocated memory is still 1.1 GB. Free memory is still 808.6 MB. There was no memory consumed. 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 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 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 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 66]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant [2018-12-31 03:58:50,085 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,086 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 16]: Loop Invariant [2018-12-31 03:58:50,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,096 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,096 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant [2018-12-31 03:58:50,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2018-12-31 03:58:50,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,102 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,104 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,104 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967292bv32) == 0bv32) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 20]: Loop Invariant [2018-12-31 03:58:50,104 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,110 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,110 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2018-12-31 03:58:50,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:50,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 132 SDslu, 682 SDs, 0 SdLazy, 219 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 12 MinimizatonAttempts, 68 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 133 HoareAnnotationTreeSize, 7 FomulaSimplifications, 931 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6567 SizeOfPredicates, 32 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...