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/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:53,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:53,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:53,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:53,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:53,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:53,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:53,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:53,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:53,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:53,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:53,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:53,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:53,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:53,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:53,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:53,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:53,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:53,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:53,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:53,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:53,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:53,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:53,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:53,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:53,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:53,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:53,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:53,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:53,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:53,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:53,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:53,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:53,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:53,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:53,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:53,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:53,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:53,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:53,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:53,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:53,108 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-10-13 19:14:53,122 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:53,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:53,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:53,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:53,124 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:53,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:53,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:53,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:53,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:53,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:53,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:53,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:53,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:53,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:53,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:53,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:53,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:53,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:53,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:53,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:53,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:53,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:53,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:53,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:53,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:53,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:53,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:53,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:53,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:53,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:53,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:53,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:53,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:53,428 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:53,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-13 19:14:53,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c393517a1/ff790dc464a14fbaaa387b4175efc3ce/FLAG8c029c353 [2019-10-13 19:14:53,926 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:53,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-13 19:14:53,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c393517a1/ff790dc464a14fbaaa387b4175efc3ce/FLAG8c029c353 [2019-10-13 19:14:54,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c393517a1/ff790dc464a14fbaaa387b4175efc3ce [2019-10-13 19:14:54,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:54,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:54,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:54,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:54,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:54,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235c31ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54, skipping insertion in model container [2019-10-13 19:14:54,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,296 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:54,318 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:54,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:54,571 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:54,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:54,633 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:54,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54 WrapperNode [2019-10-13 19:14:54,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:54,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:54,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:54,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:54,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (1/1) ... [2019-10-13 19:14:54,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:54,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:54,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:54,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:54,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (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-10-13 19:14:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:54,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:54,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:55,084 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:55,084 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:55,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:55 BoogieIcfgContainer [2019-10-13 19:14:55,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:55,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:55,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:55,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:55,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:54" (1/3) ... [2019-10-13 19:14:55,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455b92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:55, skipping insertion in model container [2019-10-13 19:14:55,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:54" (2/3) ... [2019-10-13 19:14:55,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455b92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:55, skipping insertion in model container [2019-10-13 19:14:55,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:55" (3/3) ... [2019-10-13 19:14:55,094 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-13 19:14:55,116 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:55,131 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:55,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:55,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:55,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:55,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:55,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:55,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:55,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:55,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:55,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-13 19:14:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:55,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,204 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:55,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-10-13 19:14:55,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360436253] [2019-10-13 19:14:55,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360436253] [2019-10-13 19:14:55,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675538682] [2019-10-13 19:14:55,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,439 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-13 19:14:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,503 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2019-10-13 19:14:55,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,517 INFO L225 Difference]: With dead ends: 81 [2019-10-13 19:14:55,517 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:14:55,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:14:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-13 19:14:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:14:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-10-13 19:14:55,564 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-10-13 19:14:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,565 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-10-13 19:14:55,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-10-13 19:14:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:55,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:55,568 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-10-13 19:14:55,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730200066] [2019-10-13 19:14:55,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730200066] [2019-10-13 19:14:55,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098792405] [2019-10-13 19:14:55,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,645 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-10-13 19:14:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,693 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2019-10-13 19:14:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,695 INFO L225 Difference]: With dead ends: 107 [2019-10-13 19:14:55,696 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:14:55,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:14:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-13 19:14:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 19:14:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-10-13 19:14:55,708 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-10-13 19:14:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,709 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-10-13 19:14:55,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-10-13 19:14:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:55,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:55,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,711 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-10-13 19:14:55,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350527565] [2019-10-13 19:14:55,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350527565] [2019-10-13 19:14:55,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582240996] [2019-10-13 19:14:55,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,770 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-10-13 19:14:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,808 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2019-10-13 19:14:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,810 INFO L225 Difference]: With dead ends: 99 [2019-10-13 19:14:55,810 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 19:14:55,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 19:14:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-13 19:14:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 19:14:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-10-13 19:14:55,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-10-13 19:14:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,823 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-10-13 19:14:55,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-10-13 19:14:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:55,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,824 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:55,825 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-10-13 19:14:55,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091652212] [2019-10-13 19:14:55,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091652212] [2019-10-13 19:14:55,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050492042] [2019-10-13 19:14:55,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,878 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-10-13 19:14:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,901 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2019-10-13 19:14:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,903 INFO L225 Difference]: With dead ends: 124 [2019-10-13 19:14:55,904 INFO L226 Difference]: Without dead ends: 122 [2019-10-13 19:14:55,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-13 19:14:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-10-13 19:14:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 19:14:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-10-13 19:14:55,919 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-10-13 19:14:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,920 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-10-13 19:14:55,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-10-13 19:14:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:55,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:55,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-10-13 19:14:55,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202456894] [2019-10-13 19:14:55,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202456894] [2019-10-13 19:14:55,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452736714] [2019-10-13 19:14:55,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,965 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-10-13 19:14:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,002 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2019-10-13 19:14:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,004 INFO L225 Difference]: With dead ends: 204 [2019-10-13 19:14:56,005 INFO L226 Difference]: Without dead ends: 124 [2019-10-13 19:14:56,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-13 19:14:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-13 19:14:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-13 19:14:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-10-13 19:14:56,024 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-10-13 19:14:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,025 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-10-13 19:14:56,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-10-13 19:14:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:56,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,029 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-10-13 19:14:56,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261688059] [2019-10-13 19:14:56,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261688059] [2019-10-13 19:14:56,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005174987] [2019-10-13 19:14:56,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,080 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-10-13 19:14:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,105 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2019-10-13 19:14:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,107 INFO L225 Difference]: With dead ends: 183 [2019-10-13 19:14:56,107 INFO L226 Difference]: Without dead ends: 126 [2019-10-13 19:14:56,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-13 19:14:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-13 19:14:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-13 19:14:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-10-13 19:14:56,120 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-10-13 19:14:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,120 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-10-13 19:14:56,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-10-13 19:14:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:56,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-10-13 19:14:56,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598979482] [2019-10-13 19:14:56,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598979482] [2019-10-13 19:14:56,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738834] [2019-10-13 19:14:56,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,172 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-10-13 19:14:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,191 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2019-10-13 19:14:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,193 INFO L225 Difference]: With dead ends: 228 [2019-10-13 19:14:56,194 INFO L226 Difference]: Without dead ends: 226 [2019-10-13 19:14:56,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-13 19:14:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-10-13 19:14:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-13 19:14:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-10-13 19:14:56,213 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-10-13 19:14:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,213 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-10-13 19:14:56,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-10-13 19:14:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:56,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,228 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,228 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-10-13 19:14:56,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620521909] [2019-10-13 19:14:56,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620521909] [2019-10-13 19:14:56,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966984297] [2019-10-13 19:14:56,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,274 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-10-13 19:14:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,306 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2019-10-13 19:14:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,309 INFO L225 Difference]: With dead ends: 392 [2019-10-13 19:14:56,309 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 19:14:56,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 19:14:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-13 19:14:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 19:14:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-10-13 19:14:56,322 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-10-13 19:14:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,323 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-10-13 19:14:56,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-10-13 19:14:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:56,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,325 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,325 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-10-13 19:14:56,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317720329] [2019-10-13 19:14:56,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317720329] [2019-10-13 19:14:56,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625149335] [2019-10-13 19:14:56,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,372 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-10-13 19:14:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,394 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2019-10-13 19:14:56,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,396 INFO L225 Difference]: With dead ends: 348 [2019-10-13 19:14:56,396 INFO L226 Difference]: Without dead ends: 238 [2019-10-13 19:14:56,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-13 19:14:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-10-13 19:14:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-13 19:14:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-10-13 19:14:56,407 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-10-13 19:14:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,408 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-10-13 19:14:56,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-10-13 19:14:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:56,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,410 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-10-13 19:14:56,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732879705] [2019-10-13 19:14:56,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732879705] [2019-10-13 19:14:56,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648668575] [2019-10-13 19:14:56,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,462 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-10-13 19:14:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,500 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2019-10-13 19:14:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,506 INFO L225 Difference]: With dead ends: 428 [2019-10-13 19:14:56,506 INFO L226 Difference]: Without dead ends: 426 [2019-10-13 19:14:56,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-13 19:14:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-10-13 19:14:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-13 19:14:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-10-13 19:14:56,527 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-10-13 19:14:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,529 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-10-13 19:14:56,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-10-13 19:14:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:56,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,533 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,533 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-10-13 19:14:56,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023754200] [2019-10-13 19:14:56,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023754200] [2019-10-13 19:14:56,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362141955] [2019-10-13 19:14:56,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,579 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-10-13 19:14:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,611 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2019-10-13 19:14:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,614 INFO L225 Difference]: With dead ends: 764 [2019-10-13 19:14:56,614 INFO L226 Difference]: Without dead ends: 450 [2019-10-13 19:14:56,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-13 19:14:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-10-13 19:14:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-13 19:14:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-10-13 19:14:56,632 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-10-13 19:14:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,632 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-10-13 19:14:56,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-10-13 19:14:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:56,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,634 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,634 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-10-13 19:14:56,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081959541] [2019-10-13 19:14:56,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081959541] [2019-10-13 19:14:56,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726390472] [2019-10-13 19:14:56,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,674 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-10-13 19:14:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,698 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2019-10-13 19:14:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,701 INFO L225 Difference]: With dead ends: 672 [2019-10-13 19:14:56,702 INFO L226 Difference]: Without dead ends: 458 [2019-10-13 19:14:56,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-13 19:14:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-10-13 19:14:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 19:14:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-10-13 19:14:56,717 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-10-13 19:14:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,718 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-10-13 19:14:56,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-10-13 19:14:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:56,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,719 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-10-13 19:14:56,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529731405] [2019-10-13 19:14:56,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529731405] [2019-10-13 19:14:56,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632631900] [2019-10-13 19:14:56,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,751 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-10-13 19:14:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,772 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2019-10-13 19:14:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,778 INFO L225 Difference]: With dead ends: 812 [2019-10-13 19:14:56,778 INFO L226 Difference]: Without dead ends: 810 [2019-10-13 19:14:56,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-13 19:14:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-10-13 19:14:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-13 19:14:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-10-13 19:14:56,800 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-10-13 19:14:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,801 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-10-13 19:14:56,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-10-13 19:14:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:56,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,803 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-10-13 19:14:56,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835315042] [2019-10-13 19:14:56,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835315042] [2019-10-13 19:14:56,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969801845] [2019-10-13 19:14:56,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,855 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-10-13 19:14:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,888 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2019-10-13 19:14:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,893 INFO L225 Difference]: With dead ends: 1500 [2019-10-13 19:14:56,893 INFO L226 Difference]: Without dead ends: 874 [2019-10-13 19:14:56,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-13 19:14:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-10-13 19:14:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-13 19:14:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-10-13 19:14:56,923 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-10-13 19:14:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,923 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-10-13 19:14:56,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-10-13 19:14:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:56,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:56,926 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,926 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-10-13 19:14:56,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326417641] [2019-10-13 19:14:56,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:56,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326417641] [2019-10-13 19:14:56,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546229389] [2019-10-13 19:14:56,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,956 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-10-13 19:14:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,986 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2019-10-13 19:14:56,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,991 INFO L225 Difference]: With dead ends: 1308 [2019-10-13 19:14:56,992 INFO L226 Difference]: Without dead ends: 890 [2019-10-13 19:14:56,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-10-13 19:14:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-10-13 19:14:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-13 19:14:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-10-13 19:14:57,027 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-10-13 19:14:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,027 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-10-13 19:14:57,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-10-13 19:14:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:57,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:57,030 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-10-13 19:14:57,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458510879] [2019-10-13 19:14:57,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:57,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458510879] [2019-10-13 19:14:57,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438892107] [2019-10-13 19:14:57,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,065 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-10-13 19:14:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,150 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2019-10-13 19:14:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,159 INFO L225 Difference]: With dead ends: 1548 [2019-10-13 19:14:57,160 INFO L226 Difference]: Without dead ends: 1546 [2019-10-13 19:14:57,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-13 19:14:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-10-13 19:14:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-13 19:14:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-10-13 19:14:57,213 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-10-13 19:14:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,214 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-10-13 19:14:57,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-10-13 19:14:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:57,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:57,217 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-10-13 19:14:57,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161743305] [2019-10-13 19:14:57,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:57,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161743305] [2019-10-13 19:14:57,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343758399] [2019-10-13 19:14:57,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,260 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-10-13 19:14:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,314 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2019-10-13 19:14:57,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,326 INFO L225 Difference]: With dead ends: 2956 [2019-10-13 19:14:57,326 INFO L226 Difference]: Without dead ends: 1706 [2019-10-13 19:14:57,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-10-13 19:14:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-10-13 19:14:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-13 19:14:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-10-13 19:14:57,399 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-10-13 19:14:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,400 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-10-13 19:14:57,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-10-13 19:14:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:57,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:57,403 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-10-13 19:14:57,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130070799] [2019-10-13 19:14:57,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:57,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130070799] [2019-10-13 19:14:57,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733504526] [2019-10-13 19:14:57,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,434 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-10-13 19:14:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,477 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2019-10-13 19:14:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,486 INFO L225 Difference]: With dead ends: 2556 [2019-10-13 19:14:57,487 INFO L226 Difference]: Without dead ends: 1738 [2019-10-13 19:14:57,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-13 19:14:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-10-13 19:14:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-10-13 19:14:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-10-13 19:14:57,540 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-10-13 19:14:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,540 INFO L462 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-10-13 19:14:57,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-10-13 19:14:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:57,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,544 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:57,544 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,544 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-10-13 19:14:57,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729312119] [2019-10-13 19:14:57,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:57,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729312119] [2019-10-13 19:14:57,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600155051] [2019-10-13 19:14:57,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,570 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-10-13 19:14:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,624 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2019-10-13 19:14:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,638 INFO L225 Difference]: With dead ends: 2956 [2019-10-13 19:14:57,638 INFO L226 Difference]: Without dead ends: 2954 [2019-10-13 19:14:57,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-13 19:14:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-10-13 19:14:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-13 19:14:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-10-13 19:14:57,709 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-10-13 19:14:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,709 INFO L462 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-10-13 19:14:57,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-10-13 19:14:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:57,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:57,731 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-10-13 19:14:57,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3865178] [2019-10-13 19:14:57,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:57,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3865178] [2019-10-13 19:14:57,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469883527] [2019-10-13 19:14:57,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,765 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-10-13 19:14:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,857 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2019-10-13 19:14:57,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,872 INFO L225 Difference]: With dead ends: 5836 [2019-10-13 19:14:57,872 INFO L226 Difference]: Without dead ends: 3338 [2019-10-13 19:14:57,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-13 19:14:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-10-13 19:14:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-13 19:14:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-10-13 19:14:57,969 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-10-13 19:14:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,969 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-10-13 19:14:57,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-10-13 19:14:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:57,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:57,974 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-10-13 19:14:57,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219462683] [2019-10-13 19:14:57,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:58,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219462683] [2019-10-13 19:14:58,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:58,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:58,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488159138] [2019-10-13 19:14:58,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:58,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:58,004 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-10-13 19:14:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:58,069 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2019-10-13 19:14:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:58,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:58,084 INFO L225 Difference]: With dead ends: 5004 [2019-10-13 19:14:58,084 INFO L226 Difference]: Without dead ends: 3402 [2019-10-13 19:14:58,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-10-13 19:14:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-10-13 19:14:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-10-13 19:14:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-10-13 19:14:58,186 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-10-13 19:14:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:58,186 INFO L462 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-10-13 19:14:58,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-10-13 19:14:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:58,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:58,191 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:58,191 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-10-13 19:14:58,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:58,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071345508] [2019-10-13 19:14:58,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:58,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:58,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:58,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071345508] [2019-10-13 19:14:58,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:58,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:58,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659713051] [2019-10-13 19:14:58,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:58,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:58,246 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-10-13 19:14:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:58,356 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2019-10-13 19:14:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:58,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:58,408 INFO L225 Difference]: With dead ends: 9804 [2019-10-13 19:14:58,410 INFO L226 Difference]: Without dead ends: 6538 [2019-10-13 19:14:58,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-10-13 19:14:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-10-13 19:14:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-13 19:14:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-10-13 19:14:58,618 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-10-13 19:14:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:58,618 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-10-13 19:14:58,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-10-13 19:14:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:58,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:58,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:58,628 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:58,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-10-13 19:14:58,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:58,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353047307] [2019-10-13 19:14:58,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:58,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:58,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:58,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353047307] [2019-10-13 19:14:58,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:58,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:58,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605541754] [2019-10-13 19:14:58,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:58,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:58,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:58,658 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-10-13 19:14:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:58,776 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2019-10-13 19:14:58,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:58,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:58,792 INFO L225 Difference]: With dead ends: 7052 [2019-10-13 19:14:58,792 INFO L226 Difference]: Without dead ends: 7050 [2019-10-13 19:14:58,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-10-13 19:14:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-10-13 19:14:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-13 19:14:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-10-13 19:14:58,997 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-10-13 19:14:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:58,997 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-10-13 19:14:58,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-10-13 19:14:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:59,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:59,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:59,011 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-10-13 19:14:59,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:59,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366340667] [2019-10-13 19:14:59,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:59,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366340667] [2019-10-13 19:14:59,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:59,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:59,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311290481] [2019-10-13 19:14:59,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:59,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:59,032 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-10-13 19:14:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:59,169 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2019-10-13 19:14:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:59,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:59,188 INFO L225 Difference]: With dead ends: 10634 [2019-10-13 19:14:59,188 INFO L226 Difference]: Without dead ends: 10632 [2019-10-13 19:14:59,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-10-13 19:14:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-10-13 19:14:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-10-13 19:14:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-10-13 19:14:59,470 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-10-13 19:14:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:59,471 INFO L462 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-10-13 19:14:59,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-10-13 19:14:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:59,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:59,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:59,488 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-10-13 19:14:59,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:59,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006709035] [2019-10-13 19:14:59,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:59,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006709035] [2019-10-13 19:14:59,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:59,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:59,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418515941] [2019-10-13 19:14:59,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:59,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:59,514 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-10-13 19:14:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:59,711 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2019-10-13 19:14:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:59,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:59,712 INFO L225 Difference]: With dead ends: 22664 [2019-10-13 19:14:59,712 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:59,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:59,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-13 19:14:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:59,749 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:59,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:59,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:59,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:59,775 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:59,775 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:59,775 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:59,776 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,776 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-13 19:14:59,777 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,777 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-10-13 19:14:59,777 INFO L443 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,778 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,778 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-13 19:14:59,778 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-13 19:14:59,779 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-13 19:14:59,779 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,779 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-13 19:14:59,779 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,779 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-13 19:14:59,779 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-13 19:14:59,779 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-13 19:14:59,780 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,780 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,780 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,780 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-13 19:14:59,780 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,780 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-13 19:14:59,780 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,781 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-13 19:14:59,781 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-13 19:14:59,781 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-13 19:14:59,781 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,781 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,781 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-13 19:14:59,781 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-13 19:14:59,782 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,782 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 19:14:59,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:59 BoogieIcfgContainer [2019-10-13 19:14:59,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:59,795 INFO L168 Benchmark]: Toolchain (without parser) took 5517.25 ms. Allocated memory was 138.4 MB in the beginning and 341.8 MB in the end (delta: 203.4 MB). Free memory was 103.2 MB in the beginning and 152.6 MB in the end (delta: -49.4 MB). Peak memory consumption was 154.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:59,797 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:59,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.93 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:59,802 INFO L168 Benchmark]: Boogie Preprocessor took 126.84 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 92.4 MB in the beginning and 179.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:59,807 INFO L168 Benchmark]: RCFGBuilder took 325.16 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 160.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:59,808 INFO L168 Benchmark]: TraceAbstraction took 4704.84 ms. Allocated memory was 201.3 MB in the beginning and 341.8 MB in the end (delta: 140.5 MB). Free memory was 160.9 MB in the beginning and 152.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:59,813 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.74 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.93 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.84 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 92.4 MB in the beginning and 179.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.16 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 160.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4704.84 ms. Allocated memory was 201.3 MB in the beginning and 341.8 MB in the end (delta: 140.5 MB). Free memory was 160.9 MB in the beginning and 152.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Result: SAFE, OverallTime: 4.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...