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-newlib/double_req_bl_1092b_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:18:14,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:18:14,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:18:14,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:18:14,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:18:14,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:18:14,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:18:14,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:18:14,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:18:14,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:18:14,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:18:14,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:18:14,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:18:14,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:18:14,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:18:14,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:18:14,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:18:14,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:18:14,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:18:14,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:18:14,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:18:14,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:18:14,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:18:14,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:18:14,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:18:14,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:18:14,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:18:14,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:18:14,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:18:14,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:18:14,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:18:14,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:18:14,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:18:14,967 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:18:14,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:18:14,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:18:14,969 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 16:18:15,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:18:15,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:18:15,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:18:15,002 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:18:15,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:18:15,003 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:18:15,003 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:18:15,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:18:15,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:18:15,004 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:18:15,004 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:18:15,004 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:18:15,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:18:15,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:18:15,005 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:18:15,005 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:18:15,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:18:15,007 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:18:15,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:18:15,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:18:15,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:18:15,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:18:15,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:18:15,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:18:15,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:18:15,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:18:15,009 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:18:15,009 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:18:15,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:18:15,010 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:18:15,010 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:18:15,010 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:18:15,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:18:15,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:18:15,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:18:15,098 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:18:15,098 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:18:15,099 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1092b_true-unreach-call.c [2018-09-19 16:18:15,495 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b911d16a1/a1631112761d421a86f6e9aede63ca71/FLAG4e99d9e32 [2018-09-19 16:18:15,671 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:18:15,676 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1092b_true-unreach-call.c [2018-09-19 16:18:15,684 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b911d16a1/a1631112761d421a86f6e9aede63ca71/FLAG4e99d9e32 [2018-09-19 16:18:15,700 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b911d16a1/a1631112761d421a86f6e9aede63ca71 [2018-09-19 16:18:15,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:18:15,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:18:15,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:18:15,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:18:15,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:18:15,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:18:15" (1/1) ... [2018-09-19 16:18:15,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173e3430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:15, skipping insertion in model container [2018-09-19 16:18:15,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:18:15" (1/1) ... [2018-09-19 16:18:15,739 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:18:15,956 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:18:15,976 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:18:16,014 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:18:16,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16 WrapperNode [2018-09-19 16:18:16,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:18:16,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:18:16,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:18:16,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:18:16,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (1/1) ... [2018-09-19 16:18:16,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:18:16,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:18:16,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:18:16,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:18:16,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (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 16:18:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:18:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:18:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:18:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-09-19 16:18:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:18:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:18:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:18:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-09-19 16:18:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:18:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:18:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:18:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:18:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:18:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:18:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:18:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:18:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:18:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:18:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:18:16,547 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:18:16,598 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:18:16,632 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:18:18,022 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:18:18,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:18:18 BoogieIcfgContainer [2018-09-19 16:18:18,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:18:18,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:18:18,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:18:18,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:18:18,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:18:15" (1/3) ... [2018-09-19 16:18:18,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30309d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:18:18, skipping insertion in model container [2018-09-19 16:18:18,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:18:16" (2/3) ... [2018-09-19 16:18:18,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30309d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:18:18, skipping insertion in model container [2018-09-19 16:18:18,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:18:18" (3/3) ... [2018-09-19 16:18:18,032 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092b_true-unreach-call.c [2018-09-19 16:18:18,042 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:18:18,052 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:18:18,099 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:18:18,100 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:18:18,100 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:18:18,101 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:18:18,101 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:18:18,101 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:18:18,101 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:18:18,102 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:18:18,102 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:18:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-19 16:18:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-19 16:18:18,135 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:18,136 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:18,138 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1001944266, now seen corresponding path program 1 times [2018-09-19 16:18:18,147 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:18,148 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 16:18:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:18,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:18,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:18,257 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:18,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:18:18,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:18:18,274 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:18:18,275 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:18:18,277 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-09-19 16:18:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:18,304 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2018-09-19 16:18:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:18:18,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-09-19 16:18:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:18,319 INFO L225 Difference]: With dead ends: 120 [2018-09-19 16:18:18,319 INFO L226 Difference]: Without dead ends: 60 [2018-09-19 16:18:18,323 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:18:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-19 16:18:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-19 16:18:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-19 16:18:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2018-09-19 16:18:18,369 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 18 [2018-09-19 16:18:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:18,369 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-09-19 16:18:18,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:18:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-09-19 16:18:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 16:18:18,371 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:18,371 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:18,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash -262001498, now seen corresponding path program 1 times [2018-09-19 16:18:18,373 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:18,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:18,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:18,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:18,654 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 11 treesize of output 10 [2018-09-19 16:18:18,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:18,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:18,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:18,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:18,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:18,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:18,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:18,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:18,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:18,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:19,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:19,429 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:19,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:18:19,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:18:19,431 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:18:19,432 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:18:19,432 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 9 states. [2018-09-19 16:18:19,951 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:18:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:27,403 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-09-19 16:18:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 16:18:27,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-09-19 16:18:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:27,409 INFO L225 Difference]: With dead ends: 116 [2018-09-19 16:18:27,409 INFO L226 Difference]: Without dead ends: 69 [2018-09-19 16:18:27,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:18:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-19 16:18:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-09-19 16:18:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:18:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-19 16:18:27,421 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2018-09-19 16:18:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:27,421 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-19 16:18:27,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:18:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-19 16:18:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 16:18:27,423 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:27,423 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:27,423 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1963531185, now seen corresponding path program 1 times [2018-09-19 16:18:27,424 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:27,425 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 16:18:27,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:27,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:27,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:27,546 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 11 treesize of output 10 [2018-09-19 16:18:27,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:27,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:27,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:27,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:27,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:27,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:27,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:27,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:27,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:27,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:27,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:27,915 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:27,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:18:27,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:18:27,916 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:18:27,917 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:18:27,917 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 9 states. [2018-09-19 16:18:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:33,165 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-09-19 16:18:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 16:18:33,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-09-19 16:18:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:33,168 INFO L225 Difference]: With dead ends: 103 [2018-09-19 16:18:33,169 INFO L226 Difference]: Without dead ends: 62 [2018-09-19 16:18:33,170 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:18:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-19 16:18:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-09-19 16:18:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-19 16:18:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-09-19 16:18:33,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 31 [2018-09-19 16:18:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-09-19 16:18:33,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:18:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-09-19 16:18:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-19 16:18:33,180 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:33,180 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:33,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1759812404, now seen corresponding path program 1 times [2018-09-19 16:18:33,181 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:33,182 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 16:18:33,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:33,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:36,359 WARN L178 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:18:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:36,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:36,383 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:36,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 16:18:36,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:18:36,384 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:18:36,385 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:18:36,385 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2018-09-19 16:18:41,122 WARN L178 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:18:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:42,138 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-09-19 16:18:42,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:18:42,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-09-19 16:18:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:42,150 INFO L225 Difference]: With dead ends: 66 [2018-09-19 16:18:42,150 INFO L226 Difference]: Without dead ends: 47 [2018-09-19 16:18:42,151 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:18:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-19 16:18:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-19 16:18:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-19 16:18:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-19 16:18:42,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-19 16:18:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:42,157 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-19 16:18:42,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:18:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-19 16:18:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-19 16:18:42,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:42,159 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:42,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 623561467, now seen corresponding path program 1 times [2018-09-19 16:18:42,160 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:42,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:42,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:42,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:42,554 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 11 treesize of output 10 [2018-09-19 16:18:42,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:42,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:42,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:42,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:42,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:42,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:42,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:42,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:42,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:42,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:42,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:42,896 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:42,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:18:42,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:18:42,897 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:18:42,897 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:18:42,898 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 8 states. [2018-09-19 16:18:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:44,487 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-19 16:18:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:18:44,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-09-19 16:18:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:44,489 INFO L225 Difference]: With dead ends: 81 [2018-09-19 16:18:44,490 INFO L226 Difference]: Without dead ends: 62 [2018-09-19 16:18:44,490 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:18:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-19 16:18:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-09-19 16:18:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-19 16:18:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-19 16:18:44,497 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-19 16:18:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:44,498 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-19 16:18:44,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:18:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-19 16:18:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:18:44,499 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:44,499 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:44,499 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2005267350, now seen corresponding path program 1 times [2018-09-19 16:18:44,500 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:44,500 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 16:18:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:44,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:44,713 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:44,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:44,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:18:44,727 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:44,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:18:44,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:44,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:44,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:44,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:18:45,015 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:45,016 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:45,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-19 16:18:45,026 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:45,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:18:45,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:45,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:45,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:45,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:18:45,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-19 16:18:45,264 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:45,275 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:18:45,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:45,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:45,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:45,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:18:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:45,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:45,562 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:45,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:18:45,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:18:45,563 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:18:45,563 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:18:45,564 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 10 states. [2018-09-19 16:18:46,360 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:18:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:48,157 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2018-09-19 16:18:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:18:48,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-09-19 16:18:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:48,159 INFO L225 Difference]: With dead ends: 66 [2018-09-19 16:18:48,159 INFO L226 Difference]: Without dead ends: 47 [2018-09-19 16:18:48,160 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:18:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-19 16:18:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-19 16:18:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-19 16:18:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2018-09-19 16:18:48,166 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 46 [2018-09-19 16:18:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:48,167 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2018-09-19 16:18:48,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:18:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2018-09-19 16:18:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:18:48,168 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:48,168 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:48,168 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash 600756204, now seen corresponding path program 1 times [2018-09-19 16:18:48,169 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:48,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:48,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:48,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:48,437 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 11 treesize of output 10 [2018-09-19 16:18:48,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:48,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:48,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:48,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:48,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:48,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:48,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:48,721 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 11 treesize of output 10 [2018-09-19 16:18:48,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:48,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-09-19 16:18:48,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-19 16:18:48,861 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:48,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:48,863 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 33 [2018-09-19 16:18:48,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:48,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:48,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-09-19 16:18:49,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-09-19 16:18:49,048 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:49,049 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:49,051 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2018-09-19 16:18:49,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:49,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:49,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:49,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:38 [2018-09-19 16:18:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:49,740 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:49,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:49,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 16:18:49,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 16:18:49,753 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 16:18:49,753 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:18:49,754 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 15 states. [2018-09-19 16:18:53,843 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-09-19 16:18:54,179 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-09-19 16:18:54,493 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-09-19 16:18:54,797 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-19 16:18:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:55,499 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2018-09-19 16:18:55,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 16:18:55,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-09-19 16:18:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:55,505 INFO L225 Difference]: With dead ends: 47 [2018-09-19 16:18:55,505 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:18:55,506 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-09-19 16:18:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:18:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:18:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:18:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:18:55,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-09-19 16:18:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:55,507 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:18:55,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 16:18:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:18:55,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:18:55,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:18:55,825 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-19 16:18:55,991 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-19 16:18:55,994 INFO L426 ceAbstractionStarter]: For program point isnan_doubleENTRY(line 15) no Hoare annotation was computed. [2018-09-19 16:18:55,994 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 15) no Hoare annotation was computed. [2018-09-19 16:18:55,994 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 15) no Hoare annotation was computed. [2018-09-19 16:18:55,995 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:18:55,995 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:18:55,995 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:18:55,995 INFO L426 ceAbstractionStarter]: For program point L60(lines 60 72) no Hoare annotation was computed. [2018-09-19 16:18:55,995 INFO L426 ceAbstractionStarter]: For program point L52(lines 52 55) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L44(lines 44 49) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L78-1(line 78) no Hoare annotation was computed. [2018-09-19 16:18:55,996 INFO L426 ceAbstractionStarter]: For program point L78-2(line 78) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point L45-2(lines 45 46) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point L78-3(line 78) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 69) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 73) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L429 ceAbstractionStarter]: At program point ceil_doubleENTRY(lines 19 81) the Hoare annotation is: true [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point ceil_doubleFINAL(lines 19 81) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point ceil_doubleEXIT(lines 19 81) no Hoare annotation was computed. [2018-09-19 16:18:55,997 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 50) no Hoare annotation was computed. [2018-09-19 16:18:55,998 INFO L426 ceAbstractionStarter]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2018-09-19 16:18:55,998 INFO L422 ceAbstractionStarter]: At program point L22-3(lines 22 27) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_ceil~0)) (= |ceil_double_#in~x| ceil_double_~x)) [2018-09-19 16:18:55,998 INFO L426 ceAbstractionStarter]: For program point L22-4(lines 22 27) no Hoare annotation was computed. [2018-09-19 16:18:55,998 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 39) no Hoare annotation was computed. [2018-09-19 16:18:55,998 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-19 16:18:55,998 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L32(lines 32 38) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L74-2(lines 19 81) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L74-3(lines 74 79) no Hoare annotation was computed. [2018-09-19 16:18:55,999 INFO L426 ceAbstractionStarter]: For program point L66(lines 66 67) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L66-2(lines 66 67) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 59) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L25-2(line 25) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-09-19 16:18:56,000 INFO L426 ceAbstractionStarter]: For program point L75-1(line 75) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L75-2(line 75) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L75-3(line 75) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L51(lines 51 73) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-19 16:18:56,001 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 38) no Hoare annotation was computed. [2018-09-19 16:18:56,002 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:18:56,002 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_ceil~0) [2018-09-19 16:18:56,002 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:18:56,002 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:18:56,002 INFO L426 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-09-19 16:18:56,002 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 98) no Hoare annotation was computed. [2018-09-19 16:18:56,002 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 96) no Hoare annotation was computed. [2018-09-19 16:18:56,002 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 83 100) the Hoare annotation is: true [2018-09-19 16:18:56,002 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 83 100) no Hoare annotation was computed. [2018-09-19 16:18:56,003 INFO L422 ceAbstractionStarter]: At program point L92(line 92) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_ceil~0)) (= (_ +zero 11 53) main_~x~0)) [2018-09-19 16:18:56,003 INFO L426 ceAbstractionStarter]: For program point L92-1(line 92) no Hoare annotation was computed. [2018-09-19 16:18:56,003 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 83 100) no Hoare annotation was computed. [2018-09-19 16:18:56,009 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:18:56,014 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:18:56,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:18:56 BoogieIcfgContainer [2018-09-19 16:18:56,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:18:56,017 INFO L168 Benchmark]: Toolchain (without parser) took 40305.63 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.7 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -931.8 MB). Peak memory consumption was 587.9 MB. Max. memory is 7.1 GB. [2018-09-19 16:18:56,018 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 16:18:56,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.57 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 16:18:56,019 INFO L168 Benchmark]: Boogie Preprocessor took 60.84 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 16:18:56,020 INFO L168 Benchmark]: RCFGBuilder took 1894.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:18:56,020 INFO L168 Benchmark]: TraceAbstraction took 37991.86 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -171.4 MB). Peak memory consumption was 599.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:18:56,024 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 350.57 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 60.84 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 1894.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37991.86 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -171.4 MB). Peak memory consumption was 599.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 96]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2018-09-19 16:18:56,031 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:18:56,032 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE Derived loop invariant: !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_ceil) || \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 67 locations, 1 error locations. SAFE Result, 37.9s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 29.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 326 SDtfs, 583 SDslu, 1198 SDs, 0 SdLazy, 920 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8 NumberOfFragments, 29 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 254 ConstructedInterpolants, 131 QuantifiedInterpolants, 129672 SizeOfPredicates, 46 NumberOfNonLiveVariables, 522 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...