java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/bary_diverge_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:40:26,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:40:26,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:40:26,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:40:26,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:40:26,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:40:26,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:40:26,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:40:26,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:40:26,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:40:26,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:40:26,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:40:26,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:40:26,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:40:26,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:40:26,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:40:26,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:40:26,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:40:26,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:40:26,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:40:26,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:40:26,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:40:26,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:40:26,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:40:26,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:40:26,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:40:26,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:40:26,157 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:40:26,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:40:26,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:40:26,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:40:26,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:40:26,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:40:26,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:40:26,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:40:26,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:40:26,166 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:40:26,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:40:26,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:40:26,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:40:26,198 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:40:26,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:40:26,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:40:26,199 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:40:26,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:40:26,199 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:40:26,199 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:40:26,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:40:26,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:40:26,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:40:26,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:40:26,200 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:40:26,201 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:40:26,201 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:40:26,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:40:26,201 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:40:26,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:40:26,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:40:26,202 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:40:26,202 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:40:26,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:40:26,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:40:26,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:40:26,203 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:40:26,203 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:40:26,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:40:26,203 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:40:26,204 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:40:26,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:40:26,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:40:26,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:40:26,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:40:26,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:40:26,271 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:40:26,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-09-19 15:40:26,636 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d919bab5/0a6ff5597e194a0d9953ec865ca6d627/FLAGbdf6e8cb1 [2018-09-19 15:40:26,834 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:40:26,836 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-09-19 15:40:26,851 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d919bab5/0a6ff5597e194a0d9953ec865ca6d627/FLAGbdf6e8cb1 [2018-09-19 15:40:26,873 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d919bab5/0a6ff5597e194a0d9953ec865ca6d627 [2018-09-19 15:40:26,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:40:26,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:40:26,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:40:26,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:40:26,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:40:26,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:40:26" (1/1) ... [2018-09-19 15:40:26,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f062572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:26, skipping insertion in model container [2018-09-19 15:40:26,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:40:26" (1/1) ... [2018-09-19 15:40:26,918 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:40:27,169 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:40:27,192 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:40:27,202 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:40:27,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27 WrapperNode [2018-09-19 15:40:27,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:40:27,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:40:27,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:40:27,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:40:27,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (1/1) ... [2018-09-19 15:40:27,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:40:27,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:40:27,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:40:27,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:40:27,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (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-09-19 15:40:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:40:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:40:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:40:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-09-19 15:40:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2018-09-19 15:40:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure bary [2018-09-19 15:40:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:40:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:40:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-19 15:40:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:40:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:40:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-09-19 15:40:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2018-09-19 15:40:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure bary [2018-09-19 15:40:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:40:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:40:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:40:28,559 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:40:28,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:40:28 BoogieIcfgContainer [2018-09-19 15:40:28,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:40:28,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:40:28,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:40:28,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:40:28,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:40:26" (1/3) ... [2018-09-19 15:40:28,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a0c092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:40:28, skipping insertion in model container [2018-09-19 15:40:28,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:27" (2/3) ... [2018-09-19 15:40:28,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a0c092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:40:28, skipping insertion in model container [2018-09-19 15:40:28,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:40:28" (3/3) ... [2018-09-19 15:40:28,569 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge_true-unreach-call_true-termination.c [2018-09-19 15:40:28,579 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:40:28,588 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:40:28,641 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:40:28,642 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:40:28,642 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:40:28,642 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:40:28,643 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:40:28,643 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:40:28,643 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:40:28,643 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:40:28,644 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:40:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-09-19 15:40:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 15:40:28,672 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:28,674 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:28,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1588853623, now seen corresponding path program 1 times [2018-09-19 15:40:28,687 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:28,688 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) [2018-09-19 15:40:28,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:28,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 15:40:29,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:29,146 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:29,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 15:40:29,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 15:40:29,167 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 15:40:29,168 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 15:40:29,171 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 8 states. [2018-09-19 15:40:29,348 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:40:32,304 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-19 15:40:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:34,632 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2018-09-19 15:40:34,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 15:40:34,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-09-19 15:40:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:34,672 INFO L225 Difference]: With dead ends: 132 [2018-09-19 15:40:34,672 INFO L226 Difference]: Without dead ends: 85 [2018-09-19 15:40:34,677 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-09-19 15:40:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-19 15:40:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2018-09-19 15:40:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 15:40:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-09-19 15:40:34,760 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 25 [2018-09-19 15:40:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:34,761 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-09-19 15:40:34,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 15:40:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-09-19 15:40:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 15:40:34,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:34,764 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:34,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1587006581, now seen corresponding path program 1 times [2018-09-19 15:40:34,766 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:34,766 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) [2018-09-19 15:40:34,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:35,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 15:40:35,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:35,031 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:35,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:40:35,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:40:35,034 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:40:35,034 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:40:35,034 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 3 states. [2018-09-19 15:40:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:37,136 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-09-19 15:40:37,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:40:37,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-09-19 15:40:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:37,163 INFO L225 Difference]: With dead ends: 108 [2018-09-19 15:40:37,163 INFO L226 Difference]: Without dead ends: 74 [2018-09-19 15:40:37,166 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:40:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-19 15:40:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-19 15:40:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-19 15:40:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-09-19 15:40:37,184 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2018-09-19 15:40:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:37,185 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-09-19 15:40:37,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:40:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-09-19 15:40:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-19 15:40:37,187 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:37,187 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:37,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash 971109145, now seen corresponding path program 1 times [2018-09-19 15:40:37,189 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:37,189 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-09-19 15:40:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:40:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:37,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-19 15:40:37,792 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:37,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:37,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 15:40:37,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 15:40:37,809 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 15:40:37,809 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 15:40:37,810 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 8 states. [2018-09-19 15:40:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:42,363 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-09-19 15:40:42,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 15:40:42,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-09-19 15:40:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:42,366 INFO L225 Difference]: With dead ends: 94 [2018-09-19 15:40:42,367 INFO L226 Difference]: Without dead ends: 92 [2018-09-19 15:40:42,367 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-09-19 15:40:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-19 15:40:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2018-09-19 15:40:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-19 15:40:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-09-19 15:40:42,387 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-09-19 15:40:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:42,388 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-09-19 15:40:42,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 15:40:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-09-19 15:40:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-19 15:40:42,390 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:42,390 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:42,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 972956187, now seen corresponding path program 1 times [2018-09-19 15:40:42,391 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:42,391 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-09-19 15:40:42,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:40:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:42,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:46,845 WARN L819 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from true [2018-09-19 15:40:59,631 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) .cse1) (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse2) (fp.geq v_prenex_2 (fp.neg .cse2)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0)))))) .cse1))) is different from false [2018-09-19 15:41:09,792 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse2) (fp.geq ~Y~0 (fp.neg .cse2))))) .cse0))) is different from false [2018-09-19 15:41:19,936 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) is different from false [2018-09-19 15:41:21,974 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) is different from true [2018-09-19 15:41:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2018-09-19 15:41:21,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:41:24,154 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-19 15:41:26,182 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-09-19 15:41:28,206 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-19 15:41:30,230 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-09-19 15:41:32,430 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-19 15:41:34,453 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-09-19 15:41:36,511 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from false [2018-09-19 15:41:38,554 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from true [2018-09-19 15:41:40,605 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 5.0)) (.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 c_~Y~0))) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~I~0) (fp.mul RNE .cse9 c_~I~0)) (fp.mul RNE .cse10 c_~I~0))) (.cse7 (fp.neg .cse5))) (let ((.cse1 (fp.geq .cse4 .cse7)) (.cse3 (fp.leq .cse6 .cse5)) (.cse2 (fp.geq .cse6 .cse7)) (.cse0 (fp.leq .cse4 .cse5))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (not .cse1) (and .cse3 .cse2) (not .cse0))))) is different from false [2018-09-19 15:41:43,783 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) |c_main_#t~ret2|) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) |c_main_#t~ret2|)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) |c_main_#t~ret2|))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-19 15:41:57,501 WARN L797 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_3 .cse0)) (not (fp.geq v_prenex_3 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_3) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_3)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_3)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_RANDOM_INPUT_~x~0_14 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_14 .cse1)) (not (fp.geq v_RANDOM_INPUT_~x~0_14 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) ((_ to_fp 8 24) RNE 5.0)))))) is different from false [2018-09-19 15:41:59,548 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_3 .cse0)) (not (fp.geq v_prenex_3 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_3) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_3)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_3)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_RANDOM_INPUT_~x~0_14 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_14 .cse1)) (not (fp.geq v_RANDOM_INPUT_~x~0_14 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) ((_ to_fp 8 24) RNE 5.0)))))) is different from true [2018-09-19 15:41:59,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 15:41:59,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 15:41:59,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:42:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-09-19 15:42:11,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-19 15:42:11,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-19 15:42:11,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:42:11,761 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:42:11,761 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=89, Unknown=16, NotChecked=270, Total=420 [2018-09-19 15:42:11,762 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 12 states. [2018-09-19 15:42:12,009 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-19 15:42:12,307 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-09-19 15:42:12,580 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-09-19 15:42:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:42:14,925 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-09-19 15:42:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:42:14,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-09-19 15:42:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:42:14,929 INFO L225 Difference]: With dead ends: 96 [2018-09-19 15:42:14,929 INFO L226 Difference]: Without dead ends: 94 [2018-09-19 15:42:14,930 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=79, Invalid=155, Unknown=16, NotChecked=350, Total=600 [2018-09-19 15:42:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-19 15:42:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-19 15:42:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-19 15:42:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2018-09-19 15:42:14,960 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 56 [2018-09-19 15:42:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:42:14,960 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2018-09-19 15:42:14,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:42:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2018-09-19 15:42:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 15:42:14,963 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:42:14,963 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:42:14,964 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:42:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1162764683, now seen corresponding path program 2 times [2018-09-19 15:42:14,965 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:42:14,965 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-09-19 15:42:14,970 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:42:15,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:42:15,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:42:15,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:42:16,147 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 15:42:18,191 WARN L797 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from false [2018-09-19 15:42:20,213 WARN L819 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from true [2018-09-19 15:42:35,283 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_7) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_7)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_7)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.geq v_prenex_7 (fp.neg .cse0)) (fp.leq v_prenex_7 .cse0)))) .cse1) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and .cse1 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) is different from false [2018-09-19 15:42:45,460 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_7) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_7)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_7)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.geq v_prenex_7 (fp.neg .cse1)) (fp.leq v_prenex_7 .cse1))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and .cse0 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) is different from false [2018-09-19 15:42:55,632 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_7) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_7)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_7)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.geq v_prenex_7 (fp.neg .cse0)) (fp.leq v_prenex_7 .cse0)))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_5 (fp.neg .cse1)))))) is different from false [2018-09-19 15:42:57,657 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_7) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_7)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_7)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.geq v_prenex_7 (fp.neg .cse0)) (fp.leq v_prenex_7 .cse0)))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_5 (fp.neg .cse1)))))) is different from true [2018-09-19 15:42:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2018-09-19 15:42:57,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:42:59,801 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-19 15:43:01,826 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-09-19 15:43:03,864 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-19 15:43:07,519 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-19 15:43:09,548 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-09-19 15:43:11,595 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from false [2018-09-19 15:43:13,642 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from true [2018-09-19 15:43:15,688 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 5.0)) (.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 c_~Y~0))) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~I~0) (fp.mul RNE .cse9 c_~I~0)) (fp.mul RNE .cse10 c_~I~0))) (.cse7 (fp.neg .cse5))) (let ((.cse1 (fp.geq .cse4 .cse7)) (.cse3 (fp.leq .cse6 .cse5)) (.cse2 (fp.geq .cse6 .cse7)) (.cse0 (fp.leq .cse4 .cse5))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (not .cse1) (and .cse3 .cse2) (not .cse0))))) is different from false [2018-09-19 15:43:17,839 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.geq .cse2 (fp.neg .cse3))) (.cse0 (fp.leq .cse2 .cse3))) (or (and .cse0 .cse1) (not .cse1) (not .cse0)))) is different from false [2018-09-19 15:43:19,866 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) |c_main_#t~ret6|) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) |c_main_#t~ret6|)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) |c_main_#t~ret6|))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-19 15:43:33,458 WARN L797 $PredicateComparison]: unable to prove that (and (forall ((v_RANDOM_INPUT_~x~0_26 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_26 .cse0)) (not (fp.geq v_RANDOM_INPUT_~x~0_26 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_8 .cse1)) (not (fp.geq v_prenex_8 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_8) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_8)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_8)) ((_ to_fp 8 24) RNE 5.0)))))) is different from false [2018-09-19 15:43:35,500 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_RANDOM_INPUT_~x~0_26 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_26 .cse0)) (not (fp.geq v_RANDOM_INPUT_~x~0_26 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_8 .cse1)) (not (fp.geq v_prenex_8 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_8) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_8)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_8)) ((_ to_fp 8 24) RNE 5.0)))))) is different from true [2018-09-19 15:43:35,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 15:43:35,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 15:43:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-19 15:43:50,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:43:50,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-09-19 15:43:50,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-19 15:43:50,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-19 15:43:50,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:43:50,787 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:43:50,787 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=89, Unknown=16, NotChecked=270, Total=420 [2018-09-19 15:43:50,788 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 12 states. [2018-09-19 15:44:33,901 WARN L178 SmtUtils]: Spent 9.36 s on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 15:44:38,043 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) RNE 1.0))) (and (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_7) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_7)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_7)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.geq v_prenex_7 (fp.neg .cse0)) (fp.leq v_prenex_7 .cse0)))) .cse1) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and .cse1 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) (fp.leq c_~I~0 .cse3) (fp.geq c_~I~0 (fp.neg .cse3)))) is different from false [2018-09-19 15:44:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:44:44,281 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-09-19 15:44:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 15:44:44,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-09-19 15:44:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:44:44,285 INFO L225 Difference]: With dead ends: 111 [2018-09-19 15:44:44,286 INFO L226 Difference]: Without dead ends: 109 [2018-09-19 15:44:44,287 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=94, Invalid=225, Unknown=31, NotChecked=462, Total=812 [2018-09-19 15:44:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-19 15:44:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-19 15:44:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-19 15:44:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2018-09-19 15:44:44,317 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 87 [2018-09-19 15:44:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:44:44,318 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2018-09-19 15:44:44,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:44:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2018-09-19 15:44:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 15:44:44,322 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:44:44,322 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:44:44,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:44:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 768397897, now seen corresponding path program 3 times [2018-09-19 15:44:44,323 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:44:44,323 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-09-19 15:44:44,329 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-19 15:44:46,373 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-09-19 15:44:46,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:44:46,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:45:09,043 WARN L178 SmtUtils]: Spent 5.77 s on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 15:45:11,072 WARN L797 $PredicateComparison]: unable to prove that (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) is different from false Received shutdown request... [2018-09-19 15:45:17,006 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:45:17,207 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2018-09-19 15:45:17,208 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:45:17,213 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:45:17,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:45:17 BoogieIcfgContainer [2018-09-19 15:45:17,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:45:17,214 INFO L168 Benchmark]: Toolchain (without parser) took 290327.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -265.2 MB). Peak memory consumption was 447.9 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:17,215 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:45:17,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:17,217 INFO L168 Benchmark]: Boogie Preprocessor took 67.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:45:17,217 INFO L168 Benchmark]: RCFGBuilder took 1269.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -758.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:17,218 INFO L168 Benchmark]: TraceAbstraction took 288652.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 482.5 MB). Peak memory consumption was 482.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:17,223 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1269.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -758.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 288652.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 482.5 MB). Peak memory consumption was 482.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 9]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 9). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. TIMEOUT Result, 288.5s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 68.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 254 SDslu, 1248 SDs, 0 SdLazy, 163 SolverSat, 199 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 281 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 126.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 46 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 28.6s SatisfiabilityAnalysisTime, 157.4s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 244 ConstructedInterpolants, 8 QuantifiedInterpolants, 149966 SizeOfPredicates, 28 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 171/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown