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_1032b_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:17:30,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:17:30,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:17:30,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:17:30,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:17:30,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:17:30,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:17:30,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:17:30,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:17:30,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:17:30,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:17:30,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:17:30,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:17:30,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:17:30,861 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:17:30,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:17:30,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:17:30,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:17:30,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:17:30,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:17:30,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:17:30,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:17:30,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:17:30,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:17:30,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:17:30,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:17:30,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:17:30,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:17:30,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:17:30,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:17:30,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:17:30,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:17:30,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:17:30,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:17:30,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:17:30,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:17:30,883 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:17:30,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:17:30,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:17:30,900 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:17:30,900 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:17:30,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:17:30,901 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:17:30,901 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:17:30,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:17:30,901 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:17:30,901 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:17:30,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:17:30,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:17:30,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:17:30,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:17:30,902 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:17:30,903 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:17:30,903 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:17:30,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:17:30,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:17:30,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:17:30,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:17:30,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:17:30,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:17:30,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:17:30,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:17:30,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:17:30,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:17:30,906 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:17:30,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:17:30,906 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:17:30,906 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:17:30,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:17:30,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:17:30,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:17:30,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:17:30,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:17:30,992 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:17:30,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1032b_true-unreach-call.c [2018-09-19 16:17:31,361 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee71b180/252e7cd4bda54136a22f66a851d125d6/FLAGc73285776 [2018-09-19 16:17:31,566 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:17:31,566 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1032b_true-unreach-call.c [2018-09-19 16:17:31,574 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee71b180/252e7cd4bda54136a22f66a851d125d6/FLAGc73285776 [2018-09-19 16:17:31,590 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee71b180/252e7cd4bda54136a22f66a851d125d6 [2018-09-19 16:17:31,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:17:31,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:17:31,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:17:31,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:17:31,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:17:31,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:31,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efa186f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31, skipping insertion in model container [2018-09-19 16:17:31,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:31,625 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:17:31,857 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:17:31,880 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:17:31,922 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:17:31,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31 WrapperNode [2018-09-19 16:17:31,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:17:31,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:17:31,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:17:31,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:17:31,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:31,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:32,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:32,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:32,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:32,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:32,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (1/1) ... [2018-09-19 16:17:32,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:17:32,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:17:32,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:17:32,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:17:32,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (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:17:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:17:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:17:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:17:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-09-19 16:17:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-19 16:17:32,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:17:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:17:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:17:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-09-19 16:17:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:17:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:17:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:17:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:17:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:17:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:17:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-19 16:17:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:17:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:17:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:17:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:17:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:17:32,440 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:32,492 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:32,687 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:32,704 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:32,726 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:32,940 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:17:32,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:17:32 BoogieIcfgContainer [2018-09-19 16:17:32,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:17:32,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:17:32,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:17:32,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:17:32,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:17:31" (1/3) ... [2018-09-19 16:17:32,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3e2e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:17:32, skipping insertion in model container [2018-09-19 16:17:32,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:31" (2/3) ... [2018-09-19 16:17:32,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3e2e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:17:32, skipping insertion in model container [2018-09-19 16:17:32,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:17:32" (3/3) ... [2018-09-19 16:17:32,950 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032b_true-unreach-call.c [2018-09-19 16:17:32,960 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:17:32,969 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:17:33,021 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:17:33,022 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:17:33,022 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:17:33,022 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:17:33,023 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:17:33,023 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:17:33,023 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:17:33,024 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:17:33,024 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:17:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-09-19 16:17:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-19 16:17:33,054 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:33,055 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:17:33,058 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash -141193166, now seen corresponding path program 1 times [2018-09-19 16:17:33,069 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:33,069 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:17:33,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:33,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:33,162 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:17:33,163 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:33,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:33,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:17:33,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:17:33,193 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:17:33,194 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:17:33,197 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-09-19 16:17:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:33,228 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2018-09-19 16:17:33,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:17:33,229 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-19 16:17:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:33,240 INFO L225 Difference]: With dead ends: 138 [2018-09-19 16:17:33,240 INFO L226 Difference]: Without dead ends: 69 [2018-09-19 16:17:33,244 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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:17:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-19 16:17:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-19 16:17:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-19 16:17:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-09-19 16:17:33,292 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 19 [2018-09-19 16:17:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:33,292 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-09-19 16:17:33,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:17:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-09-19 16:17:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-19 16:17:33,294 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:33,295 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] [2018-09-19 16:17:33,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 801598628, now seen corresponding path program 1 times [2018-09-19 16:17:33,296 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:33,296 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 16:17:33,306 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 16:17:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:33,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:33,523 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:17:33,543 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:17:33,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:33,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:33,603 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:17:33,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:33,655 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:17:33,669 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:17:33,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:33,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:33,754 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:17:33,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:34,339 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:17:34,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:34,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:34,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:17:34,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:17:34,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:17:34,358 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:17:34,359 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 9 states. [2018-09-19 16:17:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:37,131 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-09-19 16:17:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:17:37,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-09-19 16:17:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:37,135 INFO L225 Difference]: With dead ends: 123 [2018-09-19 16:17:37,135 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:17:37,137 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-09-19 16:17:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:17:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:17:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:17:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-19 16:17:37,146 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 32 [2018-09-19 16:17:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:37,146 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-19 16:17:37,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:17:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-19 16:17:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:17:37,148 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:37,148 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:17:37,149 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash -454012241, now seen corresponding path program 1 times [2018-09-19 16:17:37,150 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:37,151 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:17:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:37,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:37,265 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:17:37,274 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:17:37,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:37,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:37,321 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:17:37,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:37,362 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:17:37,367 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:17:37,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:37,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:37,382 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:17:37,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:37,617 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:17:37,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:37,631 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:37,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:17:37,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:17:37,632 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:17:37,634 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:17:37,634 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 9 states. [2018-09-19 16:17:38,114 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:17:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:39,118 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-09-19 16:17:39,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:17:39,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-09-19 16:17:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:39,121 INFO L225 Difference]: With dead ends: 100 [2018-09-19 16:17:39,121 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:17:39,122 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:17:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:17:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:17:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:17:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-19 16:17:39,129 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 46 [2018-09-19 16:17:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:39,129 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-19 16:17:39,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:17:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-19 16:17:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:17:39,131 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:39,131 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:17:39,132 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -31310415, now seen corresponding path program 1 times [2018-09-19 16:17:39,132 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:39,132 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:17:39,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:39,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:39,271 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 15 treesize of output 12 [2018-09-19 16:17:39,276 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 12 treesize of output 11 [2018-09-19 16:17:39,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:39,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:39,294 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:17:39,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-09-19 16:17:39,346 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 23 treesize of output 18 [2018-09-19 16:17:39,352 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:17:39,357 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 18 treesize of output 25 [2018-09-19 16:17:39,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:39,384 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:17:39,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-19 16:17:39,436 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 64 treesize of output 48 [2018-09-19 16:17:39,471 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:17:39,474 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 48 treesize of output 28 [2018-09-19 16:17:39,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:39,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:39,487 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:17:39,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:21 [2018-09-19 16:17:39,675 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:17:39,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:39,691 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:39,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:17:39,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:17:39,692 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:17:39,692 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:17:39,693 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 11 states. [2018-09-19 16:17:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:40,478 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2018-09-19 16:17:40,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:17:40,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-09-19 16:17:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:40,482 INFO L225 Difference]: With dead ends: 66 [2018-09-19 16:17:40,482 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:17:40,483 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:17:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:17:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:17:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:17:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 62 transitions. [2018-09-19 16:17:40,491 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 62 transitions. Word has length 46 [2018-09-19 16:17:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:40,491 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 62 transitions. [2018-09-19 16:17:40,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:17:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 62 transitions. [2018-09-19 16:17:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-19 16:17:40,493 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:40,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:17:40,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1741989352, now seen corresponding path program 1 times [2018-09-19 16:17:40,495 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:40,495 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) [2018-09-19 16:17:40,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:17:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:40,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:40,682 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:17:40,687 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:17:40,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:40,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:40,708 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:17:40,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:40,758 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:17:40,775 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:17:40,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:40,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:40,801 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:17:40,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:40,946 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 16 treesize of output 13 [2018-09-19 16:17:40,969 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 13 treesize of output 12 [2018-09-19 16:17:40,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:40,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:41,066 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:17:41,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-19 16:17:41,178 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 24 treesize of output 19 [2018-09-19 16:17:41,196 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:17:41,200 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 19 treesize of output 26 [2018-09-19 16:17:41,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:41,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:41,242 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:17:41,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-09-19 16:17:41,263 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 58 treesize of output 44 [2018-09-19 16:17:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:17:41,327 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-09-19 16:17:41,329 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 16:17:41,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:17:41,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:17:41,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:34 [2018-09-19 16:17:42,121 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:17:42,137 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:17:42,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:42,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:42,169 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:17:42,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:42,322 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:17:42,334 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:17:42,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:42,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:42,348 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:17:42,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:42,989 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:17:42,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:43,003 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:43,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-19 16:17:43,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-19 16:17:43,004 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-19 16:17:43,005 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:17:43,005 INFO L87 Difference]: Start difference. First operand 63 states and 62 transitions. Second operand 21 states. [2018-09-19 16:17:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:49,494 INFO L93 Difference]: Finished difference Result 63 states and 62 transitions. [2018-09-19 16:17:49,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-19 16:17:49,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-09-19 16:17:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:49,496 INFO L225 Difference]: With dead ends: 63 [2018-09-19 16:17:49,496 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:17:49,498 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2018-09-19 16:17:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:17:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:17:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:17:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:17:49,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-09-19 16:17:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:49,499 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:17:49,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-19 16:17:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:17:49,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:17:49,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:17:49,681 INFO L426 ceAbstractionStarter]: For program point isnan_doubleENTRY(line 15) no Hoare annotation was computed. [2018-09-19 16:17:49,681 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 15) no Hoare annotation was computed. [2018-09-19 16:17:49,681 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 15) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point L27(lines 27 56) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point round_doubleFINAL(lines 17 64) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-19 16:17:49,682 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L429 ceAbstractionStarter]: At program point round_doubleENTRY(lines 17 64) the Hoare annotation is: true [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L28(lines 28 40) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L61-1(line 61) no Hoare annotation was computed. [2018-09-19 16:17:49,683 INFO L426 ceAbstractionStarter]: For program point L61-2(line 61) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point L61-3(line 61) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point L57-2(lines 17 64) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point round_doubleEXIT(lines 17 64) no Hoare annotation was computed. [2018-09-19 16:17:49,684 INFO L426 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-09-19 16:17:49,685 INFO L426 ceAbstractionStarter]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2018-09-19 16:17:49,685 INFO L426 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-09-19 16:17:49,685 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:17:49,685 INFO L422 ceAbstractionStarter]: At program point L20-3(lines 20 25) the Hoare annotation is: (= |round_double_#in~x| round_double_~x) [2018-09-19 16:17:49,685 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 50) no Hoare annotation was computed. [2018-09-19 16:17:49,685 INFO L426 ceAbstractionStarter]: For program point L20-4(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:17:49,685 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 56) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L58-1(line 58) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L58-2(line 58) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L58-3(line 58) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-09-19 16:17:49,686 INFO L426 ceAbstractionStarter]: For program point L21-2(line 21) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 45) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L30-2(lines 30 31) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 36) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point L69-4(lines 69 73) no Hoare annotation was computed. [2018-09-19 16:17:49,687 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 66 76) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 66 76) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 66 76) the Hoare annotation is: true [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L72-2(line 72) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L70-1(line 70) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L70-2(line 70) no Hoare annotation was computed. [2018-09-19 16:17:49,688 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2018-09-19 16:17:49,689 INFO L426 ceAbstractionStarter]: For program point L70-3(line 70) no Hoare annotation was computed. [2018-09-19 16:17:49,689 INFO L422 ceAbstractionStarter]: At program point L69-3(lines 69 73) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-19 16:17:49,689 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,689 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 16:17:49,689 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:17:49,689 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,689 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 78 96) the Hoare annotation is: true [2018-09-19 16:17:49,689 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-19 16:17:49,689 INFO L426 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-09-19 16:17:49,690 INFO L422 ceAbstractionStarter]: At program point L90-1(line 90) the Hoare annotation is: (and (exists ((v_arrayElimCell_13 (_ BitVec 32)) (|v_q#valueAsBitvector_8| (_ BitVec 64))) (and (= (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_8|) (_ bv2147483648 32)) v_arrayElimCell_13))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_8|) ((_ extract 62 52) |v_q#valueAsBitvector_8|) ((_ extract 51 0) |v_q#valueAsBitvector_8|))))) |main_#t~short10| (= main_~x~0 (fp.neg (_ +zero 11 53)))) [2018-09-19 16:17:49,690 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 78 96) no Hoare annotation was computed. [2018-09-19 16:17:49,690 INFO L426 ceAbstractionStarter]: For program point L90-2(line 90) no Hoare annotation was computed. [2018-09-19 16:17:49,690 INFO L422 ceAbstractionStarter]: At program point L87(line 87) the Hoare annotation is: (= main_~x~0 (fp.neg (_ +zero 11 53))) [2018-09-19 16:17:49,690 INFO L426 ceAbstractionStarter]: For program point L87-1(line 87) no Hoare annotation was computed. [2018-09-19 16:17:49,691 INFO L426 ceAbstractionStarter]: For program point L90-4(lines 90 93) no Hoare annotation was computed. [2018-09-19 16:17:49,691 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-09-19 16:17:49,691 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 78 96) no Hoare annotation was computed. [2018-09-19 16:17:49,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:17:49 BoogieIcfgContainer [2018-09-19 16:17:49,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:17:49,706 INFO L168 Benchmark]: Toolchain (without parser) took 18106.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -193.6 MB). Peak memory consumption was 537.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:49,708 INFO L168 Benchmark]: CDTParser took 0.23 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:17:49,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.01 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:17:49,709 INFO L168 Benchmark]: Boogie Preprocessor took 77.24 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:17:49,709 INFO L168 Benchmark]: RCFGBuilder took 888.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:49,710 INFO L168 Benchmark]: TraceAbstraction took 16763.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 557.0 MB). Peak memory consumption was 557.0 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:49,714 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.23 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 371.01 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 77.24 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 888.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16763.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 557.0 MB). Peak memory consumption was 557.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 20]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 76 locations, 1 error locations. SAFE Result, 16.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 300 SDslu, 1553 SDs, 0 SdLazy, 807 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 16 PreInvPairs, 19 NumberOfFragments, 58 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 200 ConstructedInterpolants, 110 QuantifiedInterpolants, 117603 SizeOfPredicates, 45 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...