java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-benchs/drift_tenth.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:10:42,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:10:42,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:10:42,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:10:42,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:10:42,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:10:42,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:10:42,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:10:42,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:10:42,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:10:42,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:10:42,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:10:42,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:10:42,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:10:42,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:10:42,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:10:42,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:10:42,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:10:42,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:10:42,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:10:42,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:10:42,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:10:42,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:10:42,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:10:42,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:10:42,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:10:42,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:10:42,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:10:42,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:10:42,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:10:42,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:10:42,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:10:42,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:10:42,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:10:42,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:10:42,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:10:42,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:10:42,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:10:42,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:10:42,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:10:42,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:10:42,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:10:42,109 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:10:42,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:10:42,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:10:42,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:10:42,111 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:10:42,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:10:42,112 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:10:42,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:10:42,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:10:42,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:10:42,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:10:42,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:10:42,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:10:42,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:10:42,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:10:42,113 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:10:42,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:10:42,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:10:42,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:10:42,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:10:42,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:10:42,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:42,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:10:42,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:10:42,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:10:42,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:10:42,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:10:42,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:10:42,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:10:42,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:10:42,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:10:42,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:10:42,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:10:42,178 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:10:42,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth.c [2019-09-08 01:10:42,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70868e725/7d098feee3b54d40afa905c9e9f051d7/FLAGef02e353c [2019-09-08 01:10:42,699 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:10:42,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c [2019-09-08 01:10:42,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70868e725/7d098feee3b54d40afa905c9e9f051d7/FLAGef02e353c [2019-09-08 01:10:43,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70868e725/7d098feee3b54d40afa905c9e9f051d7 [2019-09-08 01:10:43,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:10:43,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:10:43,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:43,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:10:43,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:10:43,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40236e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43, skipping insertion in model container [2019-09-08 01:10:43,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,098 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:10:43,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:10:43,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:43,280 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:10:43,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:43,315 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:10:43,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43 WrapperNode [2019-09-08 01:10:43,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:43,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:10:43,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:10:43,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:10:43,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (1/1) ... [2019-09-08 01:10:43,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:10:43,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:10:43,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:10:43,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:10:43,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (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 [2019-09-08 01:10:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:10:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:10:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 01:10:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:10:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:10:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:10:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:10:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:10:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:10:43,650 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:10:43,651 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 01:10:43,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:43 BoogieIcfgContainer [2019-09-08 01:10:43,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:10:43,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:10:43,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:10:43,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:10:43,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:43" (1/3) ... [2019-09-08 01:10:43,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6489b674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:43, skipping insertion in model container [2019-09-08 01:10:43,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:43" (2/3) ... [2019-09-08 01:10:43,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6489b674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:43, skipping insertion in model container [2019-09-08 01:10:43,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:43" (3/3) ... [2019-09-08 01:10:43,660 INFO L109 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2019-09-08 01:10:43,669 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:10:43,675 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:10:43,688 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:10:43,716 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:10:43,717 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:10:43,717 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:10:43,717 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:10:43,717 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:10:43,717 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:10:43,718 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:10:43,718 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:10:43,718 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:10:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-08 01:10:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:43,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:43,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:43,741 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2019-09-08 01:10:43,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:43,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:43,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:43,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:10:43,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:10:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:10:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:43,862 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-08 01:10:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:43,884 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-08 01:10:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:10:43,885 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 01:10:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:43,893 INFO L225 Difference]: With dead ends: 31 [2019-09-08 01:10:43,894 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 01:10:43,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 01:10:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 01:10:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 01:10:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-08 01:10:43,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-08 01:10:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:43,933 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-08 01:10:43,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:10:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-08 01:10:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:43,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:43,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:43,935 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2019-09-08 01:10:43,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:43,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:43,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:43,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:44,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:10:44,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:10:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:10:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:44,006 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-08 01:10:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,028 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-08 01:10:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:10:44,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 01:10:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,030 INFO L225 Difference]: With dead ends: 19 [2019-09-08 01:10:44,031 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 01:10:44,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 01:10:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-08 01:10:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 01:10:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-08 01:10:44,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-08 01:10:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,051 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-08 01:10:44,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:10:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-08 01:10:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 01:10:44,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,053 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2019-09-08 01:10:44,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:44,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:10:44,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:10:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:10:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:44,182 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-08 01:10:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,219 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-08 01:10:44,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:10:44,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 01:10:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,222 INFO L225 Difference]: With dead ends: 21 [2019-09-08 01:10:44,223 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 01:10:44,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 01:10:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-08 01:10:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 01:10:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 01:10:44,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-08 01:10:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,229 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 01:10:44,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:10:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 01:10:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:10:44,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,231 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,231 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2019-09-08 01:10:44,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:44,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:44,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:10:44,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:10:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:10:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:44,338 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-08 01:10:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,363 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-08 01:10:44,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:10:44,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 01:10:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,364 INFO L225 Difference]: With dead ends: 23 [2019-09-08 01:10:44,365 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 01:10:44,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 01:10:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-08 01:10:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 01:10:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 01:10:44,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-08 01:10:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,371 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 01:10:44,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:10:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 01:10:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:10:44,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,372 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,372 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2019-09-08 01:10:44,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:44,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:10:44,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:10:44,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:10:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:10:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:44,472 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-08 01:10:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,516 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-08 01:10:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:10:44,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-08 01:10:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,518 INFO L225 Difference]: With dead ends: 25 [2019-09-08 01:10:44,518 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:10:44,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:10:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-08 01:10:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 01:10:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 01:10:44,526 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-08 01:10:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,526 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 01:10:44,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:10:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 01:10:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:10:44,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,529 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,530 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 4 times [2019-09-08 01:10:44,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:44,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:44,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:10:44,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:44,654 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-08 01:10:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,698 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-08 01:10:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:44,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-08 01:10:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,702 INFO L225 Difference]: With dead ends: 27 [2019-09-08 01:10:44,702 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:10:44,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:10:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 01:10:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:10:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-08 01:10:44,713 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-08 01:10:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,714 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-08 01:10:44,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-08 01:10:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:10:44,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,718 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,719 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1246537969, now seen corresponding path program 5 times [2019-09-08 01:10:44,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,851 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:44,866 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:10:44,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:10:44,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:10:44,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:10:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:44,901 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-08 01:10:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,959 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-08 01:10:44,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:10:44,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-08 01:10:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,961 INFO L225 Difference]: With dead ends: 29 [2019-09-08 01:10:44,962 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:10:44,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:10:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 01:10:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:10:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 01:10:44,971 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-08 01:10:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,972 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 01:10:44,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:10:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 01:10:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:10:44,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,973 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,973 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 762473391, now seen corresponding path program 6 times [2019-09-08 01:10:44,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:45,099 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:10:45,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:45,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:10:45,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:10:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:10:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:45,132 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-08 01:10:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:45,179 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-08 01:10:45,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:10:45,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-08 01:10:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:45,183 INFO L225 Difference]: With dead ends: 31 [2019-09-08 01:10:45,183 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 01:10:45,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 01:10:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 01:10:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 01:10:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 01:10:45,191 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-08 01:10:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:45,192 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 01:10:45,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:10:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 01:10:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:10:45,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:45,193 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:45,194 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash -567118099, now seen corresponding path program 7 times [2019-09-08 01:10:45,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:10:45,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:10:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:10:45,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:45,352 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-08 01:10:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:45,401 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-08 01:10:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:10:45,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-08 01:10:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:45,406 INFO L225 Difference]: With dead ends: 33 [2019-09-08 01:10:45,406 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:10:45,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:10:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 01:10:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:10:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 01:10:45,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-08 01:10:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:45,420 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 01:10:45,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:10:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 01:10:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:10:45,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:45,422 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:45,425 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1595714219, now seen corresponding path program 8 times [2019-09-08 01:10:45,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:45,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:45,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:45,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:45,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:10:45,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:10:45,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:10:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:45,617 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-08 01:10:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:45,659 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-08 01:10:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:10:45,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-08 01:10:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:45,660 INFO L225 Difference]: With dead ends: 35 [2019-09-08 01:10:45,660 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:10:45,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:10:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 01:10:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:10:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 01:10:45,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-08 01:10:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:45,666 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 01:10:45,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:10:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 01:10:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:10:45,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:45,667 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:45,667 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:45,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400553, now seen corresponding path program 9 times [2019-09-08 01:10:45,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:45,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:10:45,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:45,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:10:45,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:45,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:10:45,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:10:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:10:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:45,838 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-08 01:10:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:45,875 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-08 01:10:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:10:45,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-08 01:10:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:45,877 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:10:45,877 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 01:10:45,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 01:10:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-08 01:10:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:10:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 01:10:45,883 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-08 01:10:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:45,883 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 01:10:45,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:10:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 01:10:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:10:45,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:45,885 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:45,885 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 10 times [2019-09-08 01:10:45,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:45,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:45,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:45,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:10:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:10:45,922 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:10:45,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:10:45 BoogieIcfgContainer [2019-09-08 01:10:45,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:10:45,951 INFO L168 Benchmark]: Toolchain (without parser) took 2868.05 ms. Allocated memory was 135.8 MB in the beginning and 231.7 MB in the end (delta: 95.9 MB). Free memory was 92.5 MB in the beginning and 92.0 MB in the end (delta: 484.4 kB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:45,952 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:10:45,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.32 ms. Allocated memory is still 135.8 MB. Free memory was 92.2 MB in the beginning and 83.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:45,953 INFO L168 Benchmark]: Boogie Preprocessor took 123.48 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 83.1 MB in the beginning and 179.0 MB in the end (delta: -95.9 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:45,954 INFO L168 Benchmark]: RCFGBuilder took 211.37 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 168.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:45,955 INFO L168 Benchmark]: TraceAbstraction took 2295.58 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 168.2 MB in the beginning and 92.0 MB in the end (delta: 76.3 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:45,959 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.32 ms. Allocated memory is still 135.8 MB. Free memory was 92.2 MB in the beginning and 83.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.48 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 83.1 MB in the beginning and 179.0 MB in the end (delta: -95.9 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 211.37 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 168.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2295.58 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 168.2 MB in the beginning and 92.0 MB in the end (delta: 76.3 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 13. Possible FailurePath: [L8] float tick = 1.f / 10.f; [L9] float time = 0.f; [L10] int i; [L12] i = 0 VAL [i=0, time=0] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=0] [L12] i++ VAL [i=1] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=1] [L12] i++ VAL [i=2] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=2] [L12] i++ VAL [i=3] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=3] [L12] i++ VAL [i=4] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=4] [L12] i++ VAL [i=5] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=5] [L12] i++ VAL [i=6] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=6] [L12] i++ VAL [i=7] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=7] [L12] i++ VAL [i=8] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=8] [L12] i++ VAL [i=9] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=9] [L12] i++ VAL [i=10] [L12] COND FALSE !(i < 10) VAL [i=10] [L15] CALL __VERIFIER_assert(time != 1.0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 2.2s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 55 SDslu, 328 SDs, 0 SdLazy, 170 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=11, 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, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 15642 SizeOfPredicates, 9 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...