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/filter2_alt_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:42:53,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:42:53,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:42:54,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:42:54,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:42:54,013 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:42:54,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:42:54,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:42:54,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:42:54,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:42:54,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:42:54,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:42:54,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:42:54,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:42:54,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:42:54,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:42:54,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:42:54,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:42:54,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:42:54,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:42:54,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:42:54,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:42:54,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:42:54,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:42:54,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:42:54,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:42:54,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:42:54,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:42:54,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:42:54,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:42:54,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:42:54,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:42:54,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:42:54,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:42:54,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:42:54,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:42:54,057 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:42:54,084 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:42:54,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:42:54,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:42:54,087 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:42:54,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:42:54,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:42:54,089 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:42:54,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:42:54,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:42:54,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:42:54,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:42:54,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:42:54,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:42:54,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:42:54,091 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:42:54,091 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:42:54,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:42:54,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:42:54,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:42:54,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:42:54,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:42:54,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:42:54,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:42:54,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:42:54,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:42:54,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:42:54,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:42:54,095 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:42:54,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:42:54,095 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:42:54,095 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:42:54,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:42:54,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:42:54,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:42:54,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:42:54,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:42:54,194 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:42:54,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter2_alt_true-unreach-call.c [2018-09-19 15:42:54,564 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed07daf02/7c648db6794e49838520aca0ae2a5afd/FLAG5f167431b [2018-09-19 15:42:54,739 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:42:54,740 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter2_alt_true-unreach-call.c [2018-09-19 15:42:54,746 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed07daf02/7c648db6794e49838520aca0ae2a5afd/FLAG5f167431b [2018-09-19 15:42:54,763 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed07daf02/7c648db6794e49838520aca0ae2a5afd [2018-09-19 15:42:54,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:42:54,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:42:54,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:42:54,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:42:54,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:42:54,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:42:54" (1/1) ... [2018-09-19 15:42:54,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a5a5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:54, skipping insertion in model container [2018-09-19 15:42:54,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:42:54" (1/1) ... [2018-09-19 15:42:54,802 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:42:55,014 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:42:55,044 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:42:55,061 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:42:55,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55 WrapperNode [2018-09-19 15:42:55,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:42:55,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:42:55,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:42:55,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:42:55,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (1/1) ... [2018-09-19 15:42:55,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:42:55,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:42:55,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:42:55,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:42:55,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (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:42:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:42:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:42:55,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:42:55,209 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-09-19 15:42:55,209 INFO L138 BoogieDeclarations]: Found implementation of procedure filter2 [2018-09-19 15:42:55,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:42:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:42:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-19 15:42:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:42:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:42:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-09-19 15:42:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure filter2 [2018-09-19 15:42:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:42:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:42:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:42:58,164 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:42:58,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:42:58 BoogieIcfgContainer [2018-09-19 15:42:58,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:42:58,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:42:58,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:42:58,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:42:58,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:42:54" (1/3) ... [2018-09-19 15:42:58,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492afa06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:42:58, skipping insertion in model container [2018-09-19 15:42:58,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:42:55" (2/3) ... [2018-09-19 15:42:58,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492afa06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:42:58, skipping insertion in model container [2018-09-19 15:42:58,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:42:58" (3/3) ... [2018-09-19 15:42:58,180 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_alt_true-unreach-call.c [2018-09-19 15:42:58,190 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:42:58,199 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:42:58,247 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:42:58,247 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:42:58,247 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:42:58,248 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:42:58,248 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:42:58,248 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:42:58,248 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:42:58,249 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:42:58,249 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:42:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-09-19 15:42:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-19 15:42:58,284 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:42:58,285 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] [2018-09-19 15:42:58,288 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:42:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1734549253, now seen corresponding path program 1 times [2018-09-19 15:42:58,296 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:42:58,297 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-09-19 15:42:58,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:42:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:42:58,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:42:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:42:58,739 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:42:58,755 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:42:58,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:42:58,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:42:58,774 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:42:58,777 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:42:58,780 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-09-19 15:43:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:43:01,298 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-09-19 15:43:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:43:01,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-19 15:43:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:43:01,353 INFO L225 Difference]: With dead ends: 65 [2018-09-19 15:43:01,354 INFO L226 Difference]: Without dead ends: 40 [2018-09-19 15:43:01,357 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 1 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:43:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-19 15:43:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-09-19 15:43:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-19 15:43:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-09-19 15:43:01,404 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 23 [2018-09-19 15:43:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:43:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-09-19 15:43:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:43:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-09-19 15:43:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-19 15:43:01,408 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:43:01,408 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:43:01,408 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:43:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash -160923856, now seen corresponding path program 1 times [2018-09-19 15:43:01,409 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:43:01,409 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:43:01,418 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:43:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:43:04,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:43:04,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-19 15:43:04,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-19 15:43:04,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-19 15:43:04,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:43:05,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:43:05,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-09-19 15:43:05,584 INFO L303 Elim1Store]: Index analysis took 442 ms [2018-09-19 15:43:05,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-09-19 15:43:05,689 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:43:05,690 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:43:05,691 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-09-19 15:43:05,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-09-19 15:43:05,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:43:06,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:43:06,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-09-19 15:43:06,886 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:43:06,887 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:43:06,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-09-19 15:43:06,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 15:43:06,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:43:07,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:43:07,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 [2018-09-19 15:43:07,630 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 15:43:07,800 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 15:43:08,044 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 15:43:10,438 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:43:10,471 INFO L303 Elim1Store]: Index analysis took 2158 ms [2018-09-19 15:43:10,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-09-19 15:43:10,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-19 15:43:38,856 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:43:38,890 INFO L303 Elim1Store]: Index analysis took 2131 ms [2018-09-19 15:43:38,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2018-09-19 15:43:38,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:44:01,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 15:44:01,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:63 [2018-09-19 15:44:03,335 WARN L797 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_4 (_ FloatingPoint 8 24)) (~X~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq ~X~0 .cse0) (fp.geq v_arrayElimCell_4 .cse0) (fp.leq v_arrayElimCell_4 .cse1) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (fp.leq ~X~0 .cse1))))) is different from false [2018-09-19 15:44:05,382 WARN L819 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_4 (_ FloatingPoint 8 24)) (~X~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq ~X~0 .cse0) (fp.geq v_arrayElimCell_4 .cse0) (fp.leq v_arrayElimCell_4 .cse1) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (fp.leq ~X~0 .cse1))))) is different from true [2018-09-19 15:44:21,790 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse1 (fp.neg .cse2))) (and (fp.geq v_prenex_1 .cse1) (fp.leq v_prenex_3 .cse2) (fp.leq v_prenex_1 .cse2) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_3) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) ((_ to_fp 8 24) RNE 15.0))) (fp.geq v_prenex_3 .cse1)))))) (and (exists ((v_prenex_4 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse4 (fp.neg .cse3))) (and (fp.leq v_prenex_6 .cse3) (fp.leq v_prenex_4 .cse3) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_6) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) (fp.neg ((_ to_fp 8 24) RNE 15.0)))) (fp.geq v_prenex_6 .cse4) (fp.geq v_prenex_4 .cse4))))) .cse0) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_4 (_ FloatingPoint 8 24)) (~X~0 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse5 (fp.neg .cse8)) (.cse6 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (.cse7 ((_ to_fp 8 24) RNE 15.0))) (and (fp.geq ~X~0 .cse5) (fp.geq v_arrayElimCell_4 .cse5) (fp.leq .cse6 .cse7) (fp.geq .cse6 (fp.neg .cse7)) (fp.leq v_arrayElimCell_4 .cse8) (fp.leq ~X~0 .cse8)))))))) is different from false [2018-09-19 15:44:36,198 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_4 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse2 (fp.neg .cse1))) (and (fp.leq v_prenex_6 .cse1) (fp.leq v_prenex_4 .cse1) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_6) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) (fp.neg ((_ to_fp 8 24) RNE 15.0)))) (fp.geq v_prenex_6 .cse2) (fp.geq v_prenex_4 .cse2)))))) (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse3 (fp.neg .cse4))) (and (fp.geq v_prenex_1 .cse3) (fp.leq v_prenex_3 .cse4) (fp.leq v_prenex_1 .cse4) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_3) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) ((_ to_fp 8 24) RNE 15.0))) (fp.geq v_prenex_3 .cse3)))))) (and (exists ((v_arrayElimCell_4 (_ FloatingPoint 8 24)) (~X~0 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse5 (fp.neg .cse8)) (.cse6 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_arrayElimCell_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (.cse7 ((_ to_fp 8 24) RNE 15.0))) (and (fp.geq ~X~0 .cse5) (fp.geq v_arrayElimCell_4 .cse5) (fp.leq .cse6 .cse7) (fp.geq .cse6 (fp.neg .cse7)) (fp.leq v_arrayElimCell_4 .cse8) (fp.leq ~X~0 .cse8))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2018-09-19 15:44:46,463 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_6 .cse0) (fp.leq v_prenex_4 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_6) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) (fp.neg ((_ to_fp 8 24) RNE 15.0)))) (fp.geq v_prenex_6 .cse1) (fp.geq v_prenex_4 .cse1))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse2 (fp.neg .cse3))) (and (fp.geq v_prenex_1 .cse2) (fp.leq v_prenex_3 .cse3) (fp.leq v_prenex_1 .cse3) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_3) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) ((_ to_fp 8 24) RNE 15.0))) (fp.geq v_prenex_3 .cse2)))))) is different from false [2018-09-19 15:44:48,506 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq v_prenex_6 .cse0) (fp.leq v_prenex_4 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_6) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_4 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) (fp.neg ((_ to_fp 8 24) RNE 15.0)))) (fp.geq v_prenex_6 .cse1) (fp.geq v_prenex_4 .cse1))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 10.0))) (let ((.cse2 (fp.neg .cse3))) (and (fp.geq v_prenex_1 .cse2) (fp.leq v_prenex_3 .cse3) (fp.leq v_prenex_1 .cse3) (not (fp.leq (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) v_prenex_3) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE v_prenex_1 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0)))) ((_ to_fp 8 24) RNE 15.0))) (fp.geq v_prenex_3 .cse2)))))) is different from true [2018-09-19 15:44:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 15:44:48,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:44:48,544 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:44:48,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 15:44:48,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 15:44:48,547 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 15:44:48,547 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=83, Unknown=6, NotChecked=84, Total=210 [2018-09-19 15:44:48,548 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 15 states. [2018-09-19 15:44:48,755 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-19 15:44:49,179 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-09-19 15:44:51,149 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-09-19 15:44:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:44:53,789 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-09-19 15:44:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 15:44:53,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-09-19 15:44:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:44:53,796 INFO L225 Difference]: With dead ends: 57 [2018-09-19 15:44:53,796 INFO L226 Difference]: Without dead ends: 55 [2018-09-19 15:44:53,797 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=74, Invalid=176, Unknown=6, NotChecked=124, Total=380 [2018-09-19 15:44:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-19 15:44:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-19 15:44:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-19 15:44:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-09-19 15:44:53,816 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 36 [2018-09-19 15:44:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:44:53,817 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-09-19 15:44:53,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 15:44:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-09-19 15:44:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-19 15:44:53,819 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:44:53,820 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:44:53,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:44:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1251231857, now seen corresponding path program 1 times [2018-09-19 15:44:53,821 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:44:53,821 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:44:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:45:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:45:37,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:45:38,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-19 15:45:38,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:38,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-19 15:45:38,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:38,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:38,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-09-19 15:45:38,686 INFO L303 Elim1Store]: Index analysis took 166 ms [2018-09-19 15:45:38,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-09-19 15:45:38,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:38,944 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:38,945 INFO L303 Elim1Store]: Index analysis took 255 ms [2018-09-19 15:45:38,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-09-19 15:45:38,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:39,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:40,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-09-19 15:45:40,110 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:40,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:40,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-09-19 15:45:40,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 15:45:40,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:40,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:45:40,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:32 [2018-09-19 15:45:40,700 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 15:45:41,070 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 15:45:43,221 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (fp.geq c_~X~0 (fp.neg .cse0)) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE (select c_~E~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select c_~E~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select c_~S~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select c_~S~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (= c_~S~0 |c_old(~S~0)|) (= c_~E~0 |c_old(~E~0)|) (fp.leq c_~X~0 .cse0))) is different from false [2018-09-19 15:45:45,277 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (fp.geq c_~X~0 (fp.neg .cse0)) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE (select c_~E~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select c_~E~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select c_~S~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select c_~S~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (fp.leq c_~X~0 .cse0))) is different from false [2018-09-19 15:45:47,329 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (fp.geq c_~X~0 (fp.neg .cse0)) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE (select c_~E~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select c_~E~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select c_~S~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select c_~S~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (fp.leq c_~X~0 .cse0))) is different from false [2018-09-19 15:45:49,381 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (fp.geq c_~X~0 (fp.neg .cse0)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE (select c_~E~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select c_~E~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select c_~S~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select c_~S~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (fp.leq c_~X~0 .cse0))) is different from false [2018-09-19 15:45:51,437 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE 15.0)) (.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (fp.geq c_~X~0 (fp.neg .cse0)) (fp.geq c_~P~0 (fp.neg .cse1)) (fp.leq c_~P~0 .cse1) (= c_~P~0 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE (select c_~E~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select c_~E~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select c_~S~0 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select c_~S~0 (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (= c_~S~0 |c_old(~S~0)|) (= c_~E~0 |c_old(~E~0)|) (fp.leq c_~X~0 .cse0))) is different from false [2018-09-19 15:45:53,528 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_old(~E~0)| (_ bv0 32))) (.cse4 (select |c_old(~S~0)| (_ bv0 32)))) (let ((.cse2 ((_ to_fp 8 24) RNE 15.0)) (.cse1 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE .cse3 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select |c_old(~E~0)| (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE .cse4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select |c_old(~S~0)| (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (fp.geq c_~X~0 (fp.neg .cse0)) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (= c_~E~0 (store (store |c_old(~E~0)| (_ bv1 32) .cse3) (_ bv0 32) c_~X~0)) (= c_~S~0 (store (store |c_old(~S~0)| (_ bv1 32) .cse4) (_ bv0 32) .cse1)) (fp.leq c_~X~0 .cse0)))) is different from false [2018-09-19 15:45:55,612 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_old(~E~0)| (_ bv0 32))) (.cse4 (select |c_old(~S~0)| (_ bv0 32)))) (let ((.cse2 ((_ to_fp 8 24) RNE 15.0)) (.cse1 (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) c_~X~0) (fp.mul RNE .cse3 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE (select |c_old(~E~0)| (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE .cse4 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE (select |c_old(~S~0)| (_ bv1 32)) ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (.cse0 ((_ to_fp 8 24) RNE 10.0))) (and (fp.geq c_~X~0 (fp.neg .cse0)) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (= c_~E~0 (store (store |c_old(~E~0)| (_ bv1 32) .cse3) (_ bv0 32) c_~X~0)) (= c_~S~0 (store (store |c_old(~S~0)| (_ bv1 32) .cse4) (_ bv0 32) .cse1)) (fp.leq c_~X~0 .cse0)))) is different from true [2018-09-19 15:45:57,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:45:57,975 INFO L303 Elim1Store]: Index analysis took 2355 ms [2018-09-19 15:45:57,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 199 [2018-09-19 15:46:00,235 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:46:02,237 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ~X~0 (select v_arrayElimArr_5 (_ bv1 32))) [2018-09-19 15:46:04,239 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= ~X~0 (select v_arrayElimArr_5 (_ bv1 32))) [2018-09-19 15:46:06,250 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ~X~0 (select v_arrayElimArr_5 (_ bv0 32))) [2018-09-19 15:46:08,251 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= ~X~0 (select v_arrayElimArr_5 (_ bv0 32))) [2018-09-19 15:46:08,324 INFO L303 Elim1Store]: Index analysis took 10344 ms [2018-09-19 15:46:08,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 177 [2018-09-19 15:46:08,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:46:46,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:47:34,908 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:47:35,001 INFO L303 Elim1Store]: Index analysis took 2311 ms [2018-09-19 15:47:35,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 171 [2018-09-19 15:47:37,224 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 15:47:39,228 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (let ((.cse0 (select ~E~0 (_ bv1 32)))) (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select v_arrayElimArr_6 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (select v_arrayElimArr_6 (_ bv1 32))) [2018-09-19 15:47:41,242 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (let ((.cse0 (select ~E~0 (_ bv1 32)))) (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE (select v_arrayElimArr_6 (_ bv0 32)) ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) (select v_arrayElimArr_6 (_ bv1 32))) [2018-09-19 15:47:43,249 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (let ((.cse1 (select v_arrayElimArr_6 (_ bv0 32)))) (= (let ((.cse0 (select ~E~0 (_ bv1 32)))) (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE .cse1 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) .cse1)) [2018-09-19 15:47:45,274 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (let ((.cse1 (select v_arrayElimArr_6 (_ bv0 32)))) (= (let ((.cse0 (select ~E~0 (_ bv1 32)))) (fp.sub RNE (fp.add RNE (fp.add RNE (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 2338913.0 5000000.0)) ~X~0) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 308029.0 400000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 543047.0 1250000.0)))) (fp.mul RNE .cse1 ((_ to_fp 8 24) RNE (/ 15419.0 10000.0)))) (fp.mul RNE .cse0 ((_ to_fp 8 24) RNE (/ 6740477.0 10000000.0))))) .cse1)) [2018-09-19 15:47:45,356 INFO L303 Elim1Store]: Index analysis took 10350 ms [2018-09-19 15:47:45,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 156 [2018-09-19 15:47:45,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-09-19 15:47:49,542 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:47:49,743 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2018-09-19 15:47:49,743 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:47:49,749 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:47:49,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:47:49 BoogieIcfgContainer [2018-09-19 15:47:49,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:47:49,751 INFO L168 Benchmark]: Toolchain (without parser) took 294976.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -532.0 MB). Peak memory consumption was 210.9 MB. Max. memory is 7.1 GB. [2018-09-19 15:47:49,752 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:47:49,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.59 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:47:49,753 INFO L168 Benchmark]: Boogie Preprocessor took 46.74 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:47:49,754 INFO L168 Benchmark]: RCFGBuilder took 3026.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.1 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-09-19 15:47:49,755 INFO L168 Benchmark]: TraceAbstraction took 291579.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 235.5 MB). Peak memory consumption was 235.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:47:49,758 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.59 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 46.74 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 3026.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.1 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 291579.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 235.5 MB). Peak memory consumption was 235.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 55 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 36. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. TIMEOUT Result, 291.5s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 39 SDslu, 161 SDs, 0 SdLazy, 31 SolverSat, 40 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 104.1s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 57 ConstructedInterpolants, 4 QuantifiedInterpolants, 46555 SizeOfPredicates, 13 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown