java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:40:53,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:40:53,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:40:54,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:40:54,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:40:54,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:40:54,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:40:54,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:40:54,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:40:54,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:40:54,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:40:54,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:40:54,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:40:54,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:40:54,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:40:54,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:40:54,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:40:54,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:40:54,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:40:54,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:40:54,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:40:54,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:40:54,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:40:54,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:40:54,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:40:54,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:40:54,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:40:54,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:40:54,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:40:54,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:40:54,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:40:54,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:40:54,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:40:54,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:40:54,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:40:54,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:40:54,091 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:40:54,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:40:54,107 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:40:54,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:40:54,108 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:40:54,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:40:54,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:40:54,109 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:40:54,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:40:54,110 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:40:54,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:40:54,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:40:54,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:40:54,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:40:54,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:40:54,111 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:40:54,111 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:40:54,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:40:54,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:40:54,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:40:54,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:40:54,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:40:54,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:40:54,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:40:54,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:40:54,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:40:54,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:40:54,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:40:54,114 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:40:54,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:40:54,114 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:40:54,115 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:40:54,115 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:40:54,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:40:54,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:40:54,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:40:54,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:40:54,183 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:40:54,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c [2018-09-19 15:40:54,533 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de84fecb2/0355957288f34db4a8ec24415d75c3f4/FLAG929356ae7 [2018-09-19 15:40:54,692 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:40:54,693 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth_true-unreach-call_true-termination.c [2018-09-19 15:40:54,699 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de84fecb2/0355957288f34db4a8ec24415d75c3f4/FLAG929356ae7 [2018-09-19 15:40:54,715 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de84fecb2/0355957288f34db4a8ec24415d75c3f4 [2018-09-19 15:40:54,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:40:54,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:40:54,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:40:54,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:40:54,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:40:54,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:40:54" (1/1) ... [2018-09-19 15:40:54,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb0019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:54, skipping insertion in model container [2018-09-19 15:40:54,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:40:54" (1/1) ... [2018-09-19 15:40:54,755 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:40:54,996 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:40:55,021 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:40:55,028 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:40:55,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55 WrapperNode [2018-09-19 15:40:55,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:40:55,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:40:55,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:40:55,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:40:55,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... [2018-09-19 15:40:55,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:40:55,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:40:55,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:40:55,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:40:55,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:40:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:40:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:40:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:40:55,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:40:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:40:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:40:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:40:55,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:40:55,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:40:55,643 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:40:55,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:40:55 BoogieIcfgContainer [2018-09-19 15:40:55,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:40:55,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:40:55,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:40:55,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:40:55,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:40:54" (1/3) ... [2018-09-19 15:40:55,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1316f687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:40:55, skipping insertion in model container [2018-09-19 15:40:55,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:40:55" (2/3) ... [2018-09-19 15:40:55,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1316f687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:40:55, skipping insertion in model container [2018-09-19 15:40:55,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:40:55" (3/3) ... [2018-09-19 15:40:55,668 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth_true-unreach-call_true-termination.c [2018-09-19 15:40:55,703 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:40:55,726 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:40:55,791 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:40:55,792 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:40:55,792 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:40:55,792 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:40:55,792 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:40:55,792 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:40:55,792 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:40:55,792 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:40:55,793 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:40:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-19 15:40:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:40:55,821 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:55,822 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:55,824 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-09-19 15:40:55,835 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:55,836 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:40:55,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:55,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:55,948 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 15:40:55,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:55,961 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:55,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:40:55,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:40:55,978 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:40:55,979 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:40:55,981 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-09-19 15:40:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:56,009 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-09-19 15:40:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:40:56,011 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-19 15:40:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:56,021 INFO L225 Difference]: With dead ends: 32 [2018-09-19 15:40:56,021 INFO L226 Difference]: Without dead ends: 13 [2018-09-19 15:40:56,026 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:40:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-19 15:40:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-19 15:40:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-19 15:40:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-19 15:40:56,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-19 15:40:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:56,075 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-19 15:40:56,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:40:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-19 15:40:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:40:56,077 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:56,078 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:56,078 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-09-19 15:40:56,079 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:56,079 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 15:40:56,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:40:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:56,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:56,131 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 15:40:56,131 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:40:56,146 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:40:56,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:40:56,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:40:56,149 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:40:56,149 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:40:56,150 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-09-19 15:40:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:56,310 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-19 15:40:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:40:56,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-19 15:40:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:56,317 INFO L225 Difference]: With dead ends: 21 [2018-09-19 15:40:56,317 INFO L226 Difference]: Without dead ends: 16 [2018-09-19 15:40:56,319 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:40:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-19 15:40:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-19 15:40:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-19 15:40:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-19 15:40:56,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-09-19 15:40:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:56,324 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-19 15:40:56,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:40:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-19 15:40:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-19 15:40:56,325 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:56,325 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:56,325 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-09-19 15:40:56,326 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:56,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:40:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:40:56,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:40:56,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:40:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:40:56,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:40:56,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 15:40:56,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:40:56,529 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:40:56,529 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:40:56,529 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-09-19 15:40:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:56,760 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-09-19 15:40:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:40:56,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-09-19 15:40:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:56,767 INFO L225 Difference]: With dead ends: 29 [2018-09-19 15:40:56,767 INFO L226 Difference]: Without dead ends: 24 [2018-09-19 15:40:56,768 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-09-19 15:40:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-19 15:40:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-19 15:40:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-19 15:40:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-19 15:40:56,774 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2018-09-19 15:40:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:56,774 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-19 15:40:56,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:40:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-19 15:40:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-19 15:40:56,776 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:56,776 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:56,776 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 2 times [2018-09-19 15:40:56,777 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:56,785 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:40:56,904 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:40:56,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:40:56,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:40:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:40:57,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:40:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:40:57,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:40:57,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 15:40:57,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:40:57,565 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:40:57,565 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-09-19 15:40:57,566 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-09-19 15:40:58,518 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-09-19 15:40:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:40:59,045 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-09-19 15:40:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:40:59,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-19 15:40:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:40:59,051 INFO L225 Difference]: With dead ends: 47 [2018-09-19 15:40:59,051 INFO L226 Difference]: Without dead ends: 42 [2018-09-19 15:40:59,053 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:40:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-19 15:40:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-19 15:40:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-19 15:40:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-19 15:40:59,068 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 23 [2018-09-19 15:40:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:40:59,069 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-19 15:40:59,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:40:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-19 15:40:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 15:40:59,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:40:59,072 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:40:59,072 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:40:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1956746329, now seen corresponding path program 3 times [2018-09-19 15:40:59,075 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:40:59,075 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 15:40:59,088 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 15:40:59,568 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-09-19 15:40:59,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:40:59,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:41:00,000 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 15:41:01,444 WARN L178 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 15:41:02,784 WARN L178 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 15:41:09,835 WARN L178 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-19 15:41:24,932 WARN L178 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 15:41:32,389 WARN L178 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 19 [2018-09-19 15:41:40,828 WARN L178 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 15:41:42,864 WARN L819 $PredicateComparison]: unable to prove that (and (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-19 15:41:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 114 refuted. 12 times theorem prover too weak. 0 trivial. 29 not checked. [2018-09-19 15:41:53,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:42:04,751 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-09-19 15:42:18,184 WARN L178 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-19 15:42:53,935 WARN L178 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-19 15:42:56,843 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:00,242 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:02,282 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-19 15:43:05,554 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-19 15:43:07,601 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:09,663 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-19 15:43:11,711 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:13,770 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-19 15:43:15,823 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:17,884 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-19 15:43:19,944 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:22,017 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from false [2018-09-19 15:43:24,084 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) is different from true [2018-09-19 15:43:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 146 not checked. [2018-09-19 15:43:24,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:43:24,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-09-19 15:43:24,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-19 15:43:24,133 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-19 15:43:24,134 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=269, Unknown=26, NotChecked=378, Total=756 [2018-09-19 15:43:24,135 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 28 states. [2018-09-19 15:43:26,242 WARN L819 $PredicateComparison]: unable to prove that (and (= (_ +zero 8 24) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-19 15:43:28,315 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~time~0) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from true [2018-09-19 15:43:30,375 WARN L797 $PredicateComparison]: unable to prove that (and (= (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~time~0) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0)))) is different from false [2018-09-19 15:43:33,434 WARN L797 $PredicateComparison]: unable to prove that (and (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0)))) is different from false [2018-09-19 15:43:35,486 WARN L819 $PredicateComparison]: unable to prove that (and (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0)))) is different from true [2018-09-19 15:43:37,537 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0))) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (= (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~time~0)) is different from true [2018-09-19 15:44:24,238 WARN L178 SmtUtils]: Spent 13.73 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-09-19 15:45:14,389 WARN L178 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-09-19 15:45:17,505 WARN L819 $PredicateComparison]: unable to prove that (and (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE (fp.add RNE (fp.add RNE c_main_~time~0 c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) ((_ to_fp 11 53) RNE 1.0)))) is different from true [2018-09-19 15:45:22,049 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.add RNE c_main_~time~0 c_main_~tick~0)) (.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.eq ((_ to_fp 11 53) RNE c_main_~time~0) .cse0)) (not (fp.eq ((_ to_fp 11 53) RNE .cse1) .cse0)) (= c_main_~time~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE (_ +zero 8 24) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0) c_main_~tick~0)) (= c_main_~tick~0 (fp.div RNE ((_ to_fp 8 24) RNE 1.0) ((_ to_fp 8 24) RNE 10.0))) (not (fp.eq ((_ to_fp 11 53) RNE (fp.add RNE .cse1 c_main_~tick~0)) .cse0)))) is different from true [2018-09-19 15:45:39,042 WARN L178 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 26 Received shutdown request... [2018-09-19 15:45:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 15:45:48,187 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:45:48,192 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:45:48,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:45:48 BoogieIcfgContainer [2018-09-19 15:45:48,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:45:48,193 INFO L168 Benchmark]: Toolchain (without parser) took 293468.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -516.8 MB). Peak memory consumption was 210.4 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:48,195 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:45:48,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:48,196 INFO L168 Benchmark]: Boogie Preprocessor took 54.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:45:48,197 INFO L168 Benchmark]: RCFGBuilder took 539.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:48,198 INFO L168 Benchmark]: TraceAbstraction took 292547.52 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.6 MB). Peak memory consumption was 253.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:45:48,201 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.89 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 54.79 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 539.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 292547.52 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.6 MB). Peak memory consumption was 253.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (42states) and FLOYD_HOARE automaton (currently 13 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (36 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 292.4s OverallTime, 5 OverallIterations, 11 TraceHistogramMax, 146.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 17 SDslu, 208 SDs, 0 SdLazy, 180 SolverSat, 20 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 276.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 145.3s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 83141 SizeOfPredicates, 6 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/366 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown