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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:19:40,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:40,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:40,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:40,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:40,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:40,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:40,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:40,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:40,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:40,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:40,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:40,990 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:40,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:40,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:40,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:40,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:40,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:40,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:40,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:41,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:41,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:41,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:41,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:41,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:41,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:41,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:41,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:41,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:41,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:41,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:41,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:41,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:41,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:41,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:41,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:41,024 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:19:41,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:41,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:41,054 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:41,054 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:41,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:41,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:41,055 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:41,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:41,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:41,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:41,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:41,057 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:41,057 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:41,057 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:41,057 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:41,058 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:41,058 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:41,058 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:41,058 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:41,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:41,059 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:41,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:41,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:41,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:41,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:41,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:41,061 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:41,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:41,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:41,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:41,062 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:41,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:41,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:41,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:41,143 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:41,143 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:41,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-10-04 14:19:41,144 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-10-04 14:19:41,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:41,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:41,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:41,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:41,185 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:41,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,222 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:41,222 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:41,222 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:41,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:41,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:41,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:41,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:41,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:41,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:41,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:41,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:41,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (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-10-04 14:19:41,311 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-04 14:19:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-04 14:19:41,311 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-04 14:19:41,493 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:41,494 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:41 BoogieIcfgContainer [2018-10-04 14:19:41,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:41,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:41,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:41,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:41,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/2) ... [2018-10-04 14:19:41,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72455c33 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:41, skipping insertion in model container [2018-10-04 14:19:41,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:41" (2/2) ... [2018-10-04 14:19:41,502 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-10-04 14:19:41,510 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:41,519 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:19:41,575 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:41,576 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:41,576 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:41,577 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:41,577 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:41,577 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:41,577 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:41,577 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:41,578 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 14:19:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:19:41,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:41,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:19:41,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:41,612 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-10-04 14:19:41,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:41,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:41,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:41,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:41,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:41,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:41,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:41,902 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 14:19:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:41,995 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-04 14:19:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:41,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:19:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,015 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:19:42,015 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:19:42,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:19:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-04 14:19:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:19:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-04 14:19:42,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 3 [2018-10-04 14:19:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,062 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-04 14:19:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 14:19:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:42,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:42,064 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,064 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1953617644, now seen corresponding path program 1 times [2018-10-04 14:19:42,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:42,369 INFO L227 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:42,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 14:19:42,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:19:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:19:42,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:42,682 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-10-04 14:19:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:42,763 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-10-04 14:19:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:19:42,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:19:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,765 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:19:42,765 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:19:42,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 6 [2018-10-04 14:19:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:19:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-10-04 14:19:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:19:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-04 14:19:42,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-04 14:19:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,772 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-04 14:19:42,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:19:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-04 14:19:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:42,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:42,774 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,774 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1953558062, now seen corresponding path program 1 times [2018-10-04 14:19:42,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:42,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:42,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:42,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:42,831 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2018-10-04 14:19:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:42,850 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-10-04 14:19:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:42,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-04 14:19:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,851 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:19:42,851 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:19:42,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:19:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 14:19:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:19:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-04 14:19:42,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2018-10-04 14:19:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,857 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-04 14:19:42,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-04 14:19:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:19:42,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,858 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-04 14:19:42,858 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,858 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 72785504, now seen corresponding path program 2 times [2018-10-04 14:19:42,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:43,222 INFO L227 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 [2018-10-04 14:19:43,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:19:43,273 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:19:43,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:43,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:43,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 14:19:43,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:19:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:19:43,660 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,660 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 12 states. [2018-10-04 14:19:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:43,741 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-10-04 14:19:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:19:43,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-10-04 14:19:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:43,742 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:19:43,743 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:19:43,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 8 [2018-10-04 14:19:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:19:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-04 14:19:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:19:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-10-04 14:19:43,749 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-10-04 14:19:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:43,749 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-04 14:19:43,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:19:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-10-04 14:19:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:19:43,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:43,750 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-10-04 14:19:43,751 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:43,751 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash 491282284, now seen corresponding path program 3 times [2018-10-04 14:19:43,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:43,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:43,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:43,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:44,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:44,117 INFO L227 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:44,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:19:44,140 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:19:44,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:44,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:44,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:44,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 14:19:44,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:19:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:19:44,579 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:44,579 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 16 states. [2018-10-04 14:19:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:45,047 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-04 14:19:45,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:19:45,047 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 14:19:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:45,048 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:19:45,048 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:19:45,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 10 [2018-10-04 14:19:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:19:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-10-04 14:19:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:19:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-04 14:19:45,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-10-04 14:19:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:45,054 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-04 14:19:45,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:19:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-10-04 14:19:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:19:45,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:45,056 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-10-04 14:19:45,056 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:45,056 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1589732832, now seen corresponding path program 4 times [2018-10-04 14:19:45,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:45,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:45,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:45,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:45,285 INFO L227 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 [2018-10-04 14:19:45,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:19:45,303 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:19:45,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:45,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:45,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:45,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 14:19:45,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:19:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:19:45,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:45,772 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2018-10-04 14:19:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:46,041 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-04 14:19:46,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:19:46,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-04 14:19:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:46,044 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:19:46,045 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:19:46,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 12 [2018-10-04 14:19:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:19:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-04 14:19:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:19:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-10-04 14:19:46,051 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2018-10-04 14:19:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:46,051 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-10-04 14:19:46,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:19:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-10-04 14:19:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:19:46,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:46,052 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-10-04 14:19:46,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:46,053 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash 602818540, now seen corresponding path program 5 times [2018-10-04 14:19:46,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:46,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:46,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:46,255 INFO L227 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 [2018-10-04 14:19:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:19:46,300 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:19:46,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:46,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:47,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:47,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 14:19:47,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:19:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:19:47,240 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:47,240 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2018-10-04 14:19:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:47,439 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-10-04 14:19:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:19:47,440 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-10-04 14:19:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:47,441 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:19:47,441 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 14:19:47,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 14 [2018-10-04 14:19:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 14:19:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-10-04 14:19:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:19:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-10-04 14:19:47,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 28 [2018-10-04 14:19:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:47,448 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-04 14:19:47,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:19:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-10-04 14:19:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:19:47,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:47,449 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-10-04 14:19:47,449 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:47,449 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1979239776, now seen corresponding path program 6 times [2018-10-04 14:19:47,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:47,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:47,671 INFO L227 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 [2018-10-04 14:19:47,681 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:19:47,698 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:19:47,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:47,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:48,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:48,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 14:19:48,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:19:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:19:48,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:48,506 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 28 states. [2018-10-04 14:19:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:48,658 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-10-04 14:19:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:19:48,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-10-04 14:19:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:48,661 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:19:48,661 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:19:48,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 16 [2018-10-04 14:19:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:19:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-04 14:19:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:19:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-10-04 14:19:48,668 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 33 [2018-10-04 14:19:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:48,668 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-04 14:19:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:19:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-10-04 14:19:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:19:48,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:48,670 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-10-04 14:19:48,670 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:48,670 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:48,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1800695700, now seen corresponding path program 7 times [2018-10-04 14:19:48,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:48,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:48,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:48,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:48,906 INFO L227 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 [2018-10-04 14:19:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:48,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:49,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:49,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 14:19:49,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:19:49,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:19:49,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:49,485 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 32 states. [2018-10-04 14:19:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:49,726 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-10-04 14:19:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:19:49,727 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-10-04 14:19:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:49,728 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:19:49,728 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 14:19:49,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 18 [2018-10-04 14:19:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 14:19:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 14:19:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:19:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-10-04 14:19:49,736 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 38 [2018-10-04 14:19:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:49,737 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-10-04 14:19:49,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:19:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-10-04 14:19:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:19:49,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:49,739 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-10-04 14:19:49,740 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:49,740 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1430989600, now seen corresponding path program 8 times [2018-10-04 14:19:49,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:49,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:49,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:50,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:50,055 INFO L227 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:50,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:19:50,077 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:19:50,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:50,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:50,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:50,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 14:19:50,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:19:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:19:50,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:50,650 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 36 states. [2018-10-04 14:19:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:50,846 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-10-04 14:19:50,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:19:50,847 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-10-04 14:19:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:50,848 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:19:50,848 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:19:50,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 20 [2018-10-04 14:19:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:19:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-04 14:19:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 14:19:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-10-04 14:19:50,855 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 43 [2018-10-04 14:19:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:50,855 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-10-04 14:19:50,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:19:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-10-04 14:19:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:19:50,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:50,857 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-10-04 14:19:50,857 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:50,857 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1043842836, now seen corresponding path program 9 times [2018-10-04 14:19:50,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:50,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:50,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:50,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:51,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:51,365 INFO L227 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 [2018-10-04 14:19:51,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:19:51,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 14:19:51,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:51,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:52,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:52,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 14:19:52,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:19:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:19:52,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:52,513 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 40 states. [2018-10-04 14:19:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:52,683 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-10-04 14:19:52,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:19:52,684 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2018-10-04 14:19:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:52,685 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:19:52,686 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 14:19:52,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime 22 [2018-10-04 14:19:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 14:19:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-10-04 14:19:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 14:19:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-10-04 14:19:52,692 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2018-10-04 14:19:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:52,692 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-10-04 14:19:52,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:19:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-10-04 14:19:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 14:19:52,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:52,694 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-10-04 14:19:52,694 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:52,694 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash -676496288, now seen corresponding path program 10 times [2018-10-04 14:19:52,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:52,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:53,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:53,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:19:53,697 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:19:53,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:19:53,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:54,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:54,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 14:19:54,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:19:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:19:54,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:54,525 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 44 states. [2018-10-04 14:19:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:54,766 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-10-04 14:19:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:19:54,766 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-10-04 14:19:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:54,767 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:19:54,767 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:19:54,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 24 [2018-10-04 14:19:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:19:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-10-04 14:19:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:19:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-10-04 14:19:54,774 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 53 [2018-10-04 14:19:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:54,774 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-10-04 14:19:54,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:19:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-10-04 14:19:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:19:54,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:54,776 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-10-04 14:19:54,776 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:54,776 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1014218388, now seen corresponding path program 11 times [2018-10-04 14:19:54,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:54,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 14:19:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 14:19:54,819 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 14:19:54,857 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:19:54 BoogieIcfgContainer [2018-10-04 14:19:54,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:19:54,858 INFO L168 Benchmark]: Toolchain (without parser) took 13675.41 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 370.3 MB). Peak memory consumption was 396.5 MB. Max. memory is 7.1 GB. [2018-10-04 14:19:54,860 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:19:54,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:19:54,862 INFO L168 Benchmark]: Boogie Preprocessor took 22.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:19:54,862 INFO L168 Benchmark]: RCFGBuilder took 245.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:19:54,863 INFO L168 Benchmark]: TraceAbstraction took 13362.50 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 349.2 MB). Peak memory consumption was 375.4 MB. Max. memory is 7.1 GB. [2018-10-04 14:19:54,868 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 245.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13362.50 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 349.2 MB). Peak memory consumption was 375.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 35]: assertion can be violated assertion can be violated We found a FailurePath: [L15] one := 1; [L16] maxGatePosition := 100 * one; [L17] thousand := 1000 * one; [L20] gate := 0; [L21] time := 0; [L22] alarm := false; VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L24] COND TRUE time < thousand VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0] [L28] havoc time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L32] time := time + time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L24] COND TRUE time < thousand VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=10] [L32] time := time + time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L24] COND FALSE !(time < thousand) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L35] assert alarm || gate == maxGatePosition; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 13.2s OverallTime, 13 OverallIterations, 11 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 810 SDslu, 759 SDs, 0 SdLazy, 777 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=12, 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, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 599 ConstructedInterpolants, 285 QuantifiedInterpolants, 207721 SizeOfPredicates, 85 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1761 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-19-54-881.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-19-54-881.csv Received shutdown request...